Browse > Article
http://dx.doi.org/10.6109/jkiice.2019.23.12.1720

Methodology for the efficiency of routing summary algorithms in discontiguous networks  

Hwang, Seong-kyu (Department of Information & Commnincation Engg., Chosun College University of Science & Technology)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.23, no.12, 2019 , pp. 1720-1725 More about this Journal
Abstract
In this paper, we consider the efficiency of the scheme for for routing summary algorithms in discontiguous networks. Router than updating and transmitting the entire subnet information in the routing protocol, only the shortened update information is sent and the routing table is shortened to make the router resources more efficient and improve network stability and performance. However, if a discontiguous network is formed in the network design process, a problem arises due to the network contraction function and does not bring about the result of fundamental router efficiency. Using different major networks subnets one major network, causing problems in communication and routing information exchange if the configuration is incorrect. The algorithm proposed in this paper removes only the auto-summary algorithm from the existing algorithm, which increases the complexity and stability of the routing table and reduces the CPU utilization of network equipment from 16.5% to 6.5% Confirmed.
Keywords
dynamic routing protocol; routing summary algorithm; discontiguous network; auto-summary algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W.Stalling, "High-Speed Networks: TCP/IP and ATM Design Principles,"Prentice Hall, Inc., 1998.
2 G. Malkin, "RIP Version 2," Request for Comments 2453, Now. 1998.
3 T.W Kwon,"Improvement of IS-IS Protocol for TICN Tactical Backbone," Korea Institute OF Communication Sciences, The Kor. Iin. Comm. Sci., vol.36 no.8, pp.996-1002, Aug. 2016.
4 E. Dijkstra, "A noet two problems in connection with graphs," Numerical Math, vol.1, pp.269-271, 1959.   DOI
5 J. Moy, "OSPF Version 2," Request for Comments 2328, Apr. 1998
6 B. Xiao, J. Cao, Z. Shao, and E.H.m. sha, "An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing," Journal of Communication and Networks, vol.9, no.4, pp.499-510, Dec.2017.   DOI
7 V. Eramo, M. Listanti, and A. Cianfrani, "Design and Evaluation of a New Multi-Paht Incremental Routing Algorithm on Software Routers," IEEE Transactions on Network. and service management, vol. 5, no.4, Dec.2016.
8 E.P.F. Chan, and Y.Yang, "Shortest Path Tree Computation in Dynamic Graphs," IEEE Trans. on computers, vol.58, no.4, Apr. 2015.
9 R. Bellman, "On a routing problem," Quarterly Appl. Math, vol.16, pp.87-90,1958.   DOI
10 S. H. Lee, and S.H. Rhee, "Efficient Flooding for Reliability in Link-state Routing Protocols," ICTC 2015.