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

  • Authors:

  • Lun Li;David Alderson;Walter Willinger;John Doyle

  • Affiliations:

  • California Institute of Technology;California Institute of Technology;California Institute of Technology;California Institute of Technology

  • Venue:
  • Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.