High-speed propagation of link status routing control information

Author

Comer, Douglas E. ; Yavatkar, Raj

Author_Institution

Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA

fYear

1990

fDate

9-13 Dec 1990

Firstpage

190

Lastpage

194

Abstract

A link status routing algorithm required each node to know the current status of all the links in the network. Nodes use a link status update protocol that helps in keeping the database at each node up-to-date. The authors describe a link status update protocol designed for a highspeed network. The protocol uses the best-effort model of packet delivery, but is fault-tolerant. It uses an algorithm for fast propagation of link status updates that is optimized for the expected case when no update packets are lost, and no link or node failures occur. The protocol uses a separate mechanism to detect and recover from errors caused by loss of updates and failure of nodes or links

Keywords

fault tolerant computing; packet switching; protocols; MultiSwitch Network; best-effort model; fast propagation; fault-tolerant; highspeed network; link status routing control information; link status update protocol; packet delivery; ARPANET; Algorithm design and analysis; Computer errors; Computer science; Databases; Error correction; Fault tolerance; Intelligent networks; Routing protocols; Tellurium;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Conference_Location

Dallas, TX

Print_ISBN

0-8186-2087-0

Type

conf

DOI

10.1109/SPDP.1990.143531

Filename

143531