article

Understanding internet topology: principles, models, and validation

Authors:

David Alderson,

Walter Willinger,

John C. DoyleAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 13, Issue 6

Pages 1205 - 1218

https://doi.org/10.1109/TNET.2005.861250

Published: 01 December 2005 Publication History

Abstract

Building on a recent effort that combines a first-principles approach to modeling router-level connectivity with a more pragmatic use of statistics and graph theory, we show in this paper that for the Internet, an improved understanding of its physical infrastructure is possible by viewing the physical connectivity as an annotated graph that delivers raw connectivity and bandwidth to the upper layers in the TCP/IP protocol stack, subject to practical constraints (e.g., router technology) and economic considerations (e.g., link costs). More importantly, by relying on data from Abilene, a Tier-1 ISP, and the Rocketfuel project, we provide empirical evidence in support of the proposed approach and its consistency with networking reality. To illustrate its utility, we: 1) show that our approach provides insight into the origin of high variability in measured or inferred router-level maps; 2) demonstrate that it easily accommodates the incorporation of additional objectives of network design (e.g., robustness to router failure); and 3) discuss how it complements ongoing community efforts to reverse-engineer the Internet.

References

[1]

{1} Abilene Network. Detailed Information About the Objectives, Organization, and Development of the Abilene Network. {Online}. Available: http://www.Internet2.edu/abilene

[2]

{2} R. Albert and A.-L. Barab�si, "Statistical mechanics of complex networks," Rev. Modern Phys., vol. 74, no. 1, pp. 47-97, Jan. 2002.

[3]

{3} A. Albert, H. Jeong, and A.-L. Barab�si, "Attack and error tolerance of complex networks," Nature, vol. 406, pp. 378-382, 2000.

[4]

{4} D. Alderson, "Technological and economic drivers and constraints in the Internet's "Last Mile"," California Inst. Technol., Pasadena, CA, Tech. Rep. CIT-CDS-04-004, 2004.

[5]

{5} A.-L. Barab�si and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.

[6]

{6} P. Barford, A. Bestavros, J. Byers, and M. Crovella, "On the marginal utility of deploying measurement infrastructure," in Proc. 1st ACM SIGCOMM Internet Measurement Workshop, San Francisco, CA, Nov. 2001, pp. 5-17.

[7]

{7} T. Bu and D. Towsley, "On distinguishing between Internet power law topology generators," in Proc. IEEE INFOCOM, New York, 2002, pp. 638-647.

[8]

{8} K. L. Calvert, M. Doar, and E. Zegura, "Modeling Internet topology," IEEE Commun. Mag., vol. 35, no. 6, pp. 160-163, Jun. 1997.

[9]

{9} J. M. Carlson and J. Doyle, "Complexity and robustness," Proc. Nat. Acad. Sci., vol. 99, no. 1, pp. 2539-2545, Feb. 2002.

[10]

{10} H. Chang, S. Jamin, Z. M. Mao, and W. Willinger, "An empirical approach to modeling inter-AS traffic matrices," in Proc. 5th ACM SIGCOMM Internet Measurement Conf., Berkeley, CA, 2005, pp. 139-152.

[11]

{11} H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Toward capturing representative AS-level Internet topologies," in Proc. ACM SIGMETRICS, Marina Del Rey, CA, Jun. 2002, pp. 280-281.

[12]

{12} H. Chang, S. Jamin, and W. Willinger, "Internet connectivity at the AS-level: an optimization-driven modeling approach," presented at the ACM SIGCOMM Workshop on Models, Methods and Tools for Reproducible Network Research (MoMeTools) 2003, (extended version, Tech. Rep. UM-CSE-475-03, 2003, Univ. Michigan).

[13]

{13} Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "The origin of power laws in Internet topologies revisited," in Proc. IEEE INFOCOM, New York, 2002, pp. 608-617.

[14]

{14} F. Chung and L. Lu, "The average distance in a random graph with given expected degrees," Internet Math., vol. 1, pp. 91-113, 2003.

[15]

{15} Corporation for Education Network Intitiatives in California (CENIC) {Online}. Available: http://www.cenic.org

