The contents of this legacy page are no longer maintained nor supported, and are made available only for historical purposes.

Bibliography Details

D. Pei, X. Zhao, L. Wang, D. Massey, A. Mankin, S. Wu, and L. Zhang, "Improving BGP Convergence Through Consistency Assertions", in IEEE INFOCOM, New York, NY, Jun 2002.

Improving BGP Convergence Through Consistency Assertions
Authors: D. Pei
X. Zhao
L. Wang
D. Massey
A. Mankin
S. Wu
L. Zhang
Published: IEEE INFOCOM, 2002
Entry Date: 2003-01-28
Datasets: The topologies used for simulations were derived from a BGP routing table obtained from Oregon RouteViews.
  • Proposes two protocol assertions which apply to a Simple Path Vector Protocol (SPVP). An SPVP is a simplified model of BGP in which, roughly speaking, each AS consists of a single router, and policy withdrawals (as opposed to failure withdrawals) do not occur. The assertions improve an SPVP's convergence properties after route withdrawals and route changes.
  • These assertions are subsequently refined for use with BGP, and are capable of dealing with traffic engineering (where routers in an AS announce different routes to neighbouring ASes), policy withdrawal, and AS partitions. The assertions are implemented by modified BGP routers and are compatible with unmodified BGP. The enhancements consist of (1) community attributes that provide additional information for ASes in the AS path of a BGP update message, (2) changes to BGP update processing and route selection, (3) a community attribute that is included in a BGP update for a failure withdrawal, and (4) a capability to indicate support for the latter commuity attribute to BGP neighbours.
  • In a network testbed these techniques improved BGP convergence time for a failure withdrawal from 30.3 seconds to 0.3 seconds, and convergence time after a route change from 64.9 seconds to 0.1 second.
  • In simulation tests with a 60-AS network topology, the convergence time after failure withdrawal improved from 337.0 seconds to 19.5 seconds, and the convergence time after a route failover improved from 471.2 seconds to 93.9 seconds.
  • Addresses the problem of delayed BGP convergence described by:
    • C. Labovitz, A. Ahuja, A Bose, and F. Jahanian, "Delayed Internet Routing Convergence," in Proceedings of the ACM Sigcomm, Aug. 2000.
    • T. Griffin and B. Premore, "An Experimental Analysis of BGP Convergence Time," in Proceedings of ICNP, Nov. 2001.
    • C. Labovitz, R. Wattenhofer, S. Venkatachary, and A. Ahuja, "The Impact of Internet Policy and Topology on Delayed Routing Convergence," in Proceedings of IEEE INFOCOM, Apr. 2001.