Improving Convergence Speed and Scalability in OSPF: A Survey

Open Shortest Path First (OSPF), a link state routing protocol, is a popular interior gateway protocol (IGP) in the Internet. Wide spread deployment and years of experience running the protocol have motivated continuous improvements in its operation as the nature and demands of the routing infrastructures have changed. Modern routing domains need to maintain a very high level of service availability. Hence, OSPF needs to achieve fast convergence to topology changes. Also, the ever-growing size of routing domains, and possible presence of wireless mobile adhoc network (MANET) components, requires highly scalable operation on part of OSPF to avoid routing instability. Recent years have seen significant efforts aimed at improving OSPF's convergence speed as well as scalability and extending OSPF to achieve seamless integration of mobile adhoc networks with conventional wired networks. In this paper, we present a comprehensive survey of these efforts.

[1]  Chen-Nee Chuah,et al.  Characterization of Failures in an Operational IP Backbone Network , 2008, IEEE/ACM Transactions on Networking.

[2]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[3]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

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

[5]  Lajos Hanzo,et al.  A survey of QoS routing solutions for mobile ad hoc networks , 2007, IEEE Communications Surveys & Tutorials.

[6]  Stewart Bryant,et al.  IP Fast Reroute Framework , 2010, RFC.

[7]  Philippe Jacquet,et al.  OSPF Multipoint Relay (MPR) Extension for Ad Hoc Networks , 2009, RFC.

[8]  A. Shaikh,et al.  Avoiding instability during graceful shutdown of multiple OSPF routers , 2006, IEEE/ACM Transactions on Networking.

[9]  Philippe Jacquet,et al.  Multi-point Relaying Techniques with OSPF on Ad Hoc Networks , 2009, 2009 Fourth International Conference on Systems and Networks Communications.

[10]  Kireeti Kompella,et al.  Detecting Multi-Protocol Label Switched (MPLS) Data Plane Failures , 2006, RFC.

[11]  H. T. Mouftah,et al.  Optical Layer Monitoring Schemes for Fast Link Failure Localization in All-Optical Networks , 2011, IEEE Communications Surveys & Tutorials.

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

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

[14]  Thomas M. Thomas,et al.  OSPF Network Design Solutions , 2003 .

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  Ning Wang,et al.  An overview of routing optimization for internet traffic engineering , 2008, IEEE Communications Surveys & Tutorials.

[17]  Daniele Frigioni,et al.  Fully dynamic output bounded single source shortest path problem , 1996, SODA '96.

[18]  Tony Bates,et al.  Guidelines for creation, selection, and registration of an Autonomous System (AS) , 1996, RFC.

[19]  H. Jonathan Chao,et al.  IP fast rerouting for single-link/node failure recovery , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[20]  John Moy,et al.  Multicast Extensions to OSPF , 1994, RFC.

[21]  Pat Murphy.  The OSPF Not-So-Stubby Area (NSSA) Option , 2003, RFC.

[22]  Farnam Jahanian,et al.  Experimental study of Internet stability and backbone failures , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).

[23]  Paul Baran,et al.  On Distributed Communications , 1964 .

[24]  Alia Atlas,et al.  Basic Specification for IP Fast Reroute: Loop-Free Alternates , 2008, RFC.

[25]  Laurent Lefèvre,et al.  Fault tolerance for highly available internet services: concepts, approaches, and issues , 2008, IEEE Communications Surveys & Tutorials.

[26]  A.A. Ghazala,et al.  A Survey for Open Shortest Path First Weight Setting (OSPFWS) Problem , 2008, 2008 International Conference on Information Security and Assurance (isa 2008).

[27]  Minas Gjoka,et al.  Evaluation of IP Fast Reroute Proposals , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[28]  Olivier Bonaventure,et al.  Disruption Free Topology Reconfiguration in OSPF Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[29]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[30]  Stewart Bryant,et al.  A Framework for Loop-Free Convergence , 2010, RFC.

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

[32]  Aman Shaikh,et al.  Avoiding instability during graceful shutdown of OSPF , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[33]  Ritu Singh,et al.  Voice over the internet: A tutorial discussing problems and solutions associated with alternative transport , 2004, IEEE Communications Surveys & Tutorials.

[34]  Amit Kumar,et al.  Optimal configuration of OSPF aggregates , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[35]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[36]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[37]  Stewart Bryant,et al.  IP Fast Reroute using tunnels , 2007 .

