Research on LAP Routing Algorithm based on Traversal Tree

被引：0
|
作者：
Shi, Lan [1 ]
Xie, Zihao [1 ]
Lv, Jianhui [1 ]
机构：
[1] Northeastern Univ, Coll Comp Sci & Engn, Shenyang 110819, Liaoning, Peoples R China
来源：
PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC) | 2016年
关键词：
OSPF protocol; Flooding algorithm; LAP routing algorithm; traversal tree;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In the OSPF (Open Shortest Path First) protocol, using the traditional Flooding algorithm to convergence network topology will produce a large amount of redundant information and cause the waste of communication resources. LAP (Limitation Arrangement Principle) routing algorithm is introduced in this paper, which can be able to effectively solve the above problems. An LAP routing algorithm based on the traversal tree is proposed. The results show, when the number of links increases, the number of communications will reduce sharply during the network topology convergence completed by the BFS (Breadth First Search) traversal LAP routing algorithm. Compared with Flooding algorithm, LAP routing algorithm based on the BFS traversal tree has less number of communications when the number of links between the nodes exceeds a threshold value. LAP routing algorithm improves the overall efficiency of the network topology convergence.
引用
收藏
页码：2137 / 2142
页数：6
相关论文
共 50 条
  • [21] Dynamic channel routing algorithm based on minimum spanning tree
    Wei, Jian-Jun
    Kang, Ji-Chang
    Lei, Yan-Jing
    Chen, Fu-Long
    Zhongbei Daxue Xuebao (Ziran Kexue Ban)/Journal of North University of China (Natural Science Edition), 2008, 29 (02): : 120 - 124
  • [22] Research of Timing Graph Traversal Algorithm in Static Timing Analysis based on FPGA
    Lu, Jingjing
    Xu, Ning
    Yu, Jian
    Weng, Tongfeng
    2017 IEEE 3RD INFORMATION TECHNOLOGY AND MECHATRONICS ENGINEERING CONFERENCE (ITOEC), 2017, : 334 - 338
  • [23] CYCLIC TREE TRAVERSAL
    NILSSON, M
    TANAKA, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 225 : 593 - 599
  • [24] Computational Load Balancing Algorithm for Parallel Knapsack Packing Tree Traversal
    Kupriyashin, Mikhail A.
    Borzunov, Georgii I.
    7TH ANNUAL INTERNATIONAL CONFERENCE ON BIOLOGICALLY INSPIRED COGNITIVE ARCHITECTURES, (BICA 2016), 2016, 88 : 330 - 335
  • [25] A GENERALIZED NON-RECURSIVE BINARY-TREE TRAVERSAL ALGORITHM
    HATTER, DJ
    COMPUTER JOURNAL, 1984, 27 (02): : 178 - 184
  • [26] A new non-recursive algorithm for binary search tree traversal
    Al-Rawi, A
    Lansari, A
    Bouslama, F
    ICECS 2003: PROCEEDINGS OF THE 2003 10TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-3, 2003, : 770 - 773
  • [27] A new non-recursive algorithm for binary search tree traversal
    Ai-Rawi, A. (Akram.alrawi@zu.ac.ae), Emirates Telecommunications Corporation (ETISALAT); et al.; Etisalat College of Engineering (ECE); IEEE Circuits and Systems Society (CAS); The Institute of Electrical and Electronics Engineers (IEEE); University of Sharjah (UOS) (Institute of Electrical and Electronics Engineers Inc.):
  • [28] Research of Dynamic Routing Algorithm Based on Mobile Agent
    Lan, Li
    ADVANCED TECHNOLOGY IN TEACHING - PROCEEDINGS OF THE 2009 3RD INTERNATIONAL CONFERENCE ON TEACHING AND COMPUTATIONAL SCIENCE (WTCS 2009), VOL 2: EDUCATION, PSYCHOLOGY AND COMPUTER SCIENCE, 2012, 117 : 699 - 705
  • [29] Research on Vehicle Routing problem Based on Genetic Algorithm
    Bai, Ke
    PROCEEDINGS OF THE 2015 2ND INTERNATIONAL CONFERENCE ON ELECTRICAL, COMPUTER ENGINEERING AND ELECTRONICS (ICECEE 2015), 2015, 24 : 1415 - 1418
  • [30] Research of Dynamic Routing Algorithm Based on Traffic Engineering
    Wang, Xinhua
    Liu, Fangai
    Xu, Zongbo
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 4256 - 4259
12345