Improving Convergence Speed and Scalability in OSPF: A Survey

Mukul Goyal (1) , Mohd Soperi (2) , Emmanuel Baccelli (3) , Gagan Choudhury (4) , Aman Shaikh (5) , Hossein Hosseini (1) , Kishor Trivedi (6)

1 University of Wisconsin - Milwaukee
2 Department of Modeling & Industrial Computing
3 HIPERCOM - High performance communication
4 Columbia University [New York]
5 AT&T Bell Laboratories
6 Duke University [Durham]

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.

Domaines: Réseaux et télécommunications [cs.NI]

Mukul Goyal, Mohd Soperi, Emmanuel Baccelli, Gagan Choudhury, Aman Shaikh, et al.. Improving Convergence Speed and Scalability in OSPF: A Survey. Communications Surveys and Tutorials, IEEE Communications Society, 2012, 14 (2), pp.443 - 463. ⟨10.1109/SURV.2011.011411.00065⟩. ⟨hal-00651596⟩