Browse > Article
http://dx.doi.org/10.7840/kics.2012.37B.9.760

Efficient Flooding Methods for Link-state Routing Protocols  

Kim, Jeong-Ho (광운대학교 전자융합공학과)
Lee, Seung-Hwan (광운대학교 전자융합공학과)
Rhee, Seung-Hyong (광운대학교 전자융합공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.37B, no.9, 2012 , pp. 760-766 More about this Journal
Abstract
In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.
Keywords
Link-state routing; OSPF; Minimum spanning tree; LSA;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 T. Miyamura, T. kurimoto and M. Aoki, "Enhancing the Network Scalability of Link-state Routing Protocols by Reducing their Flooding Overhead," High performance Switching and Routing 2003, HPSR. Workshop on, pp263-268, 2003
2 Seung Hwan Lee, Seung Hyong Rhee, "Efficient Flooding for Reliability in Link-state Routing Protocols", ICTC 2011
3 Tae-Wook Kwon, "Improvement of IS-IS Protocol for TICN Tactical Backbone", Korea Institute OF Communication Sciences, The Kor. Iin. Comm. Sci., Vol.36 No.8 page(s):996-1002, 2011.8   과학기술학회마을   DOI   ScienceOn
4 J. Moy, "OSPF: Anotony of an Internet routing protocol," Addson-Wesley, 1998
5 A. Zinin and M. Shand, "Flooding optimizations in link-state routing protocols," IETF, draft - ietf -ospf -isis-flood-opt-01.txt, March 2001
6 A.V. Aho and D. Lee, "Hierarchical networks and the LSA N-squared problem in OSPF routing", Pro. IEEE GlobecCom 2000, pp.397-404, 2000
7 NING Ai-bing, MA Liang, XIONG Xiao-hua, "Solving Degree-constrained Minimum Spanning Tree with a New Algorithm", 2007 International Conference on Management Science & Engineering (14th) Aug. 20-22, pp.381-386, 2007
8 R. Callon, "Use of OSI IS-IS for Routing in TCP/IP and Dual Environments", IETF, RFC 1195, December 1990