306 search results - page 28 / 62 » Routing Algorithms for Anycast Messages |
94
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
51
Voted
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing th...
138
click to vote
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
Scatternet formation must be addressed before any ad hoc network protocol can be run over Bluetooth. This is due to the frequency hop nature and piconet unit of Bluetooth. In this...
102
click to vote
JCO
2006
14 years 11 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
CLUSTER
2006
IEEE
15 years 5 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...