Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
Experience in black-box OSPF measurement
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
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
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The case for separating routing from routers
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
A clean slate 4D approach to network control and management
ACM SIGCOMM Computer Communication Review
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Converging the Evolution of Router Architectures and IP Networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
The decentralized control scheme for routing in current IP networks has been questioned, and a centralized routing scheme has been proposed as an alternative. In this paper, we compare the convergence of centralized control scheme with decentralized link-state routing protocols. We first identify the components of the convergence time. Thereafter, we study how to achieve fast routing convergence in networks with centralized control. In particular, we analyze how to distribute forwarding information efficiently. Finally, we perform simulation studies on the convergence time for both real and synthetic network topologies, and study the impact of control element location, link weights, and number of failures on the convergence time. The results show that the centralized control scheme can provide faster routing convergence than link-state routing protocols.