SC Conference - Activity Details

Accelerating the Convergence Time of Open Shortest Path First (OSPF) Routing Protocol

Mohd Soperi Mohd Zahid  (University of Wisconsin-Milwaukee)
Doctoral Research Showcase Session
Thursday,  10:30AM - 10:45AM
Room 17A/17B
It is important for OSPF to have quick convergence time. In this thesis, we suggest ways to achieve this by optimizing adjacency establishment and routing table calculations steps. OSPF routers maintain identical view of the area they reside in link-state databases. During adjacency establishment, the database exchange process is performed to synchronize the link-state databases even when no discrepancy exists. We propose a scheme that omits the process in such case to achieve faster adjacency establishment time. OSPF routers typically schedule routing table calculations using hold time based schemes to limit routing calculation frequency. However, it may cause delays in the convergence time because it uses some configured parameter values. It is difficult to find values optimum for any topology change scenarios. We propose a scheme that identifies topology change from the receiving link-state advertisement packets. A routing table calculation is performed upon identification of a topology change not timer expiration.
   IEEE Computer Society  /  ACM     2 0   Y E A R S   -   U N L E A S H I N G   T H E   P O W E R   O F   H P C