Share Email Print

Proceedings Paper

A novel algorithm for OSPF link flap damping
Author(s): Yang Yang; Guangyi Liu; Xiaokang Lin
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Open shortest path first (OSPF) is the most widely used routing protocol in today’s IP networks, and its excellent performance has been proved in wired environments. However, when it is executed under bad channel conditions such as in wireless networks or areas with severe signal interference, links may flap frequently and some terrible problems will appear. This paper proposes a novel algorithm called OSPF link flap damping algorithm (OLFDA). The objective of OLFDA is to reduce the events of link state advertisement (LSA) update and damp the link flap with the precondition that the overall network performance is satisfying. To accomplish this, we can define criteria to identify and dynamically suppress the poorly behaved links. Information of the suppressed links won’t be advertised in OSPF domain and used in calculation of the routing tables. In addition, we can control the maximal number of links suppressed simultaneously by a router to ensure the network connectivity. OLFDA are simulated in many scenarios, and the results indicate that the algorithm has an excellent performance.

Paper Details

Date Published: 8 February 2005
PDF: 8 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.570706
Show Author Affiliations
Yang Yang, Tsinghua Univ. (China)
Guangyi Liu, Tsinghua Univ. (China)
Xiaokang Lin, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 5626:
Network Architectures, Management, and Applications II
S. J. Ben Yoo; Gee-Kung Chang; Guangcheng Li; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top