• DocumentCode
    380669
  • Title

    Real-time model and convergence time of BGP

  • Author

    Obradovic, Davor

  • Author_Institution
    Pennsylvania Univ., Philadelphia, PA, USA
  • Volume
    2
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    893
  • Abstract
    BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time model of BGP. We then state and prove a general theorem providing an upper bound on convergence time. Finally, we show how to the use the theorem to prove convergence and estimate convergence time in three case studies.
  • Keywords
    convergence; graph theory; routing protocols; BGP; convergence time; general preference policies; real-time model; route selection; routers; upper bound; Concatenated codes; Convergence; Distributed algorithms; Peer to peer computing; Routing protocols; Shortest path problem; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
  • ISSN
    0743-166X
  • Print_ISBN
    0-7803-7476-2
  • Type

    conf

  • DOI
    10.1109/INFCOM.2002.1019336
  • Filename
    1019336
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=380669