Intra-domain routing convergence with centralized control

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.

[1]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[2]  Nian-Feng Tzeng,et al.  TCAM-Based Forwarding Engine with Minimum Independent Prefix Set (MIPS) for Fast Updating , 2006, 2006 IEEE International Conference on Communications.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Albert G. Greenberg,et al.  Experience in black-box OSPF measurement , 2001, IMW '01.

[5]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[6]  Oliver C. Ibe,et al.  A survey of IP and multiprotocol label switching fast reroute schemes , 2007, Comput. Networks.

[7]  Nick Feamster,et al.  Design and implementation of a routing control platform , 2005, NSDI.

[8]  Gunnar Karlsson,et al.  Traffic Engineering and Routing in IP Networks with Centralized Control , 2008, Networking.

[9]  Wu-chi Feng,et al.  Achieving faster failure detection in OSPF networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[10]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[11]  Nick Feamster,et al.  The case for separating routing from routers , 2004, FDNA '04.

[12]  Gábor Rétvári,et al.  Converging the Evolution of Router Architectures and IP Networks , 2007, IEEE Network.

[13]  Hong Yan,et al.  A clean slate 4D approach to network control and management , 2005, CCRV.

[14]  Jon G. Riecke,et al.  Stability issues in OSPF routing , 2001, SIGCOMM 2001.

[15]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[16]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

[17]  Andrew S. Tanenbaum,et al.  Distributed systems: Principles and Paradigms , 2001 .

[18]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[19]  Olivier Bonaventure,et al.  Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.

[20]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[21]  Ellen W. Zegura,et al.  Performance of hashing-based schemes for Internet load balancing , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[23]  M. Pitkanen,et al.  OSPF flooding process optimization , 2005, HPSR. 2005 Workshop on High Performance Switching and Routing, 2005..

[24]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[25]  Ram Dantu,et al.  Forwarding and Control Element Separation (ForCES) Framework , 2004, RFC.

[26]  Nick Feamster,et al.  In VINI veritas: realistic and controlled network experimentation , 2006, SIGCOMM 2006.

[27]  Hong Yan,et al.  Tesseract: A 4D Network Control Plane , 2007, NSDI.

[28]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 2001, TNET.

[29]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[30]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2003, STOC '03.

[31]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[32]  David A. Maltz,et al.  Network-Wide Decision Making: Toward A Wafer-Thin Control Plane , 2004 .