Loop-free forwarding table updates with minimal link overflow
2009 (English)In: ICIEA: 2009 4th IEEE Conference on Industrial Electronics And Applications, 2009, 3960-3963 p.Conference paper (Refereed)
The forwarding paths in an IP network may change due to a link failure, network equipment maintenance, or reconfiguration of link weights. The forwarding tables in the routers need then to be updated. These updates may cause transient loops and link overflow, if they are not performed in an appropriate order. While existing proposals achieve loop-free updates, transient link overflow is still a problem during the updating process. In this paper, we present a method that compares the initial and final forwarding paths, and obtains the updatable nodes that do not cause any transient loop or link overflow. However, this goal is not always achievable, therefore, we propose an algorithm to update the forwarding tables that will refrain the link overflows to a minimal level. The performance study on a real topology with two setups confirms that our approach achieves smaller link overflow than by using a previously proposed approach.
Place, publisher, year, edition, pages
2009. 3960-3963 p.
, IEEE International Conference on Communications, ISSN 0536-1486
Forwarding table update, Forwarding tables, IP networks, Link failures, Link weights, Network equipment, Performance study
IdentifiersURN: urn:nbn:se:kth:diva-153533DOI: 10.1109/ICC.2009.5199146ScopusID: 2-s2.0-70449478350ISBN: 978-142443435-0OAI: oai:DiVA.org:kth-153533DiVA: diva2:753498
2009 IEEE International Conference on Communications, ICC 2009, 14 June 2009 through 18 June 2009, Dresden, Germany
QC 201410082014-10-082014-10-062015-10-06Bibliographically approved