[16]

{16} D. D. Clark, "The design philosophy of the DARPA Internet protocols," Proc. ACM SIGCOMM'88, ACM Comput. Commun. Rev., vol. 18, no. 4, pp. 106-114, 1988.

[17]

{17} Skitter, Cooperative Association for Internet Data Analysis (CAIDA). {Online}. Available: http://www.caida.org/tools/measurement/skitter/

[18]

{18} M. B. Doar, "A better model for generating test networks," in Proc. IEEE GLOBECOM, London, U.K., Nov. 1996, pp. 86-93.

[19]

{19} J. C. Doyle, D. Alderson, L. Li, S. Low, M. Roughan, S. Shalunov, R. Tanaka, and W. Willinger, "The "robust yet fragile" nature of the Internet," Proc. Nat. Acad. Sci., vol. 102, no. 41, pp. 14497-14502, 2005.

[20]

{20} P. Erdos and A. Renyi, "On random graphs I," Publ. Math. Debrecen, vol. 6, pp. 290-297, 1959.

[21]

{21} A. Fabrikant, E. Koutsoupias, and C. Papadimitriou, "Heuristically optimized trade-offs: a new paradigm for power-laws in the Internet," in Proc. 29th Int. Colloq. Automata, Languages and Programming (ICALP 2002), Jul. 2002, pp. 110-122.

[22]

{22} M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the Internet topology," Proc. ACM SIGCOMM 1999, ACM Comput. Commun. Rev., vol. 29, pp. 251-262, 1999.

[23]

{23} L. Gao, "On inferring autonomous system relationships in the Internet," in Proc. IEEE GLOBECOM, San Francisco, CA, Nov. 2000, pp. 387-396.

[24]

{24} C. Gkantsidis, M. Mihail, and A. Saberi, "Conductance and congestion in power law graphs," in Proc. ACM SIGMETRICS, San Diego, CA, 2003, pp. 148-159.

[25]

{25} R. Govindan and H. Tangmunarunkit, "Heuristics for Internet map discovery," in Proc. IEEE INFOCOM, Tel Aviv, Israel, 2000, pp. 1371-1380.

[26]

{26} L. Li, D. Alderson, J. Doyle, and W. Willinger, "A first-principles approach to understanding the Internet's router-level topology," Proc. ACM SIGCOMM 2004, ACM Comput. Commun. Rev., vol. 34, pp. 3-14, 2004.

[27]

{27} L. Li, D. Alderson, J. C. Doyle, and W. Willinger, "Toward a theory of scale-free graphs: definition, properties, and implications," Internet Math., to be published.

[28]

{28} R. Mahajan, N. Spring, D. Wetherall, and T. Anderson, "Inferring link weights using end-to-end measurements," in Proc. 2nd ACM SIGCOMM Internet Measurement Workshop, Marseille, France, 2002, pp. 231-236.

[29]

{29} A. Medina, I. Matta, and J. Byers, "On the origin of power laws in Internet topologies," Comput. Commun. Rev., vol. 30, pp. 18-28, 2000.

[30]

{30} M. Mitzenmacher, "A brief history of generative models for power law and lognormal distributions," Internet Math., vol. 1, pp. 226-249, 2003.

[31]

{31} M. E. J. Newman, "The structure and function of complex networks," SIAM Rev., vol. 45, pp. 167-256, 2003.

[32]

{32} R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: a Statistical Physics Approach. Cambridge, U.K.: Cambridge Univ. Press, 2004.

[33]

{33} G. Siganos, M. Faloutsos, P. Faloutsos, and C. Faloutsos, "Power laws and the AS-level Internet topology," IEEE/ACM Trans. Netw., vol. 11, no. 4, pp. 514-524, Aug. 2003.

[34]

{34} N. Spring, M. Dontcheva, M. Rodrig, and D. Wetherall, "How to resolve IP aliases," Univ. Michigan, UW CSE Tech. Rep. 04-05-04, 2004.

[35]

