CiteSeerX — Compact Routing on Internet-Like Graphs

Compact Routing on Internet-Like Graphs (2003) [30 citations — 4 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Krioukov03compactrouting,
    author = {Dmitri Krioukov and Kevin Fall and Xiaowei Yang},
    title = {Compact Routing on Internet-Like Graphs},
    booktitle = {IN PROC. IEEE INFOCOM},
    year = {2003},
    pages = {209--219},
    publisher = {}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

The Thorup-Zwick (TZ) compact routing scheme is the first generic stretch-3 routing scheme delivering a nearly optimal per-node memory upper bound. Using both direct analysis and simulation, we derive the stretch distribution of this routing scheme on Internet-like interdomain topologies. By investigating the TZ scheme on random graphs with power-law node degree distributions, P k k -# , we find that the average TZ stretch is quite low and virtually independent of #. In particular, for the Internet interdomain graph with # 2.1, the average TZ stretch is around 1.1, with up to 70% of all pairwise paths being stretch-1 (shortest possible). As the network grows, the average stretch slowly decreases. The routing table is very small, too. It is well below its upper bounds, and its size is around 50 records for -node networks. Furthermore, we find that both the average shortest path length (i.e. distance) d and width of the distance distribution # observed in the real Internet inter-AS graph have values that are very close to the minimums of the average stretch in the d- and #-directions. This leads us to the discovery of a unique critical point of the average TZ stretch as a function of d and #. The Internet distance distribution is located in a close neighborhood of this point. This is remarkable given the fact that the Internet interdomain topology has evolved without any direct attention paid to properties of the stretch distribution. It suggests the average stretch function may be an indirect indicator of the optimization criteria influencing the Internet's interdomain topology evolution.

Citations

1192	Random Graphs – Bollobás - 1985
904	On the evolution of random graphs – Erdős, Rényi - 1961
829	Emergence of scaling in random networks – Barabasi, Albert - 1999
786	On power-law relationships of the Internet topology – Faloutsos, Faloutsos, et al. - 1999
401	The Small World Problem – Milgram - 1967
233	A random graph model for massive graphs – Aiello, Chung, et al. - 2000
118	Evolution of Networks: From Biological Nets to the Internet and WWW – Dorogovtsev, Mendes - 2003
112	Network topology generators: Degree-based vs. structural – Tangmunarunkit, Govindan, et al.
107	Approximate distance oracles – Thorup, Zwick - 2001
104	Compact routing schemes – Thorup, Zwick
88	L: The average distances in random graphs with given expected degrees – Chung, Lu
76	Hierarchical routing for large networks: Performance evaluation and optimization – Kleinrock, Kamoun
69	Compact routing with minimum stretch – Cowen - 1999
51	Scaling inter-Domain Routing – Huston - 2001
46	Space-efficiency for routing schemes of stretch factor three – Gavoille, Gengler - 2001
43	Scaling phenomena in the Internet: Critically examining criticality – Willinger, Govindan, et al. - 2002
24	Memory requirement for routing in distributed networks – Gavoille, Pérennès - 1996
21	The origin of power laws – Chen, Chang, et al. - 2002
16	Compact routing with name independence – Arias, Cowen, et al.
12	Internet topology at the router and autonomous system level – Vazquez, Pastor-Satorras, et al.
11	kc Claffy. Internet expansion, refinement and churn – Broido, Nemeth
10	Space-efficient routing tables for almost all networks and the incompressibility method – BUHRMAN, HOEPMAN, et al. - 1998
10	Samukhin, “Metric structure of random networks – Dorogovtsev, Mendes, et al.
7	Pseudofractal scale-free web,” Phys – Dorogovtsev, Goltsev, et al.
6	Internet connectivity at the AS level: An optimization driven modeling approach – Chang, Jamin, et al. - 2003
2	The Nimrod Routing – Castineyra, Chiappa, et al. - 1992
2	ISLAY: A New Routing and Addressing – Kastenholz - 2002
1	Introduction to Probabilty Models (7th ed – Ross - 2000