Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Communications of the ACM
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
IEEE Internet Computing
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Probabilistic methods in massive graphs and internet computing
Probabilistic methods in massive graphs and internet computing
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Routing in Networks with Low Doubling Dimension
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Name-independent compact routing in trees
Information Processing Letters
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
A stochastic clustering algorithm for swarm compact routing
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Powernet: compact routing on Internet-like random networks
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Compact routing in power-law graphs
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Phase changes in the evolution of the IPv4 and IPv6 AS-Level Internet topologies
Computer Communications
Hi-index | 0.24 |
Compact routing intends to achieve a good tradeoff between routing path length and storage overhead, and is recently considered as a main alternative to overcome the fundamental scaling limitations of the Internet routing system. It is generally believed that specialized compact routing schemes for peculiar network topologies have better average performance than universal ones, and name-independent schemes are more flexible due to their natural support of the Locator/ID split principle. In this paper, we propose the highest degree landmark based routing scheme (HDLBR), which is the first specialized name-independent compact routing scheme for Internet-like power-law networks. HDLBR optimizes routing performance by selecting a few nodes with high degrees as the landmarks and making these nodes to be the entrances for mapping topologically agnostic node names to topology-aware node addresses. Simulation results show that HDLBR has very small average routing table size, in the order of O~(n^1^/^2) bits per node on both synthesized power-law graphs and the real AS graphs. Meanwhile, the average stretch of the HDLBR scheme is comparable with the base Abraham scheme using random coloring, and is only slightly outperformed by the customized Abraham scheme which also takes into account the degree heterogeneity of power-law networks.