A more efficient distance vector routing algorithm

Author

Xu, Zhengyu ; Dai, Sa ; Garcia-Luna-Aceves, J.J.

Author_Institution

Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA

Volume

2

fYear

1997

fDate

2-5 Nov 1997

Firstpage

993

Abstract

A more efficient distance vector routing algorithm (EDVA) for computer networks is presented. EDVA is based on enhancements to two classes of distance vector algorithms: the path finding algorithms that report complete path information incrementally, and the diffusing update algorithm (DUAL) which is used in Cisco´s Enhanced Interior Gateway Routing Protocol (EIGRP) and is based on diffusing computations for internodal synchronization. EDVA operates by specifying a distance, a feasible distance, a predecessor and diffusing hops to each destination. This information is used together with diffusing computations of limited span to avoid routing-table loops. The correctness of EDVA is discussed, and its benefits compared with DUAL and path finding algorithms are illustrated with simple examples

Keywords

computer networks; synchronisation; telecommunication network routing; Cisco; DUAL; EIGRP; Enhanced Interior Gateway Routing Protocol; computer networks; diffusing hops; diffusing update algorithm; efficient distance vector routing algorithm; feasible distance; internodal synchronization; path finding algorithms; predecessor; Broadcasting; Computer networks; Costs; Distributed computing; H infinity control; Internet; Routing protocols; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

MILCOM 97 Proceedings

Conference_Location

Monterey, CA

Print_ISBN

0-7803-4249-6

Type

conf

DOI

10.1109/MILCOM.1997.646766

Filename

646766