Analyzing and modeling router-level internet topology and application to routing control

Measurement studies on the Internet topology show that connectivities of nodes exhibit power-law attribute, but it is apparent that only the degree distribution does not determine the network structure, and especially true when we study the network-related control like routing control. In this paper, we first reveal structures of the router-level topologies using the working ISP networks, which clearly indicates ISP topologies are highly clustered; a node connects two or more nodes that also connected each other, while not in the existing modeling approaches. Based on this observation, we develop a new realistic modeling method for generating router-level topologies. In our method, when a new node joins the network, the node likely connects to the nearest nodes. In addition, we add the new links based on the node utilization in the topology, which corresponds to an enhancement of network equipments in ISP networks. With appropriate parameters, important metrics, such as the a clustering coefficient and the amount of traffic that pass through nodes, exhibit the similar value of the actual ISP topology while keeping the degree distribution of resulting topology to follow power-law. We then apply the routing control method to the ISP topologies and show that the optimal routing method gives much smaller maximum link utilization (about 1/3) compared with the minimum hop routing which is often used in the operating networks. Accordingly, we examine a heuristic routing method suitable to the ISP topologies with consideration of technology constraints of IP routers. The evaluation results show that our modeling method can be actually used for evaluations on routing control.

[1]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[2]  José Ignacio Alvarez-Hamelin,et al.  An internet graph model based on trade-off optimization , 2004 .

[3]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

[4]  Daniel Massey,et al.  Collecting the internet AS-level topology , 2005, CCRV.

[5]  Miguel Rio,et al.  Network topologies: inference, modeling, and generation , 2008, IEEE Communications Surveys & Tutorials.

[6]  Michalis Faloutsos,et al.  Power laws and the AS-level internet topology , 2003, TNET.

[7]  Christos H. Papadimitriou,et al.  Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet , 2002, ICALP.

[8]  Olivier Bonaventure,et al.  IGen: Generation of router-level Internet topologies through network design heuristics , 2009, 2009 21st International Teletraffic Congress.

[9]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Shi Zhou,et al.  Accurately modeling the Internet topology , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[12]  B. Bollobás.  The evolution of random graphs , 1984 .

[13]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[14]  Srinivasan Seshan,et al.  Scaling properties of the Internet graph , 2003, PODC '03.

[15]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[16]  Christos Gkantsidis,et al.  Conductance and congestion in power law graphs , 2003, SIGMETRICS '03.

[17]  Miguel Rio,et al.  Tuning Topology Generators Using Spectral Distributions , 2008, SIPEW.

[18]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[19]  L. Ginsberg,et al.  Cisco Systems , 2003 .

[20]  M. Newman.  Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[21]  Walter Willinger,et al.  Scaling phenomena in the Internet: Critically examining criticality , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[22]  Walter Willinger,et al.  A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM '04.

[23]  B. Kahng,et al.  Reply to "Comment on 'Universal Behavior of Load Distribution in Scale-Free Networks'" , 2003 .

[24]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[25]  Masayuki Murata,et al.  Dynamics of Feedback-Induced Packet Delay in Power-Law Networks , 2010, 2010 Fifth International Conference on Systems and Networks Communications.

[26]  Ralf Steinmetz,et al.  Generating realistic ISP-level network topologies , 2003, IEEE Communications Letters.

[27]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[28]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[29]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[30]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[31]  Béla Bollobás,et al.  Degree Distribution of the FKP Network Model , 2003, ICALP.

[32]  Benoit Donnet,et al.  Internet topology discovery: a survey , 2007, IEEE Communications Surveys & Tutorials.

[33]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[34]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[35]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).