Sciweavers

177 search results - page 9 / 36
» Stackelberg Routing in Arbitrary Networks
Sort
View
SPAA
2006
ACM
14 years 1 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
SPAA
2006
ACM
14 years 1 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
IAJIT
2008
145views more  IAJIT 2008»
13 years 7 months ago
NAMP: Neighbor Aware Multicast Routing Protocol for Mobile Ad Hoc Networks
: A Mobile Ad Hoc Network (MANET) represents a system of wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary network topologies without...
Al-Sakib Khan Pathan, Muhammad Mostafa Monowar, Md...
CAL
2002
13 years 7 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally