OSPF Convergence Times
Yonas Tsegaye, Tewodros Geberehana · 2013
Following the merger of telecom and IP networks, there has been a sharp rise in the number and types of multimedia applications such as interactive real-time Voice/Video over IP. This has put a new service requirement on IP networks and thus has required the IP network solution providers and telecom operators to device new techniques and optimizations to meet the needs of these business critical applications. One way to address these demands is to implement fast and efficient routing mechanism as the data packets are exchanged end to end. Open Shortest Path First (OSPF) is one of the widely deployed routing protocols responsible for this. Most of the important operations of OSPF that contribute to fast convergence such as fast failure detection, shortest path computation and flooding are controlled by timers. These timers, as specified in RFC2328 are fixed and too conservative for modern networks. Today, there has been an increasing effort to make these timers dynamic so that the values are determined based on the experienced network load and stability instead of a preset static value. This thesis is in part a thorough assessment of the state of the art on OSPF timers and fast convergence techniques. The other major contribution of this work is the implementation of the Link