IGen: Generation of router-level Internet topologies through network design heuristics

Network researchers often need to evaluate newly proposed algorithms and protocols over realistic topologies. Many researchers use random networks for such evaluations. Unfortunately, random networks do not accurately model real networks and important parameters such as link metrics or iBGP configurations are often ignored. We propose IGen, a freely available topology generator that uses network design heuristics to generate realistic IP network topologies. We explain the objectives of IGen and describe the topology generation process in details.

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

[2]  G. Di Battista,et al.  Computing the types of the relationships between autonomous systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Anees Shaikh,et al.  A comparison of overlay routing and multihoming route control , 2004, SIGCOMM '04.

[4]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[5]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[6]  Walter Willinger,et al.  Towards capturing representative AS-level Internet topologies , 2004, Comput. Networks.

[7]  Lakshminarayanan Subramanian,et al.  An investigation of geographic mapping techniques for internet hosts , 2001, SIGCOMM 2001.

[8]  Renata Teixeira,et al.  General Terms Measurement , 2022 .

[9]  Lixin Gao,et al.  On inferring autonomous system relationships in the Internet , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[10]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[11]  Subhash Suri,et al.  Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[12]  Barry Raveendran Greene,et al.  Cisco ISP Essentials , 2002 .

[13]  Francesca Lo Piccolo,et al.  The effect of heterogeneous link capacities in BitTorrent-like file sharing systems , 2004, 2004 International Workshop on Hot Topics in Peer-to-Peer Systems.

[14]  Samphel Norden,et al.  Inter-domain routing: Algorithms for QoS guarantees , 2005, Comput. Networks.

[15]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[16]  Giuseppe Di Battista,et al.  Computing the types of the relationships between autonomous systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[17]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Steve Uhlig,et al.  Quantifying the BGP Routes Diversity Inside a Tier-1 Network , 2006, Networking.

[19]  Ibrahim Matta,et al.  On the geographic location of Internet resources , 2003, IEEE J. Sel. Areas Commun..

[20]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[21]  Anja Feldmann,et al.  NetScope: traffic engineering for IP networks , 2000, IEEE Netw..

[22]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[23]  James R. Eagan,et al.  Extending and enhancing GT-ITM , 2003, MoMeTools '03.

[24]  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).

[25]  Dmitri V. Krioukov,et al.  Revisiting Internet AS-Level Topology Discovery , 2005, PAM.

[26]  Chen-Nee Chuah,et al.  Feasibility of IP restoration in a tier 1 backbone , 2004, IEEE Network.

[27]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[28]  Robert S. Cahn,et al.  Wide Area Network Design , 1998 .

[29]  Ravishanker Chandra,et al.  BGP Route Reflection An alternative to full mesh IBGP , 1996, RFC.

[30]  Bianca Schroeder,et al.  IGP link weight assignment for transient link failures , 2003 .

[31]  R.S. Cahn.  Wide area network design: concepts and tools for optimization [Book Review] , 2000, IEEE Communications Magazine.

[32]  Dmitri Krioukov,et al.  Towards a Topology Generator Modeling AS Relationships , 2005, ICNP 2005.

[33]  Rob Sherwood,et al.  Discarte: a disjunctive internet cartographer , 2008, SIGCOMM '08.

[34]  Walter Willinger,et al.  Toward an optimization-driven framework for designing and generating realistic Internet topologies , 2003, CCRV.

[35]  C. Monma,et al.  Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints , 1989, Oper. Res..

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