Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Methodology for the efficiency of routing summary algorithms in discontiguous networks

Discontiguous Network에서 라우팅 축약 알고리즘의 효율화에 대한 방법론

  • Hwang, Seong-kyu (Department of Information & Commnincation Engg., Chosun College University of Science & Technology)
  • Received : 2019.11.27
  • Accepted : 2019.12.07
  • Published : 2019.12.31
Download PDF
⟨ Previous Next ⟩

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.

본 논문에서는 불연속 네트워크(discontiguous network)의 라우팅 축약기능(summary) 알고리즘에 대한 방식의 효율화에 대해 고찰을 한다. 서로 다른 전체의 서브넷 정보를 업데이트하여 전송하는 것보다 네트워크 정보를 축약하여 축약된 업데이트 정보만 전송하면 라우팅 테이블의 축약으로 라우터의 자원의 효율화가 이루어 지며 네트워크 안정과 성능을 향상시킬 수 있다. 그러나 네트워크 설계과정에서 불연속적인 네트워크가 구성될 경우 네트워크 축약 기능으로 문제가 발생되며 근본적인 라우터의 효율화의 결과를 가져오지 못한다. 본 논문에서 제안하는 알고리즘은 자동 축약 알고리즘의 단점을 보완한 알고리즘으로, 이로 인해 라우팅 테이블의 안정성을 높이고 그 결과 네트워크 장비의 CPU Utilization을 기존 16.5%에서 6.5%까지 낮추어 효율화가 구현됨을 확인하였다.

Keywords

References

  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. 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. https://doi.org/10.1109/JCN.2007.6182886
  4. E.P.F. Chan, and Y.Yang, "Shortest Path Tree Computation in Dynamic Graphs," IEEE Trans. on computers, vol.58, no.4, Apr. 2015.
  5. 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.
  6. E. Dijkstra, "A noet two problems in connection with graphs," Numerical Math, vol.1, pp.269-271, 1959. https://doi.org/10.1007/BF01386390
  7. J. Moy, "OSPF Version 2," Request for Comments 2328, Apr. 1998
  8. R. Bellman, "On a routing problem," Quarterly Appl. Math, vol.16, pp.87-90,1958. https://doi.org/10.1090/qam/102435
  9. S. H. Lee, and S.H. Rhee, "Efficient Flooding for Reliability in Link-state Routing Protocols," ICTC 2015.
  10. 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.