ACM Home Page
Please provide us with feedback. Feedback
An analysis of BGP convergence properties
Full text PdfPdf (1.35 MB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 29 ,  Issue 4  (October 1999) table of contents
Pages: 277 - 288  
Year of Publication: 1999
ISSN:0146-4833
Also published in ...
Authors
Timothy G. Griffin  Bell Laboratories, Lucent Technologies, 600 Mountain Avenue, Murray Hill, NJ
Gordon Wilfong  Bell Laboratories, Lucent Technologies, 600 Mountain Avenue, Murray Hill, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 119,   Downloads (12 Months): 281,   Citation Count: 60
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/316194.316231
What is a DOI?

ABSTRACT

The Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol used to exchange reachability information between Autonomous Systems in the global Internet. BGP is a path-vector protocol that allows each Autonomous System to override distance-based metrics with policy-based metrics when choosing best routes. Varadhan et al. [18] have shown that it is possible for a group of Autonomous Systems to independently define BGP policies that together lead to BGP protocol oscillations that never converge on a stable routing. One approach to addressing this problem is based on static analysis of routing policies to determine if they are safe. We explore the worst-case complexity for convergence-oriented static analysis of BGP routing policies. We present an abstract model of BGP and use it to define several global sanity conditions on routing policies that are related to BGP convergence/divergence. For each condition we show that the complexity of statically checking it is either NP-complete or NP-hard.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Alaettinoglu, T. Bates, E. Gerich, D. Karrenberg, D. Meyer, M. Terpstra, and C. Villamizar. Routing Policy Specification Language (RPSL). RFC 2280, 1998.
 
2
C. Alaettino{glu. RAToolSet - A Routing Policy Analysis Tool Set. http://www, isi. edu/ra/RAToolSet.
 
3
 
4
 
5
R. Govindan, C. Alaettinoglu, G. Eddy, D. Kessens, S. Kumar, and W.S. Lee. An architecture for stable, analyzable internet routing. IEEE Network, 13(1):29-35, 1999.
 
6
 
7
 
8
C. Hendrick. Routing information protocol. RFC 1058, 1988.
 
9
 
10
IRR. Internet Route Registy. Internet Route Registy Project, http://www .merit. edu/radb/docs/irr, html.
 
11
D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 6(2):291-305, 1985.
12
 
13
C. Labovitz, G. R. Malan, and F. Jahanian. Origins of internet routing instability. In INFOCOM'99, 1997.
 
14
 
15
 
16
Y. Rekhter and T. Li. A Border Gateway Protocol. RFC 1771 (BGP version 4), 1995.
 
17
 
18
K. Varadhan, R. Govindan, and D. Estrin. Persistent route oscillations in inter-domain routing. ISI technical report 96-631, USC/Information Sciences Institute, 1996.
 
19
C. Villamizar, R. Chandra, and R. Govindan. BGP route flap damping. RFC 2439, 1998.

CITED BY  60

Collaborative Colleagues:
Timothy G. Griffin: colleagues
Gordon Wilfong: colleagues