Loop-Free Updates of Forwarding Tables
2008 (English)In: IEEE Transactions on Network and Service Management, ISSN 1932-4537, Vol. 5, no 1, 22-35 p.Article in journal (Refereed) Published
When the forwarding paths in an IP network change due to a link failure or a link weight modification, the forwarding tables in the routers may need to be updated. Each of these updates may cause transient loops if they are not performed in an appropriate order. In this paper, we propose an order to update the forwarding tables that avoids transient loops for non-urgent changes. The order is obtained by studying the changes in the forwarding tables, therefore it can be used in networks running any routing protocols, and for any type of forwarding path changes. After presenting the order, we prove that it is correct, and present an efficient algorithm to compute the order. Thereafter, we present several algorithms for performing forwarding table updates in accordance with the order. We also discuss how the update algorithms can be applied to both networks with centralized control and decentralized routing protocols. Finally, we study the update algorithms’ performance on several network topologies and with varying parameter settings and for several types of forwarding path changes.
Place, publisher, year, edition, pages
2008. Vol. 5, no 1, 22-35 p.
Configuration management; FIB updates; Network management; Transient routing loops
IdentifiersURN: urn:nbn:se:kth:diva-9328DOI: 10.1109/TNSM.2008.080103ScopusID: 2-s2.0-49049121685OAI: oai:DiVA.org:kth-9328DiVA: diva2:113509
QC 201007262008-10-302008-10-202013-09-09Bibliographically approved