Scheduling routing table calculations to achieve fast convergence in OSPF protocol

Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this paper, we examine the problem of scheduling routing table updates in link state routing protocols. Modern commercial routers typically use a hold time based scheme to limit the number of routing table updates performed as new LSAs generated due to a topology change arrive at the router. The hold time based schemes, while limiting the number of routing table updates, also cause a significant delay in convergence to the topology change, which is clearly not acceptable any more. We analyze the performance of hold time based schemes and suggested that recently proposed exponential backoff based hold time scheme may not necessarily be a better choice than the fixed hold time scheme. In this paper, we propose an alternate approach, called LSA Correlation, to schedule the routing table updates following a topolog...

• Type: Conference
• Year: 2007
• Where: BROADNETS
• Authors: Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hosseini, K. Vairavan
• Keywords: BROADNETS 2007, Computer Networks, Hold Time, Routing Table, Topology Change