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
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Systems: Principles and Paradigms
Distributed Systems: Principles and Paradigms
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
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
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
In VINI veritas: realistic and controlled network experimentation
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A survey of IP and multiprotocol label switching fast reroute schemes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Tesseract: a 4D network control plane
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Proceedings of the ACM SIGCOMM 2010 conference
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
oBGP: an overlay for a scalable iBGP control plane
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Outsourcing the routing control logic: better internet routing based on SDN principles
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
| 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 review the architectural advantages and challenges of centralized control. Thereafter, we identify and discuss the components of the convergence time in both schemes. We present 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.