A unified approach to loop-free routing using distance vectors or link states
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Analysis of link failures in an IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
A clean slate 4D approach to network control and management
ACM SIGCOMM Computer Communication Review
Avoiding transient loops during the convergence of link-state routing protocols
IEEE/ACM Transactions on Networking (TON)
Loop-free updates of forwarding tables
IEEE Transactions on Network and Service Management
Seamless network-wide IGP migrations
Proceedings of the ACM SIGCOMM 2011 conference
Lossless migrations of link-state IGPs
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
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.