Efficient Flooding Methods for Link-state Routing Protocols 


Vol. 37,  No. 9, pp. 760-766, Sep.  2012


PDF Full-Text
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kim, S. Lee, S. Rhee, "Efficient Flooding Methods for Link-state Routing Protocols," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 9, pp. 760-766, 2012. DOI: .

[ACM Style]

Jeong-Ho Kim, Seung-Hwan Lee, and Seung-Hyong Rhee. 2012. Efficient Flooding Methods for Link-state Routing Protocols. The Journal of Korean Institute of Communications and Information Sciences, 37, 9, (2012), 760-766. DOI: .

[KICS Style]

Jeong-Ho Kim, Seung-Hwan Lee, Seung-Hyong Rhee, "Efficient Flooding Methods for Link-state Routing Protocols," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 9, pp. 760-766, 9. 2012.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880