Improved BGP convergence via ghost flushing

Anat Bremler-Barr, Yehuda Afek, Shemer Schwarz

Research output: Contribution to journalConference articlepeer-review

Abstract

In [1], [2] it was noticed that sometimes it takes BGP a substantial amount of time and messages to converge and stabilize following the failure of some node in the Internet. In this paper we suggest a minor modification to BGP that eliminates the problem pointed out and substantially reduces the convergence time and communication complexity of BGP. Roughly speaking, our modification ensures that bad news (the failure of a node/edge) propagate fast, while good news (the establishment of a new path to a destination) propagate somewhat slower. This is achieved in BGP by allowing withdrawal messages to propagate with no delay as fast as the network forwards them, while announcements propagate as they do in BGP with a delay at each node of one minRouteAdver (except for the first wave of announcements).

Original languageEnglish
Pages (from-to)927-937
Number of pages11
JournalProceedings - IEEE INFOCOM
Volume2
DOIs
StatePublished - 2003
Event22nd Annual Joint Conference on the IEEE Computer and Communications Societies - San Francisco, CA, United States
Duration: 30 Mar 20033 Apr 2003

Fingerprint

Dive into the research topics of 'Improved BGP convergence via ghost flushing'. Together they form a unique fingerprint.

Cite this