|
Published Articles >> Table of Contents >> Abstract
24th IEEE International Conference on Distributed Computing Systems (ICDCS'04)
pp. 720-729
A Study of BGP Path Vector Route Looping Behavior
Dan Pei, University of California at Los Angeles
Xiaoliang Zhao, University of Southern California
Dan Massey, University of Southern California
Lixia Zhang, University of California at Los Angeles
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2004.1281640
Send link to a friend
| Abstract |
|
Measurements have shown evidences of inter-domain packet forwarding loops in the Internet, but the exact cause of these loops remains unclear. As one of the efforts in identifying the causes, this paper examines how transient loops can be created at the inter-domain level via BGP, and what are the major factors that contribute to duration of the routing loops. As a path-vector routing protocol, BGP messages list the entire AS path to each destination and the path information enables each node to detect, thus break, arbitrarily long routing loops involving itself. However, delays due to physical constrains and protocol mechanisms slow down routing updates propagation and the routing information inconsistencies among the nodes lead to loop formation during convergence. We show that the duration of transient BGP loops match closely to BGP’s routing convergence time and the looping duration is linearly proportional to BGP’s Minimum Route Advertisement Interval Timer (MRAI) value. We also examine four BGP routing convergence enhancements and show that two enhancements effective in speeding up routing convergence are also effective in reducing routing loops.
|
 Additional Information
|
Citation:
Dan Pei, Xiaoliang Zhao, Dan Massey, Lixia Zhang,
"A Study of BGP Path Vector Route Looping Behavior,"
icdcs,
pp. 720-729,
24th IEEE International Conference on Distributed Computing Systems (ICDCS'04),
2004
|
|
