Loop-Free Forwarding Table Updates with Minimal Link Overflow
Authors:
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 1-6
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Avoiding Transient Loops During the Convergence of Link-State Routing ProtocolsIEEE/ACM Transactions on Networking, 2007
- Disruption Free Topology Reconfiguration in OSPF Networks2007
- A clean slate 4D approach to network control and managementACM SIGCOMM Computer Communication Review, 2005
- Avoiding transient loops during IGP convergence in IP networks2005
- Measuring ISP Topologies With RocketfuelIEEE/ACM Transactions on Networking, 2004
- Analysis of link failures in an IP backbone2002
- Inferring link weights using end-to-end measurements2002
- Loop-free routing using diffusing computationsIEEE/ACM Transactions on Networking, 1993
- A unified approach to loop-free routing using distance vectors or link statesACM SIGCOMM Computer Communication Review, 1989