Earticle

초록

영어

Open Shortest Path First (OSPF) is a popular link state routing protocol widely used in Internet infrastructure. OSPF implements several timers to limit the protocol overhead. With these timers, it usually takes several tens of seconds for OSPF network to recover from a failure. The convergence time is delayed mainly by the timers of failure detection and routing calculation scheduling. In this paper we analyze OSPF convergence behavior in presence of multiple failures, where the interactions between failure detection and routing calculation scheduling could generate complicated dynamics during convergence process. We also present experimental study to understand the impact of multiple failures on convergence. The results demonstrate that multiple failures have a greater chance to delay the convergence. This suggests that operators should take it into account while configuring OSPF network.

목차

Abstract
 1. Introduction
 2. OSPF Convergence and Timers
 3. Impact of Multiple Failures on Convergence
  3.1. Asynchronous Detection of Multiple Failures
  3.2. Scheduling Routing Calculation
 4. Experimental Study
  4.1. Methodology
  4.2. Results
 5. Related work
 6. Conclusion
 Acknowledgements
 References

키워드

저자

• Dan Zhao [ School of computer, National University of Defense Technology ]
• Xiaofeng Hu [ School of computer, National University of Defense Technology ]
• Chunqing Wu [ School of computer, National University of Defense Technology ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605