Sciweavers

306 search results - page 25 / 62
» Routing Algorithms for Anycast Messages
Sort
View
CONEXT
2006
ACM
15 years 5 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford
ICT
2004
Springer
147views Communications» more  ICT 2004»
15 years 5 months ago
A Heuristic Approach to Energy Saving in Ad Hoc Networks
This paper presents a new algorithm, Extra, for extending the lifetime of ad hoc networks. Extra tries to conserve energy by identifying and switching off nodes that are momentaril...
R. I. da Silva, Julius C. B. Leite, M. P. Fernande...
APPINF
2003
15 years 1 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar
MOBIQUITOUS
2005
IEEE
15 years 5 months ago
Content-Based Routing in Mobile Ad Hoc Networks
The publish/subscribe model of communication provides sender/receiver decoupling and selective information dissemination that is appropriate for mobile environments characterized ...
Milenko Petrovic, Vinod Muthusamy, Hans-Arno Jacob...
INFOCOM
2012
IEEE
13 years 2 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley