A measurement study on the impact of routing events on end-to-end internet path performance
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Guaranteed fault containment and local stabilization in routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality-of-Service routing with path information aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Consensus routing: the internet as a distributed system
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
On understanding transient interdomain routing failures
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
A technique for reducing BGP update announcements through path exploration damping
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
BGP rerouting solutions for transient routing failures and loops
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
CTP: An efficient, robust, and reliable collection tree protocol for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
A novel paths algebra-based strategy to flexibly solve the link mapping stage of VNE problems
Journal of Network and Computer Applications
| Hi-index | 0.00 |
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 enhancementseffective in speeding up routing convergence are also effective in reducing routing loops.