A BGP Solver for Hot-Potato Routing Sensitivity Analysis
Sun, 04/01/2007 - 01:54 by Damien Leroy
Abstract
The interactions between the IGP and BGP routing protocols which are running
inside an ISP’s network are sometimes hard to understand. The problem becomes
particularly complex when there are dozens of routers/links and several
thousands of destination prefixes. In this paper, we present a publicly available
routing solver to evaluate routing what-if scenarios. The solver is able to model
the complete network of an ISP and given the external routes learned by this
ISP, to compute the paths towards all the destination prefixes. We demonstrate
the use of our routing solver, C-BGP, by showing the results of an analysis of
the link/router failure sensitivity in a transit network. Based on the analysis’
results, we can pinpoint links/routers whose failure has an important impact on
the selection of BGP routes. The deployment of protection techniques that are
used for optical links, SONET-SDH and MPLS should be considered for these
links/routers.
- Authors
- B. Quoitin and S. Tandel
- Source
11th Open European Summer School (EUNICE 2005) , Madrid, Spain, March 6-8 2005.
- 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.