5 search results - page 1 / 1 » Fast Geometric Routing with Concurrent Face Traversal |
OPODIS
2008
13 years 5 months ago
2008
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
CCCG
2008
13 years 5 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract-- Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. Ho...
ICC
2011
IEEE
12 years 3 months ago
2011
IEEE
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...