Title :
Optimal flow control allocation policies in communication networks with priorities
Author :
Bournas, Redha M. ; Beutler, Frederick J. ; Teneketzis, Demosthenis
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
Abstract :
M(⩾2) transmitting stations sending packets to a single receiver over a slotted time-multiplexed link are considered. The objective is to characterize dynamic policies that minimize the discounted and long-term average costs due to holding packets at the M stations. This flow control problem is modeled as a Markov decision process and treated by dynamic programming methods. The authors derive properties of optimal (discounted) policies that reduce the computational complexity of the flow control algorithm, and prove two properties of optimal policies. These properties are used to show that the optimization reduces to the calculation of optimal allocations for a finite number of states. Some special cases are considered
Keywords :
Markov processes; computational complexity; decision theory; dynamic programming; minimisation; packet switching; queueing theory; telecommunication networks; time division multiplexing; Markov decision process; communication networks; computational complexity; discounted average cost minimization; dynamic policies; dynamic programming; long-term average costs; optimal flow control allocation policies; packet holding costs; packet transmission; priorities; slotted time-multiplexed link; transmitting stations; Character generation; Communication networks; Communication system control; Computational complexity; Cost function; Costs; Dynamic programming; Intelligent networks; Optimal control; Statistics; Transmitters;
Conference_Titel :
Decision and Control, 1991., Proceedings of the 30th IEEE Conference on
Conference_Location :
Brighton
Print_ISBN :
0-7803-0450-0
DOI :
10.1109/CDC.1991.261429