Improved BGP convergence via ghost flushing

Author

Bremler-Barr, Anat ; Afek, Y. ; Schwarz, Stefan

Author_Institution

Tel Aviv Univ., Israel

Volume

2

fYear

2003

Firstpage

927

Abstract

In (Ref.1), (Ref.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).

Keywords

Internet; communication complexity; convergence; protocols; BGP convergence; Internet node failure; announcement propagation; communication complexity; convergence time; destination path establishment; ghost flushing solution; minRouteAdver; node delay; withdrawal message propagation; Complexity theory; Convergence; Failure analysis; H infinity control; IEEE news; Information analysis; Network topology; Propagation delay; Routing protocols; Web and internet services;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies

Conference_Location

San Francisco, CA

ISSN

0743-166X

Print_ISBN

0-7803-7752-4

Type

conf

DOI

10.1109/INFCOM.2003.1208930

Filename

1208930