scispace - formally typeset
Search or ask a question

Showing papers on "Optimized Link State Routing Protocol published in 1981"


Journal ArticleDOI
TL;DR: Two new versions of a distributed protocol for establishing and maintaining loop-free routing tables for communication networks with changing topology are presented and possess significant advantages over previous versions in terms of complexity of the node algorithm and of the validation procedure.
Abstract: Two new versions of a distributed protocol for establishing and maintaining loop-free routing tables for communication networks with changing topology are presented. The protocols here possess significant advantages over previous versions in terms of complexity of the node algorithm and of the validation procedure, as well as the communication and storage needs. In addition, we present a procedure for establishing new and disrupted calls in a virtual or physical circuit-switched network, and for canceling existing calls, such that each call is loop-free and is established according to the routing tables provided by the protocol.

29 citations


Journal ArticleDOI
TL;DR: Previous distributed routing protocols in data-communication networks that achieve minimum average delay are extended to take into consideration topological changes in the network.
Abstract: Previous distributed routing protocols in data-communication networks that achieve minimum average delay are extended to take into consideration topological changes in the network.

20 citations