Research Article
Scheduling Routing Table Calculations to Achieve Fast Convergence in OSPF Protocol
@INPROCEEDINGS{10.1109/BROADNETS.2007.4550524, author={M. Goyal and W. Xie and M. Soperi and S.H. Hosseini and K. Vairavan}, title={Scheduling Routing Table Calculations to Achieve Fast Convergence in OSPF Protocol}, proceedings={4th International IEEE Conference on Broadband Communications, Networks, Systems}, publisher={IEEE}, proceedings_a={BROADNETS}, year={2010}, month={5}, keywords={Link State Routing Protocols OSPF Fast Convergence.}, doi={10.1109/BROADNETS.2007.4550524} }- M. Goyal
W. Xie
M. Soperi
S.H. Hosseini
K. Vairavan
Year: 2010
Scheduling Routing Table Calculations to Achieve Fast Convergence in OSPF Protocol
BROADNETS
IEEE
DOI: 10.1109/BROADNETS.2007.4550524
Abstract
Fast convergence to topology changes is now a key requirement in routing infrastructures while reducing the routing protocol’s processing 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. Commercial routers typically use a hold time based scheme to limit the number of routing table updates as new LSAs arrive at the router. The hold time schemes limit the number of routing table updates at the expense of increased delay in convergence to the new topology, which is clearly not acceptable any more. We analyze the performance of different hold time schemes and propose a new approach to schedule routing table updates, called LSA Correlation. Rather than using individual LSAs as triggers for routing table updates, LSA Correlation scheme correlates the information in the LSAs to identify the topology change that led to their generation. A routing table update is performed when a topology change has been identified. The analysis and simulation results presented in this paper suggest that the LSA Correlation scheme performs much better than the hold time based schemes for both isolated and large scale topology change scenarios.
