OPTIMAL SERVICE ALLOCATION AMONG TWO HETEROGENEOUS TRAFFIC TYPES WITH NO QUEUEING.
Two communication traffic streams with Poisson statistics arrive at a network node. These are to be transmitted across a channel with a total bandwidth capacity of C slots. Messages not accepted at the node are assumed to be lost. Under the assumptions of exponential service time distributions, the problem of dynamic allocation of available channel bandwidth among the two traffic types is studied in order to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain is studied to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain, it is shown by an application of dynamic programming principles that the optimal policy has the form of a 'switching curve'.
|Conference||Proceedings of the 26th IEEE Conference on Decision and Control.|
Lambadaris, I, Narayan, P. (P.), & Viniotis, I. (I.). (1987). OPTIMAL SERVICE ALLOCATION AMONG TWO HETEROGENEOUS TRAFFIC TYPES WITH NO QUEUEING. In Proceedings of the IEEE Conference on Decision and Control (pp. 1496–1498).