A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Compact Routing on Power Law Graphs with Additive Stretch
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX)
We present a universal routing scheme for unweighted, undirected networks that always routes a packet along a path whose length is at most an additive factor of d more than opt (where opt is the length of an optimal path), using O(e log 2 n)-bit local routing tables and packet addresses, with d and e parameters of the network topology. For powerlaw random graphs, we demonstrate experimentally that d and e take on small values. The Thorup-Zwick universal multiplicative stretch 3 scheme hasdoi:10.1137/1.9781611972863.12 dblp:conf/alenex/BradyC06 fatcat:fdx5etsqujhvzkgok66d7by5mu