{35} N. Spring, R. Mahajan, D. Wetherall, and T. Anderson, "Measuring ISP topologies with Rocketfuel," IEEE/ACM Trans. Netw., vol. 12, no. 1, pp. 2-16, Feb. 2004.

[36]

{36} N. Spring, D. Wetherall, and T. Anderson, "Reverse-engineering the Internet," in Proc. ACM SIGCOMM 2nd Workshop on Hot Topics in Networks (HotNets-II), Boston, MA, Nov. 2003, pp. 3-8.

[37]

{37} Sprintlink Router Naming Conventions {Online}. Available:http://www.sprint.net/faq/namingconvention\_sl.html

[38]

{38} L. Subramanian, S. Agarwal, J. Rexford, and R. Katz, "Characterizing the Internet hierarchy from multiple vantage points," in Proc. IEEE INFOCOM, New York, 2002, pp. 618-627.

[39]

{39} H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topology generators: degree-based versus structural," in Proc. ACM SIGCOMM 2002, Comput. Commun. Rev., vol. 32, 2002, pp. 147-159.

[40]

{40} R. Teixeira, K. Marzullo, S. Savage, and G. M. Voelker, "In search of path diversity in ISP networks," in Proc. 3rd ACM SIGCOMM Internet Measurement Conf., Miami, FL, Oct. 2003, pp. 313-318.

[41]

{41} State of Washington Master Contract for Cisco Products (2002). {Online}. Available: http://techmall.dis.wa.gov/master_contracts/intranet/routers_switches.asp

[42]

{42} B. M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas Commun., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.

[43]

{43} W. Willinger, D. Alderson, and L. Li, "A pragmatic approach to dealing with high variability in network measurements," in Proc. 4th ACM SIGCOMM Internet Measurement Conf., Taormina, Sicily, Italy, Oct. 2004, pp. 88-100.

[44]

{44} W. Willinger, D. Alderson, J. C. Doyle, and L. Li, "More "normal" than normal: Scaling distributions and complex systems," in Proc. 2004 Winter Simulation Conf., Washington, DC, pp. 130-141.

[45]

{45} W. Willinger, R. Govindan, S. Jamin, V. Paxson, and S. Shenker, "Scaling phenomena in the Internet: critically examining criticality," in Proc. Nat. Acad. Sci., vol. 99, Feb. 19, 2002, pp. 2573-2580.

[46]

{46} E. Zegura, K. L. Calvert, and M. J. Donahoo, "A quantitative comparison of graph-based models for Internet topology," IEEE/ACM Trans. Netw., vol. 5, no. 6, pp. 770-783, Dec. 1997.

[47]

{47} Y. Zhang, M. Roughan, C. Lund, and D. Donoho, "An information-theoretic approach to traffic matrix estimation," Proc. ACM SIGCOMM 2003, Comput. Commun. Rev., vol. 33, pp. 301-312, 2003.

[48]

{48} R. Zhang-Shen and N. McKeown, "Designing a predictable Internet backbone network," in Proc. ACM SIGCOMM 3rd Workshop on Hot Topics in Networks (HotNets-III), San Diego, CA, Nov. 2004.

Cited By

Brundiers ASch�ller TAschenbruck N(2022)Midpoint Optimization for Segment RoutingIEEE INFOCOM 2022 - IEEE Conference on Computer Communications10.1109/INFOCOM48880.2022.9796747(1579-1588)Online publication date: 2-May-2022
https://dl.acm.org/doi/10.1109/INFOCOM48880.2022.9796747
Kumar STiwari RKozlov SRodrigues J(2022)Minimizing delay in content-centric networks using heuristics-based in-network cachingCluster Computing10.1007/s10586-021-03405-125:1(417-431)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1007/s10586-021-03405-1
Alderson DDoyle JWillinger W(2019)Lessons from "a first-principles approach to understanding the internet's router-level topology"ACM SIGCOMM Computer Communication Review10.1145/3371934.337196449:5(96-103)Online publication date: 8-Nov-2019
https://dl.acm.org/doi/10.1145/3371934.3371964
Show More Cited By

Index Terms

