CaltechAUTHORS
  A Caltech Library Service

A first-principles approach to understanding the internet's router-level topology

Li, Lun and Alderson, David and Willinger, Walter and Doyle, John (2004) A first-principles approach to understanding the internet's router-level topology. In: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '04). Association for Computing Machinery , New York, NY, pp. 3-14. ISBN 1-58113-862-8. https://resolver.caltech.edu/CaltechAUTHORS:20170810-134129788

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170810-134129788

Abstract

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 intrusions and attacks, or for developing improved designs for resource provisioning. Previous studies of topology have focused on interpreting measurements or on phenomenological descriptions and evaluation of graph-theoretic properties of topology generators. We propose a complementary approach of combining a more subtle use of statistics and graph theory with a first-principles theory of router-level topology that reflects practical constraints and tradeoffs. While there is an inevitable tradeoff between model complexity and fidelity, a challenge is to distill from the seemingly endless list of potentially relevant technological and economic issues the features that are most essential to a solid understanding of the intrinsic fundamentals of network topology. We claim that very simple models that incorporate hard technological constraints on router and link bandwidth and connectivity, together with abstract models of user demand and network performance, can successfully address this challenge and further resolve much of the confusion and controversy that has surrounded topology generation and evaluation.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1145/1030194.1015470DOIArticle
http://dl.acm.org/citation.cfm?doid=1030194.1015470PublisherArticle
ORCID:
AuthorORCID
Doyle, John0000-0002-1828-2486
Additional Information:© 2004 ACM. Reiko Tanaka assisted in the preparation of an early version of this work. We are indebted to Matt Roughan, Ramesh Govindan, and Steven Low for detailed discussions of router-level topologies and traffic modeling, Stanislav Shalunov for data on the Abilene network, and Heather Sherman for help with the CENIC backbone.
Subject Keywords:Network topology, degree-based generators, topology metrics, heuristically optimal topology
Record Number:CaltechAUTHORS:20170810-134129788
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170810-134129788
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:80212
Collection:CaltechAUTHORS
Deposited By: Pengcheng You
Deposited On:11 Aug 2017 19:08
Last Modified:03 Oct 2019 18:28

Repository Staff Only: item control page