Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for NP-hard problems
Detection and analysis of routing loops in packet traces
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Dynamics of hot-potato routing in IP networks
Proceedings of the joint international conference on Measurement and modeling of computer systems
The case for separating routing from routers
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
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)
Tesseract: a 4D network control plane
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Loop-free updates of forwarding tables
IEEE Transactions on Network and Service Management
On the feasibility and efficacy of protection routing in IP networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the feasibility and efficacy of protection routing in IP networks
IEEE/ACM Transactions on Networking (TON)
Minimum Protection Cost Tree: A tunnel-based IP Fast Reroute Scheme
Computer Communications
| Hi-index | 0.00 |
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interruptions in modern networks. This has led to a renewed interest in centralized routing systems that, compared to distributed routing, can provide greater control over routing decisions and better visibility of the results. One benefit of centralized control is the opportunity to readily eliminate transient routing loops, which arise frequently after network changes because of inconsistent routing states across devices. Translating this conceptual simplicity into a solution with tolerable message complexity is non-trivial. Addressing this issue is the focus of this paper. We identify when and why avoiding transient loops might require a significant number of messages in a centralized routing system, and demonstrate that this is the case under many common failure scenarios. We also establish that minimizing the number of required messages is NP-hard, and propose a greedy heuristic that we show to perform well under many conditions. The paper's results can facilitate the deployment and evaluation of centralized architectures by leveraging their strengths without incurring unacceptable overhead.