Understanding internet topology: principles, models, and validation

Recommendations

A first-principles approach to understanding the internet's router-level topology
SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

A detailed understanding of the many facets of the Internet's topological structure is critical for evaluating the performance of networking protocols, for assessing the effectiveness of proposed techniques to protect the network from nefarious ...
A first-principles approach to understanding the internet's router-level topology

A detailed understanding of the many facets of the Internet's topological structure is critical for evaluating the performance of networking protocols, for assessing the effectiveness of proposed techniques to protect the network from nefarious ...
Optimal Route Reflection Topology Design
LANC '18: Proceedings of the 10th Latin America Networking Conference

Autonomous Systems (ASes) exchange routing information about networks they can reach in the Internet, and the most widely extended way to connect them is by means of Border Gateway Protocol (BGP) sessions. ASes set up external BGP (eBGP) sessions ...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 13, Issue 6

December 2005

207 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 December 2005

Published in TON Volume 13, Issue 6

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
2,184
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)3

Reflects downloads up to 21 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Brundiers ASch�ller TAschenbruck N(2022)Midpoint Optimization for Segment RoutingIEEE INFOCOM 2022 - IEEE Conference on Computer Communications10.1109/INFOCOM48880.2022.9796747(1579-1588)Online publication date: 2-May-2022
https://dl.acm.org/doi/10.1109/INFOCOM48880.2022.9796747
Kumar STiwari RKozlov SRodrigues J(2022)Minimizing delay in content-centric networks using heuristics-based in-network cachingCluster Computing10.1007/s10586-021-03405-125:1(417-431)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1007/s10586-021-03405-1
Alderson DDoyle JWillinger W(2019)Lessons from "a first-principles approach to understanding the internet's router-level topology"ACM SIGCOMM Computer Communication Review10.1145/3371934.337196449:5(96-103)Online publication date: 8-Nov-2019
https://dl.acm.org/doi/10.1145/3371934.3371964
Al-Khalidi MThomos NReed MAL-Naday MTrossen D(2019)Anchor Free IP MobilityIEEE Transactions on Mobile Computing10.1109/TMC.2018.282882018:1(56-69)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1109/TMC.2018.2828820
Lin Y(2019)Editorial: Fourth Quarter 2019 IEEE Communications Surveys and TutorialsIEEE Communications Surveys & Tutorials10.1109/COMST.2019.295058021:4(3000-3006)Online publication date: 26-Nov-2019
https://dl.acm.org/doi/10.1109/COMST.2019.2950580
Aceto GPersico VPescap� A(2019)A Survey on Information and Communication Technologies for Industry 4.0: State-of-the-Art, Taxonomies, Perspectives, and ChallengesIEEE Communications Surveys & Tutorials10.1109/COMST.2019.293825921:4(3467-3501)Online publication date: 26-Nov-2019
https://dl.acm.org/doi/10.1109/COMST.2019.2938259
Pimentel-Alarc�n D(2018)Mixture matrix completionProceedings of the 32nd International Conference on Neural Information Processing Systems10.5555/3327144.3327147(2197-2207)Online publication date: 3-Dec-2018
https://dl.acm.org/doi/10.5555/3327144.3327147
Habib SMarimuthu PThangadurai R(2018)Quantification of New Web Applications within Enterprise NetworksProceedings of the 20th International Conference on Information Integration and Web-based Applications & Services10.1145/3282373.3282385(314-320)Online publication date: 19-Nov-2018
https://dl.acm.org/doi/10.1145/3282373.3282385
Ghamry WShukry S(2017)On the Interplay of Network Structure and Routing Strategies on Network Design Methods for Mitigation of Intentional Attacks in Scale-Free NetworksJournal of Network and Systems Management10.1007/s10922-016-9400-125:3(508-535)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1007/s10922-016-9400-1
�etinkaya EAlenazi MPeck ARohrer JSterbenz J(2015)Multilevel resilience analysis of transportation and communication networksTelecommunications Systems10.1007/s11235-015-9991-y60:4(515-537)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1007/s11235-015-9991-y
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents