• DocumentCode
    2697884
  • Title

    An inherently anomaly-free iBGP architecture

  • Author

    Bornhauser, Uli ; Martini, Peter ; Horneffer, Martin

  • Author_Institution
    Inst. of Comput. Sci. IV, Univ. of Bonn, Bonn, Germany
  • fYear
    2009
  • fDate
    20-23 Oct. 2009
  • Firstpage
    145
  • Lastpage
    152
  • Abstract
    Especially for large Network Operators (NOs), eliminating routing anomalies is an important aspect for the internal BGP design. To avoid such unwanted effects, classical architectures have need of certain restrictions kept in both, the network design and the iBGP peering. However, these restrictions are in conflict with the optimized network designs NOs seek. In this study we develop an inherently anomaly-free iBGP architecture that takes the demands of NOs into account. It is based on a central server that guarantees consistent local views in the entire system. This is done by exchanging additional routing information with the Border Routers of the Autonomous System. The architecture implements the results of iBGP analyses made in. Despite not being that as flexible as classical information reduction techniques, our design scales equal or better in practice. All required protocol extensions are supported by IETF Internet Drafts from persons affiliated with important router vendors.
  • Keywords
    internetworking; routing protocols; Border routers; anomaly-free iBGP architecture; autonomous system; border gateway protocol; iBGP peering; network operators; optimized network design; protocol extensions; routing anomalies; routing information; Computer architecture; Computer networks; Computer science; Convergence; Design engineering; Internet; Protocols; Reflection; Routing; Scalability; Avoidance; Border Gateway Protocol; Communication System Routing; Networks; Routing Anomalies;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local Computer Networks, 2009. LCN 2009. IEEE 34th Conference on
  • Conference_Location
    Zurich
  • Print_ISBN
    978-1-4244-4488-5
  • Electronic_ISBN
    978-1-4244-4487-8
  • Type

    conf

  • DOI
    10.1109/LCN.2009.5355200
  • Filename
    5355200