Scheduling routing table calculations to achieve fast convergence in OSPF protocol

@article{Goyal2007SchedulingRT,
  title={Scheduling routing table calculations to achieve fast convergence in OSPF protocol},
  author={Mukul Goyal and Weigao Xie and Mohd Soperi and Seyed Hossein Hosseini and K. Vairavan},
  journal={2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)},
  year={2007},
  pages={863-872}
}
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… CONTINUE READING
9 Citations
27 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Towards millis econd igp convergence

  • C. Alaettinoglu, V. Jacobson, H. Yu
  • NANOG 20, October 2000.
  • 2000
Highly Influential
4 Excerpts

Adjacency reduction in ospf using spt reachabi lity

  • A. Roy
  • INTERNET-DRAFT, draft-roy-ospf-smart-peering-0 1…
  • 2005

On th e robustness and stability of connected dominating sets

  • C. Adjih, E. Baccelli, T. Clausen, P. Jacquet
  • T ech. Rep. Research Report No. 5609, INRIA…
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…