Preventing the Unnecessary Propagation of BGP Withdraws

user warning: Can't create/write to file '/tmp/#sql_4d68_0.MYI' (Errcode: 30) query: SELECT t.* FROM inl_term_node r INNER JOIN inl_term_data t ON r.tid = t.tid INNER JOIN inl_vocabulary v ON t.vid = v.vid LEFT JOIN inl_term_data tac_td ON t.tid = tac_td.tid WHERE (t.tid IN (0, 1) OR tac_td.vid NOT IN (1)) AND ( r.nid = 569 ) ORDER BY v.weight, t.weight, t.name in /var/www/obonet/includes/database.mysql.inc on line 174.
Tue, 03/10/2009 - 17:23 by Virginie Van den Schrieck

Abstract

Due to the way BGP paths are distributed over iBGP sessions inside an
Autonomous System (AS), a BGP withdraw that follows a failure may be propa-
gated outside the AS although other routers of the AS know a valid alternate path.
This causes transient losses of connectivity and contributes to the propagation of
a large number of unnecessary BGP messages. In this paper, we show, based on
RouteViews data, that a significant number of BGP withdraws are propagated
even though alternate paths exists in another border router of the same AS. We
propose an incrementally deployable solution based on BGP communities that
allows the BGP routers of an AS to suspend the propagation of BGP withdraws
when an alternate path is available at the borders of their AS.

Authors
Virginie Van den Schrieck, Pierre Francois, Cristel Pelsser and Olivier Bonaventure
Source
In Luigi Fratta, Henning Schulzrinne, Yutaka Takahashi, and Otto Spaniol, editor, Proceedings of IFIP Networking, pages 495-508, May 2009. Springer Verlag.
Full text
pdf    (290.7 KB)
Slides
pdf    (443.08 KB)
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.