Show simple item record

An Optimal Scheme for Two Competing Queues with Constraints.

dc.contributor.authorShwartz, A.en_US
dc.contributor.authorMakowski, Armand M.en_US
dc.date.accessioned2007-05-23T09:34:28Z
dc.date.available2007-05-23T09:34:28Z
dc.date.issued1985en_US
dc.identifier.urihttp://hdl.handle.net/1903/4411
dc.description.abstractTwo types of traffic, e.g., voice and data, share a single synchronous and noisy communication channel. This situation is modeled as a system of two discrete-time queues with geometric service requirements which compete for the attention of a single server. The problem is cast as one in Markov decision theory with long-run average cost and constraint. An optimal strategy is identified that possesses a simple structure, and its implementation is discussed in terms of an adaptive algorithm that is extremely simple, recursive and easily implementable, with no prior knowledge of the actual values of the statistical parameters. The derivation of the results combines martingale arguments, results on Markov chains, O.D.E. characterization of the limit of stochastic approximations , methods from weak convergence. The ideas developed here are of independent interest , should prove useful in studying broad classes of constrained Markov decision problems.en_US
dc.format.extent877274 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1985-38en_US
dc.titleAn Optimal Scheme for Two Competing Queues with Constraints.en_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record