The main purpose of routing and flow control in a communication network is, roughly
speaking, to keep delay per message (ie travel time from origin to destination) within an …

In many circumstances a telephone call can be completed through a connecting network in
several ways. Hence, there naturally arise problems of optimal routing, that is, of making the …

The authors focus on two areas of communication network design in which methods of
control and optimization theory have proven useful. These are the area of multiple access …

We present an algorithm for optimal routing in communication networks, resulting in
minimum time and minimum total delay clearing of congested traffic towards a single …

The flow of messages in a message-switched data communication network is modeled in a
continuous dynamical state space. The state variables represent message storage at the …

The first portion of this paper provides a broad introduction to the various types of routing
and flow control procedures either used or proposed for use at the transport (path control) …

The concept of optimum flows is introduced and its properties in a general communication
network where flow suffers loss or gains during transmission through channels are …

The problem of hop-by-hop flow control in a computer network is formulated as a Markov
decision process with a cost function composed of the delay of the messages and the buffer …

With the intention of outlining some of the theoretical studies on the design of packet
communication networks the present paper introduces the models and the basic relations …

The routing problem in multi‐destination data communication networks is considered. A
dynamic model, which can incorporate arbitrary, different, time‐varying processing delays at …