Graceful convergence in link-state IP Networks: a lightweight algorithm ensuring minimal operational impact
(2013) IEEE-ACM Transactions on Networking — Vol. 22, n° 1, p. 300-312 (2013)
Files
06512633.pdf
Open Access - Adobe PDF
- 2.49 MB
Details
- Authors
- Abstract
- The use of real-time multimedia or mission-critical applications over IP networks puts strong pressure on service providers to operate disruption-free networks. However, after any topological change, link-state Interior Gateway Protocols (IGPs), such as IS-IS or OSPF, enter a convergence phase during which transient forwarding loops may occur. Such loops increase the network latency and cause packet losses. In this paper, we propose and evaluate an efficient algorithm aimed at avoiding such traffic disruptions without modifying these IGPs. In case of an intentional modification of the weight of a link (e.g., to shut it down for maintenance operations or to perform traffic engineering), our algorithm iteratively changes this weight, splitting the modification into a sequence of loop-free transitions. The number of weight increments that need to be applied on the link to reach its target state is minimized in order to remain usable in existing networks. Analysis performed on inferred and real Internet service provider (ISP) topologies shows that few weight increments are required to handle most link shutdown events (less than two intermediate metrics for more than 85% of the links). The evaluation of our implementation also reveals that these minimal sequences can be computed in a reasonable time.
- Affiliations
Citations
Clad, F., Mérindol, P., Pansiot, J.-J., François, P., & Bonaventure, O. (2013). Graceful convergence in link-state IP Networks: a lightweight algorithm ensuring minimal operational impact. IEEE-ACM Transactions on Networking, 22(1), 300-312. https://doi.org/10.1109/TNET.2013.2255891 (Original work published 2013)