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 …
A Ephremides, S Verdu - IEEE Transactions on Automatic …, 1989 - ieeexplore.ieee.org
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 …
PD Roorda, VCM Leung - IEE Proceedings-Communications, 1996 - IET
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 …
RM Bournas, FJ Beutler, D Teneketzis - Annals of Operations Research, 1992 - Springer
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 …
MY Kel'bert, YM Sukhov - Journal of Soviet Mathematics, 1990 - Springer
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 …
D Cansever, RA Milito - … of the 27th IEEE Conference on …, 1988 - ieeexplore.ieee.org
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 …