ACM Home Page
Please provide us with feedback. Feedback
Neighbor-specific BGP: more flexible routing policies while improving global stability
Full text PdfPdf (820 KB)
Source
Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems table of contents
Seattle, WA, USA
SESSION: Traffic engineering table of contents
Pages 217-228  
Year of Publication: 2009
ISBN:978-1-60558-511-6
Authors
Yi Wang  Princeton University, Princeton, NJ, USA
Michael Schapira  Yale University and UC Berkeley, New Haven, CT and Berkeley, CA, USA
Jennifer Rexford  Princeton University, Princeton, NJ, USA
Sponsors
ACM: Association for Computing Machinery
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 87,   Citation Count: 1
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/1555349.1555375
What is a DOI?

ABSTRACT

The Border Gateway Protocol (BGP) offers network administrators considerable flexibility in controlling how traffic flows through their networks. However, the interaction between routing policies in different Autonomous Systems (ASes) can lead to protocol oscillation. The best-known sufficient conditions of BGP global routing stability impose restrictions on the kinds of local routing policies individual ASes can safely implement. In this paper, we present neighbor-specific BGP (NS-BGP), a modest extension to BGP that enables a much wider range of local policies without compromising global stability. Whereas a conventional BGP-speaking router selects a single "best" route (for each destination prefix), NS-BGP allows a router to customize the route selection on behalf of each neighbor. For example, one neighbor may prefer the shortest route, another the most secure route, and yet another the least expensive route. Surprisingly, we prove that the much more flexible NS-BGP is guaranteed to be stable under much less restrictive conditions on how routers "rank" the candidate routes. We also show that it is safe to deploy NS-BGP incrementally, as a routing system with a partial deployment of NS-BGP is guaranteed to be stable, even in the presence of failure and other topology changes. In addition to our theoretical results, we also describe how NS-BGP can be deployed by individual ASes independently without changes to the BGP message format or collaboration from neighboring ASes.


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
 
2
3
 
4
 
5
N. Duffield, K. Gopalan, M. R. Hines, A. Shaikh, and J. E. van der Merwe. Measurement informed route selection. In Proc. Passive and Active Measurement Conference (Extended Abstract), 2007.
6
 
7
 
8
L. Gao, T. G. Griffin, and J. Rexford. Inherently safe backup routing with BGP. In Proc. IEEE INFOCOM, pages 547--556, April 2001.
 
9
10
 
11
T. Griffin and G. Huston. BGP wedgies. RFC 4264, November 2005.
12
 
13
14
 
15
16
 
17
IETF. Advertisement of Multiple Paths in BGP, July 2008. http://tools.ietf.org/html/draft-walton-bgp-add-paths-06. Internet Draft. Expires January 2009.
 
18
19
 
20
R. Mahajan, D. Wetherall, and T. Anderson. Mutually controlled routing with independent ISPs. In Proc. Networked Systems Design and Implementation, 2007.
21
 
22
Number of BGP routes a large ISP sees in total. Discussion on NANOG mailing list, http://www.merit.edu/mail.archives/nanog/2007-04/msg00502.html.
 
23
M. J. Osborne and A. Rubinstein. A Course in Game Theory. MIT press, 1994.
 
24
 
25
R. Sami, M. Schapira, and A. Zohar. Security and selfishness in interdomain routing. Technical report, Leibniz Center for Research in Computer Science, 2008.
26
 
27
S. Uhlig and S. Tandel. Quantifying the impact of route-reflection on BGP routes diversity inside a tier-1 network. In Proc. IFIP NETWORKING, 2006.
28
 
29
 
30
Y. Wang, I. Avramopoulos, and J. Rexford. Design for configurability: Rethinking interdomain routing policies from the ground up. IEEE Journal on Selected Areas in Communications, April 2009.
 
31
Y. R. Yang, H. Xie, H. Wang, A. Silberschatz, Y. Liu, L. E. Li, and A. Krishnamurthy. On route selection for interdomain traffic engineering. IEEE Network Magazine, November 2005.


Collaborative Colleagues:
Yi Wang: colleagues
Michael Schapira: colleagues
Jennifer Rexford: colleagues