632 search results - page 27 / 127 » On Routing in Circulant Graphs |
ISAAC
1999
Springer
14 years 2 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
PERCOM
2010
ACM
13 years 8 months ago
2010
ACM
Opportunistic networking - forwarding messages in a disconnected mobile ad hoc network via any encountered nodes - otters a new mechanism for exploiting the mobile devices that man...
PADS
2005
ACM
14 years 3 months ago
2005
ACM
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
JNSM
2006
13 years 9 months ago
2006
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...