Sciweavers

306 search results - page 36 / 62
» Routing Algorithms for Anycast Messages
Sort
View
SPAA
2009
ACM
16 years 10 days ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
GLOBECOM
2008
IEEE
15 years 6 months ago
Routing with Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...
SIROCCO
2008
15 years 1 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
GLOBECOM
2006
IEEE
15 years 5 months ago
Progressive Accumulative Routing in Wireless Networks
This paper considers a sensor network where relay nodes cooperate in order to minimize the total energy consumption for the unicast transmission of a message from a single source ...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 6 months ago
BGP-lens: patterns and anomalies in internet routing updates
The Border Gateway Protocol (BGP) is one of the fundamental computer communication protocols. Monitoring and mining BGP update messages can directly reveal the health and stabilit...
B. Aditya Prakash, Nicholas Valler, David Andersen...