ACM Home Page
Please provide us with feedback. Feedback
Reliable interdomain routing through multiple complementary routing processes
Full text PdfPdf (114 KB)
Source International Conference On Emerging Networking Experiments And Technologies archive
Proceedings of the 2008 ACM CoNEXT Conference table of contents
Madrid, Spain
Article No. 68  
Year of Publication: 2008
ISBN:978-1-60558-210-8
Authors
Yong Liao  University of Massachusetts, Amherst, MA
Lixin Gao  University of Massachusetts, Amherst, MA
Roch Guerin  University of Pennsylvania, Philadelphia, PA
Zhi-Li Zhang  University of Massachusetts, Amherst, MA and University of Minnesota, Minneapolis, MN
Sponsors
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

abstract   references   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/1544012.1544080
What is a DOI?

ABSTRACT

The Internet inter-domain routing protocol, BGP, experiences frequent routing disruptions such as transient routing loops or loss of connectivity. The goal of this paper is to address this issue while preserving BGP's benefits in terms of operational maturity and flexibility in accommodating diverse policies. In realizing this goal, we apply to inter-domain routing a common concept in the design of highly reliable systems, namely, the use of redundancy, which we introduce in a manner that maximizes compatibility with the existing BGP protocol. The basic idea is to run several, mostly unchanged BGP processes that compute complementary routes, so that in the presence of network instabilities a working path remains available to any destination. The paper outlines the design of this approach and compares it to previously proposed alternatives. The benefits of the scheme are demonstrated using actual BGP data and realistic simulations.


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
A. B. Barr and et al. Improved BGP convergence via ghost flushing. In INFOCOM, 2003.
 
2
 
3
J. Chandrashekar and et al. Limiting path exploration in BGP. In INFOCOM, 2005.
 
4
T. Erlebach and et al. Cuts and disjoint paths in the valley-free path model. In CAAN, 2004.
 
5
6
7
8
9
10
 
11
N. Kushman and et al. R-BGP: Staying connected in a connected world. In NSDI, 2007.
 
12
A. Kvalbein and et al. Fast IP network recovery using multiple routing configurations. In INFOCOM, 2006.
13
 
14
Y. Liao and et al. Multi-process inter-domain routing. Technical Report TR-08-CSE-09, ECE Department, UMass Amherst, 2008. http://rio.ecs.umass.edu/~yliao/mpr-tech.pdf.
 
15
J. Luo and et al. An approach to accelerate convergence for path vector protocol. In Proceedings of Globecom, 2002.
16
 
17
 
18

Collaborative Colleagues:
Yong Liao: colleagues
Lixin Gao: colleagues
Roch Guerin: colleagues
Zhi-Li Zhang: colleagues