IEEE Communications Surveys & Tutorials · 2011 · 83 citations · 48 references
ComputingComputer EngineeringComputer ScienceComputer NetworksInterconnection NetworksMobile ComputingMobile Ad Hoc NetworksNetwork ArchitectureNetwork ProtocolsRoutingRouting AlgorithmsRouting ProtocolsAd Hoc NetworkingAd Hoc NetworksConvergenceInterior Gateway ProtocolsLink-state RoutingMobile Ad Hoc RoutingRouting In Mobile NetworksService Availability
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.
48
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Adhi Harmoko S, M.Komp, Joseph Marie Jacquard et al. · 2005 · 18.4K citations
Optimized Link State Routing Protocol
Philippe Jacquet, Paul Mühlethaler, Amir Qayyum et al. · 2000 · 1.9K citations
Internet traffic engineering by optimizing OSPF weights
Bernard Fortz, Mikkel Thorup · 2002 · 1.1K citations