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 …

The problem of optimum flow control of a class of queueing systems which appears as a
model of datagram and virtual circuit computer communication networks is investigated. This …

The authors survey networking solutions that have been proposed for high-speed packet-
switched applications. Using these solutions as examples, they identify the specific …

The routing function is necessary in computer communication networks in order to create the
appearance of complete connectivity in an environment of sparse physical links. The …

In this paper the authors provide a model and analysis of the IBM SNA virtual route pacing
control used to control congestion in SNA networks. The model is appropriate to single …

This paper presents a comparative analysis of network routing schemes for large-scale
packet radio networks PRNET with mobile nodes. This analysis is aimed at determining two …

The modeling and optimal flow control of a Jacksonian network in equilibrium is
investigated. The model employed consists of a controller node cascaded with the …

In this investigation, a multi server queueing network problem with cutoff priority is studied.
The two types of input traffic are allowed in the system with different arrival rates. One type of …

We give a distributed algorithm to compute shortest paths in a network with changing
topology. It does not suffer from the routing table looping behavior associated with the Ford …

In this paper we consider a queueing system having n exponential servers, each with its
own queue and service rate. Customers arrive according to a Poisson process with rate λ …