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...
Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
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...
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...
—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...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...