Improved BGP convergence via ghost flushing Export

@inproceedings{citeulike:2662908, 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).}, author = {Bremler-Barr, A. and Afek, Y. and Schwarz, S.}, booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE}, citeulike-article-id = {2662908}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1208930}, journal = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE}, keywords = {bgp, convergence, routing}, pages = {927--937 vol.2}, posted-at = {2008-04-13 06:50:39}, priority = {0}, title = {Improved BGP convergence via ghost flushing}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1208930}, volume = {2}, year = {2003} }

TY - CONF ID - citeulike:2662908 L3 - citeulike-article-id:2662908 N2 - 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). JF - INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE EP - 937 vol.2 TI - Improved BGP convergence via ghost flushing VL - 2 T2 - INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE SP - 927 KW - bgp KW - convergence KW - routing AU - Bremler-Barr, A AU - Afek, Y AU - Schwarz, S PY - 2003/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1208930 ER -