• DocumentCode
    1966013
  • Title

    Internet topology on as-level: Model, generation methods and tool

  • Author

    Tomasik, Joanna ; Weisser, Marc-Antoine

  • Author_Institution
    Comput. Sci. Dept., SUPELEC Syst. Sci., Gif-sur-Yvette, France
  • fYear
    2010
  • fDate
    9-11 Dec. 2010
  • Firstpage
    263
  • Lastpage
    270
  • Abstract
    Numerous studies based on complex measurement platforms have been carried out for over ten years now in order to discover the Internet topology on domain level. It turns out that this topology exhibits certain invariant properties such as a distribution of node degree. This distribution follows a power law. Moreover, the revealed topology is hierarchical. The hierarchy is caused by commercial contracts signed between domain operators. The routing realized by Border Gateway Protocol (BGP) is strongly influenced by these commercial relationships because operators do not want to make public the routes they know, as announcing certain routes would deprive them of a possible financial benefit. Consequently, routes available in BGP tables are of particular shape (valley-free). This fact has an impact on the performance of protocols which are proposed notably to assure the Quality of Service (QoS). In order to evaluate the performance of new protocols in the inter-domain context their designers have to have at their disposal a random topology generator which is able to furnish a random graph whose nodes´ degree follows a power law typical for the Internet, and to impose the commercial hierarchy on it. Our aSHIIP (autonomous Supélec Hierarchy Inter-domain Program) does both: its synthetic topologies are realistic and the hierarchy, which it introduces, corresponds to the one of the Internet. After explaining the reasons for our study, we present the methods which we propose to use for the flat Internet topology generation which satisfies the realism of the Internet. Next, we explain our algorithm used to induct the commercial hierarchy. The algorithm is heuristic because, as we prove in this paper, the underlying problem is NP-complete. We then evaluate the topologies generated with aSHIIP. The result is a reliable flat Internet-like topology generator which also allows the modeler to introduce the realistic hierarchy. We are convinced we can recommend it to model- - ers dealing with performance evaluation of protocols for the Internet on domain level.
  • Keywords
    Internet; computational complexity; computer network performance evaluation; internetworking; protocols; quality of service; telecommunication network routing; telecommunication network topology; AS-level; Internet topology; Internet-like topology generator; NP-complete; aSHIIP; autonomous Supélec hierarchy inter-domain program; border gateway protocol; complex measurement platforms; performance evaluation; quality of service; random graph; random topology generator; Generators; Internet topology; Network topology; Peer to peer computing; Quality of service; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Performance Computing and Communications Conference (IPCCC), 2010 IEEE 29th International
  • Conference_Location
    Albuquerque, NM
  • ISSN
    1097-2641
  • Print_ISBN
    978-1-4244-9330-2
  • Type

    conf

  • DOI
    10.1109/PCCC.2010.5682300
  • Filename
    5682300