The use of neural network computational algorithms to determine optimal traffic routing for
communication networks is introduced. The routing problem requires choosing multilink …

Markov decision processes (MDPs), also called stochastic dynamic programming, were first
studied in the 1960s. MDPs can be used to model and solve dynamic decision-making …

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 …

The authors consider the dynamic control of time slot assignment in reservation protocols for
multiaccess channels employing frame structures similar to those investigated by Roberts …

We consider M transmitting stations sending packets to a single receiver over a slotted time-
multiplexed link. For each phase consisting of T consecutive slots, the receiver dynamically …

Some current aspects of the theory of queuing networks are considered: existence and
uniqueness theorems for a probabilistic description of networks, exactly solvable models …

Рассматриваются некоторые современные аспекты теории сетей с очередями:
теоремы существования и единственности вероятностного описания сети, точно …

We model flow control between one receiving node and its adjacent transmitting nodes in a
computer network as a Markov decision problem. Given that the control action is to …

The problem of flow control between one receiving node and its adjacent transmitting nodes
in a computer network is modeled as a Markov decision problem. Given that the control …

The authors formulate the flow control between one receiving node and its adjacent
transmitting nodes in a computer network as a Markovian decision process. The objective is …