[38]  Seyed Hossein Hosseini,et al.  Scheduling routing table calculations to achieve fast convergence in OSPF protocol , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[39]  Biswanath Mukherjee,et al.  Traffic engineering in next-generation optical Networks , 2004, IEEE Communications Surveys & Tutorials.

[40]  Ossama Younis,et al.  Constraint-based routing in the internet: Basic principles and recent research , 2003, IEEE Communications Surveys & Tutorials.

[41]  Evangelos Vayias,et al.  On the building blocks of quality of service in heterogeneous IP networks , 2005, IEEE Communications Surveys & Tutorials.

[42]  John M. McQuillan,et al.  The Birth of Link-State Routing , 2009, IEEE Ann. Hist. Comput..

[43]  Dave Katz,et al.  Bidirectional Forwarding Detection (BFD) , 2010, RFC.

[44]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[45]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[46]  John Moy,et al.  Graceful OSPF Restart , 2003, RFC.

[47]  Daniele Frigioni,et al.  Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.

[48]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[49]  Pierre Francois.  Loop-free convergence using oFIB , 2012 .

[50]  Michael Menth,et al.  Relaxed multiple routing configurations: IP fast reroute for single and correlated failures , 2009, IEEE Transactions on Network and Service Management.

[51]  Gagan L. Choudhury,et al.  Models for IP/MPLS routing performance: convergence, fast reroute, and QoS impact , 2004, SPIE Optics East.

[52]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[53]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[54]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[55]  Bianca Schroeder,et al.  IGP link weight assignment for transient link failures , 2003 .

[56]  Alfonso Fuggetta,et al.  Distributed Communication , 2000, EDO.

[57]  Takashi Kurimoto,et al.  Enhancing the network scalability of link-state routing protocols by reducing their flooding overhead , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[58]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[59]  Richard G. Ogier,et al.  Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding , 2009, RFC.

[60]  Abhay Roy,et al.  Multi-Topology (MT) Routing in OSPF , 2007, RFC.

[61]  Pierre A. Humblet,et al.  Topology Broadcast Algorithms , 1989, Comput. Networks.

[62]  Richard G. Ogier.  OSPF Database Exchange Summary List Optimization , 2008, RFC.

[63]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[64]  Kireeti Kompella,et al.  BFD For MPLS LSPs , 2003 .

[65]  Kireeti Kompella,et al.  OSPF Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS) , 2005, RFC.

[66]  Richard G. Ogier,et al.  A reliable, efficient topology broadcast protocol for dynamic networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[67]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[68]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[69]  Chen-Nee Chuah,et al.  Fast Local Rerouting for Handling Transient Link Failures , 2007, IEEE/ACM Transactions on Networking.

[70]  John Moy,et al.  OSPF for IPv6 , 1999, RFC.

[71]  Dino Farinacci,et al.  Generic Routing Encapsulation (GRE) , 2000, RFC.

[72]  Jennifer Yates,et al.  An efficient algorithm for OSPF subnet aggregation , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[73]  Seyed Hossein Hosseini,et al.  Improving OSPF Dynamics on a Broadcast LAN , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[74]  Abhay Roy,et al.  Extensions to OSPF to Support Mobile Ad Hoc Networking , 2010, RFC.

[75]  Christophe Diot,et al.  Impact of link failures on VoIP performance , 2002, NOSSDAV '02.

[76]  Gagan L. Choudhury.  Prioritized Treatment of Specific OSPF Version 2 Packets and Congestion Avoidance , 2005, RFC.

[77]  Deep Medhi,et al.  Outage Analysis of a University Campus Network , 2007, 2007 16th International Conference on Computer Communications and Networks.

[78]  William Allen Simpson,et al.  IP in IP Tunneling , 1995, RFC.

[79]  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).

[80]  Stewart Bryant,et al.  IP Fast Reroute Using Not-via Addresses , 2006 .

[81]  Dave Katz,et al.  Generic Application of Bidirectional Forwarding Detection (BFD) , 2010, RFC.

[82]  Thomas Clausen,et al.  IP Links in multihop ad hoc wireless networks? , 2009, SoftCOM 2009 - 17th International Conference on Software, Telecommunications & Computer Networks.

[83]  Roch Guérin,et al.  Making IGP Routing Robust to Link Failures , 2005, NETWORKING.

[84]  Padma Pillay-Esnault.  OSPF Refresh and Flooding Reduction in Stable Topologies , 2005, RFC.

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

[86]  John Moy.  Extending OSPF to Support Demand Circuits , 1995, RFC.

[87]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[88]  Alia Atlas,et al.  U-turn Alternates for IP/LDP Fast-Reroute , 2006 .