DocumentCode
2111362
Title
A More Efficient Diffusing Update Algorithm For Loop-Free Routing
Author
Zhao, Chuanqiang ; Liu, Yuanan ; Liu, Kaiming
Author_Institution
Sch. of Electron. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear
2009
fDate
24-26 Sept. 2009
Firstpage
1
Lastpage
4
Abstract
Enchanced interior gate routing protocol (EIGRP ) is a kind of distance vector routing protocol developed by Cisco, and it is mainly based on diffusing update algorithm(DUAL) which computes the best path distributedly without resulting in routing-trouble loops and counting-to-infinite problem. DUAL converges as fast as OSPF but leads to less overhead. In this paper, a more efficient diffusing update algorithm is presented and proved to create no loops. In this algorithm, the count of diffusing computation is reduced through two revised feasible conditions. The result of experiment shows that our algorithm could converge faster than the original DUAL.
Keywords
routing protocols; DUAL convergence; EIGRP; OSPF; counting-to-infinite problem; diffusing update algorithm; distance vector routing protocol; enchanced interior gate routing protocol; loop-free routing; open shortest path first; routing-trouble loop; Computational modeling; Computer networks; Convergence; Distributed computing; Large-scale systems; Maintenance engineering; Network topology; Robustness; Routing protocols; Telecommunication network topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-3692-7
Electronic_ISBN
978-1-4244-3693-4
Type
conf
DOI
10.1109/WICOM.2009.5302468
Filename
5302468
Link To Document