A unified approach to loop-free routing using distance vectors or link states
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Route flap damping exacerbates internet routing convergence
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
An Experimental Analysis of BGP Convergence Time
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
In search of path diversity in ISP networks
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Building an AS-topology model that captures route diversity
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Bringing order to BGP: decreasing time and message complexity
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Differentiated BGP Update Processing for Improved Routing Convergence
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Mitigating transient loops through interface-specific forwarding
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM SIGCOMM Computer Communication Review
Avoiding transient loops during the convergence of link-state routing protocols
IEEE/ACM Transactions on Networking (TON)
Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving internet-wide routing protocols convergence with MRPC timers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Improving internet-wide routing protocols convergence with MRPC timers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Hi-index | 0.00 |
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomain routing protocol. In order to decrease the amount of exchanged routing messages and transient routes, BGP routers rely on MRAI timers and route flap damping. These timers are intended to limit the exchange of transient routing messages. In practice, these timers have been shown to be partly ineffective at improving convergence, making it even slower in some situations. In this paper, we propose to add a timer mechanism to routing protocols, that enforces an ordering of the routing messages such that path exploration is drastically reduced while controlling convergence time. Our approach is based on known results in generalized path algorithms and endomorphism semi-rings. Our timers, called MRPC (metrics and routing policies compliant), are set independently by each router and depend only on the metrics of the routes received by the router as well as the routing policies of the router. No sharing of information about routing policies between neighboring ASs is required by our solution. Similarly to the case of routing policies that may lead to BGP convergence problems, arbitrary routing policies can also make it impossible to enforce an ordering of the messages that will prevent path exploration to occur. We explain under which conditions path exploration can be avoided with our timers, and provide simulations to understand how they compare to MRAI.