Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Improved BGP Convergence via Ghost Flushing Yehuda Afek Anat Bremler-Barr Shemer Schwarz
 

Summary: Improved BGP Convergence via Ghost Flushing
Yehuda Afek Anat Bremler-Barr Shemer Schwarz
Tel-Aviv University Interdisciplinary Center Herzliya Tel-Aviv University
afek@cs.tau.ac.il bremler@idc.ac.il shemers@hotmail.com
Abstract
In [?, ?] 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 Inter-
net. In this paper we suggest a minor modification to BGP that eliminates the problem
pointed out and substantially reduces the convergence time and communication complex-
ity 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 des-
tination) 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 announce-
ments propagate as they do in BGP with a delay at each node of one minRouteAdver
(except for the first wave of announcements). As a by product of this work, a new state-
less mechanism to overcome the counting to infinity problem is provided, which compares
favorably with other known stateless mechanisms (in RIP, and IGRP).
Keywords: Routing protocol, BGP convergence
1 Introduction
1.1 The BGP Convergence Problem

  

Source: Afek, Yehuda - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences