BGP Prefix Independent Convergence (PIC) Technical Report

Sat, 03/19/2011 - 15:14 by Olivier Bonaventure

Abstract

With the explosive growth of the Internet and the growing deployment of layer 3 virtual private networks (L3VPN), the size of the Border Gateway Protocol (BGP) routing table has dramatically increased over the past years (in the 750K range in early 2007 counting Internet and L3VPN routes in a typical major Service Provider). Studies have shown that dynamics of BGP may cause several minutes of packet loss during network failures. This duration increases further as the routing table grows, as the traditional convergence operation scales with the number of prefixes. In this paper, we present an alternate solution to provide BGP convergence and demonstrate that it is possible to limit the traffic loss period to sub-second for any failure occurring within the network of a service provider (SP) or on peering links with redundantly-connected peers. This covers the vast majority (if not all) of business models involving tight BGP convergence requirements. We term this alternate solution as BGP Prefix Independent Convergence (PIC) since it works by triggering an immediate and prefix-independent dataplane rerouting of the BGP destinations via the alternate path at Interior Gateway Protocol (IGP) convergence time. We present experimental results of the convergence behavior based on a benchmark of a commercially available carrier router that supports the BGP PIC solution, and on BGP data provided by a Tier-1 ISP.

Authors
Clarence Filsfils, Pradosh Mohapatra, John Bettink, Pranav Dharwadkar, Peter De Vriendt, Yuri Tsier, Virginie Van Den Schrieck, Olivier Bonaventure and Pierre Francois
Type
Technical Report
Source
2011.
Notes
http://www.cisco.com/en/US/prod/collateral/routers/ps5763/bgp_pic_techni...
Cite it
BibTex
Copyright
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

 

AttachmentSize
bgp_pic_technical_report.pdf 355.55 KB