A more efficient diffusing update algorithm for loop-free routing

Authors:
Chuanqiang Zhao;Yuanan Liu;Kaiming Liu
Affiliations:
School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 6
Cited 4

Data networks

Data networks
A unified approach to loop-free routing using distance vectors or link states

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
EIGRP Network Design Solutions

EIGRP Network Design Solutions
Routing TCP/IP, Volume 1 (2nd Edition)

Routing TCP/IP, Volume 1 (2nd Edition)
Simulation-based routing protocol performance analysis: a case study

Proceedings of the 38th conference on Winter simulation

A speed-up technique for distributed shortest paths computation

ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
Engineering a new loop-free shortest paths routing algorithm

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Enhancing the computation of distributed shortest paths on real dynamic networks

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
A loop-free shortest-path routing algorithm for dynamic networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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-touble 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.