Technology of Network & Communication
|
1794-1800

Efficient routing protection method with linear time complexity

Geng Haijun1a,1b,1c
Zhang Qidong1a,1c
Yin Xia2
1. a. School of Computer & Information Technology, b. School of Automation & Software Engineering, c. Institute of Big Data Science & Industry, Shanxi University, Taiyuan 030006, China
2. Dept. of Computer Science & Technology, Tsinghua University, Beijing 100048, China

Abstract

How to deal with network faults efficiently and quickly is the basic requirement and main task of designing routing protocol. When dynamic routing protocols deal with network faults, a large number of packets are discarded during dynamic convergence. Therefore, at present, router manufacturers generally use routing protection methods to overcome network failures. Among many route protection methods, the DC(downstream criterion) rules is a generally recognized method. However, the time complexity of the existing DC rules algorithms is generally high, and the complexity increases rapidly with the increase of the average degree of network nodes. In order to deal with the above problems, this paper proposed a linear time complexity university routing protection scheme ERPLR(efficient routing protection method with linear time complexity). The method firstly proposed the backup next hop calculation rule, and then calculated the backup next hop for all source-destination node pairs based on the existing shortest path tree according to the backup next hop calculation rule. In the process of calculating the backup next hop, accessing each node and its neighbors at most once, so the time complexity of ERPLR is O(V+E). The experimental results show that, compared with the existing rules for implementing DC rules, ERPLR has similar results in four metrics: failure protection ratio and path stretch. Compared with DC rules, ERPLR reduces the computational overhead by about 74.93% and 78.91% in real topology and generated topology, respectively, this method can greatly reduce the calculation cost of DC rules.

Foundation Support

山西省应用基础研究计划资助项目(20210302123444)
中国高校产学研创新基金资助项目(2021FNA02009)
山西省重点研发计划资助项目(201903D421003)
国家自然科学基金资助项目(61702315)
国家高技术研究发展计划(863)资助项目(2018YFB1800400)
山西省高等学校科技创新资助项目(2022L002)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2022.11.0521
Publish at: Application Research of Computers Printed Article, Vol. 40, 2023 No. 6
Section: Technology of Network & Communication
Pages: 1794-1800
Serial Number: 1001-3695(2023)06-031-1794-07

Publish History

[2023-01-06] Accepted Paper
[2023-06-05] Printed Article

Cite This Article

耿海军, 张琪栋, 尹霞. 一种线性时间复杂度的高效路由保护方法 [J]. 计算机应用研究, 2023, 40 (6): 1794-1800. (Geng Haijun, Zhang Qidong, Yin Xia. Efficient routing protection method with linear time complexity [J]. Application Research of Computers, 2023, 40 (6): 1794-1800. )

About the Journal

  • Application Research of Computers Monthly Journal
  • Journal ID ISSN 1001-3695
    CN  51-1196/TP

Application Research of Computers, founded in 1984, is an academic journal of computing technology sponsored by Sichuan Institute of Computer Sciences under the Science and Technology Department of Sichuan Province.

Aiming at the urgently needed cutting-edge technology in this discipline, Application Research of Computers reflects the mainstream technology, hot technology and the latest development trend of computer application research at home and abroad in a timely manner. The main contents of the journal include high-level academic papers in this discipline, the latest scientific research results and major application results. The contents of the columns involve new theories of computer discipline, basic computer theory, algorithm theory research, algorithm design and analysis, blockchain technology, system software and software engineering technology, pattern recognition and artificial intelligence, architecture, advanced computing, parallel processing, database technology, computer network and communication technology, information security technology, computer image graphics and its latest hot application technology.

Application Research of Computers has many high-level readers and authors, and its readers are mainly senior and middle-level researchers and engineers engaged in the field of computer science, as well as teachers and students majoring in computer science and related majors in colleges and universities. Over the years, the total citation frequency and Web download rate of Application Research of Computers have been ranked among the top of similar academic journals in this discipline, and the academic papers published are highly popular among the readers for their novelty, academics, foresight, orientation and practicality.


Indexed & Evaluation

  • The Second National Periodical Award 100 Key Journals
  • Double Effect Journal of China Journal Formation
  • the Core Journal of China (Peking University 2023 Edition)
  • the Core Journal for Science
  • Chinese Science Citation Database (CSCD) Source Journals
  • RCCSE Chinese Core Academic Journals
  • Journal of China Computer Federation
  • 2020-2022 The World Journal Clout Index (WJCI) Report of Scientific and Technological Periodicals
  • Full-text Source Journal of China Science and Technology Periodicals Database
  • Source Journal of China Academic Journals Comprehensive Evaluation Database
  • Source Journals of China Academic Journals (CD-ROM Version), China Journal Network
  • 2017-2019 China Outstanding Academic Journals with International Influence (Natural Science and Engineering Technology)
  • Source Journal of Top Academic Papers (F5000) Program of China's Excellent Science and Technology Journals
  • Source Journal of China Engineering Technology Electronic Information Network and Electronic Technology Literature Database
  • Source Journal of British Science Digest (INSPEC)
  • Japan Science and Technology Agency (JST) Source Journal
  • Russian Journal of Abstracts (AJ, VINITI) Source Journals
  • Full-text Journal of EBSCO, USA
  • Cambridge Scientific Abstracts (Natural Sciences) (CSA(NS)) core journals
  • Poland Copernicus Index (IC)
  • Ulrichsweb (USA)