Title :
Optimal control of arrivals at a blocking node
Author :
Lambadaris, I. ; Narayan, P.
Author_Institution :
Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
Abstract :
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 frequency slots. Messages not accepted at the node are assumed to be lost. Under the assumption of exponential service time distributions, the authors study the problem of dynamic allocation of available channel bandwidth among the two traffic types to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain, they show by an application of dynamic programming principles that the optimal policy is characterized by a set of two switching curves.<>
Keywords :
Markov processes; channel capacity; computer networks; data communication systems; dynamic programming; optimal control; telecommunication traffic; available channel bandwidth; blocking probabilities; communication traffic streams; dynamic allocation; dynamic programming; exponential service time distributions; switching curves; two-dimensional Markov chain; Bandwidth; Communication system traffic control; Dynamic programming; Educational institutions; ISDN; Multiplexing; Optimal control; Surges; Telecommunication traffic; Traffic control;
Conference_Titel :
Computer Networking Symposium, 1988., Proceedings of the
Conference_Location :
Washington, DC, USA
Print_ISBN :
0-8186-0835-8
DOI :
10.1109/CNS.1988.4998
