Paper Info
Title
Compact Routing on Power Law Graphs with Additive Stretch.
Abstract
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 power-law random graphs, we demonstrate experimentally that d and e take on small values. The Thorup-Zwick universal multiplicative stretch 3 scheme has recently been suggested for routing on the Internet inter-AS graph; we argue, based on the results in this paper, that it is possible to improve worst-case performance on this graph by directly exploiting its power-law topology.
Year
Venue
Field
2006
SIAM Proceedings Series
Discrete mathematics,Link-state routing protocol,Mathematical optimization,Combinatorics,Equal-cost multi-path routing,Random graph,Computer science,Static routing,Destination-Sequenced Distance Vector routing,DSRFLOW,Network topology,Routing table
DocType
Citations 
PageRank 
Conference
29
1.37
References 
Authors
19
2
Name
Order
Citations
PageRank
Arthur Brady11036.38
Lenore Cowen234731.06