Real-time model and convergence time of BGP

25 June 2003

proceedings article
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 2, 893-901
https://doi.org/10.1109/infcom.2002.1019336

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. Fi- nally, we show how to the use the theorem to prove conver- gence and estimate convergence time in three case studies.

Keywords

This publication has 7 references indexed in Scilit:

Policy disputes in path-vector protocols
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
The impact of Internet policy and topology on delayed routing convergence
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
A safe path vector protocol
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Stable Internet routing without global coordination
Published by Association for Computing Machinery (ACM) ,2000
Persistent route oscillations in inter-domain routing
Computer Networks, 2000
An analysis of BGP convergence properties
ACM SIGCOMM Computer Communication Review, 1999
A Border Gateway Protocol 4 (BGP-4)
Published by RFC Editor ,1995