A convergence theorem for controlled queues with partial observations

We consider a queuing problem in which both the service rate of a finite-buffer queue and its rate of arrivals are functions of the same partially observed Markov chain. Basic performance indices of this device, such as long term throughput and loss rates, are expressed in terms of an invariant measure over a suitable finite-dimensional simplex. In this paper we prove the existence of that invariant measure.


Published in:
Proc. IEEE International Symposium on Information Theory (ISIT), 380
Year:
2002
Keywords:
Laboratories:




 Record created 2005-04-18, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)