We propose a class of algorithms for finding an optimal quasi-static routing in a
communication network. The algorithms are based on Gallager's method [1] and provide …

An algorithm is defined for establishing routing tables in the individual nodes of a data
network. The routing table at a node i specifies, for each other node j, what fraction of the …

A procedure is presented for estimating online marginal packet delays through links with
respect to link flows without making the standard assumptions (exponentially distributed …

This report describes an algorithm for minimum delay routing in a communication network.
During the algorithm each node maintains a list of paths along which it sends traffic to each …

A family of distributed algorithms for the dynamic computation of the shortest paths in a
computer network or internet is presented, validated, and analyzed. According to these …

The authors give a distributed algorithm to compute shortest paths in a network with
changing topology. The authors analyze its behavior. The proof of correctness is discussed …

A new distributed algorithm is presented for dynamically determining weighted shortest
paths used for message routing in computer networks. The major features of the algorithm …

The dynamics of shortest-path routing algorithms bss. ed on distance vectors and link states
are investigated. Detailed quantitative comparisons of the distributed Belhnen-Ford …

An important problem in packet-switched communication networks is the optimal assignment
of routes to the message packets. An optimal routing assignment is one which chooses …

We present a unified approach for the dynamic computation of shortest paths in a computer
network using either distance vectors or link states. We describe a distributed algorithm that …