Achieving Sub-50 Milliseconds Recovery Upon BGP Peering Link Failures

Sat, 06/23/2007 - 11:33 by Olivier Bonaventure


Recent measurements show that BGP peering links can fail as frequently
as intradomain links and usually for short periods of time.
We propose a new fast-reroute technique where
routers are prepared to react quickly to interdomain link failures.
For each of its interdomain links,
a router precomputes a protection tunnel, i.e. an IP tunnel to
an alternate nexthop which can reach the same destinations as
via the protected link. We propose a BGP-based auto-discovery technique that
allows each router to learn the candidate protection tunnels for its links.
Each router selects the best protection tunnels for its links and when
it detects an interdomain link failure, it immediately encapsulates
the packets to send them through the protection tunnel. Our solution is applicable for
the links between large transit ISPs and also for the links
between multi-homed stub networks and their providers.
Furthermore, we show that transient forwarding loops (and thus the corresponding
packet losses) can be avoided during the
routing convergence that follows the deactivation of a protection tunnel
in BGP/MPLS VPNs and in IP networks using encapsulation.

Olivier Bonaventure, Clarence Filsfils and Pierre Francois
IEEE/ACM Transactions on Networking, 15(5):1123 - 1135, October 2007.
Full text
pdf   (1.33 MB)
Cite it
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

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.