Sciweavers

167 search results - page 4 / 34
» Multi-robot routing under limited communication range
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer
ICC
2009
IEEE
167views Communications» more  ICC 2009»
13 years 5 months ago
Efficient Adaptive Routing in Delay Tolerant Networks
Conventional routing algorithms in mobile ad hoc networks (MANETs), i.e., multi-hop forwarding, assume the existence of contemporaneous source-destination paths and are not scalabl...
Cong Liu, Jie Wu
IWCMC
2006
ACM
14 years 1 months ago
Performance analysis of epidemic routing under contention
Epidemic routing has been proposed as a robust transmission scheme for sparse mobile ad hoc networks. Under the assumption of no contention, epidemic routing has the minimum end-t...
Apoorva Jindal, Konstantinos Psounis
AUTONOMICS
2007
ACM
13 years 11 months ago
End-to-end vs. hop-by-hop transport under intermittent connectivity
This paper revisits the fundamental trade-off between endto-end and hop-by-hop transport control. The end-to-end principle has been one of the building blocks of the Internet; but...
Simon Heimlicher, Merkourios Karaliopoulos, Hanoch...
P2P
2007
IEEE
153views Communications» more  P2P 2007»
14 years 1 months ago
On Routing in Distributed Hash Tables
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...