An Optimal Scheme for Two Competing Queues with Constraints.
| dc.contributor.author | Shwartz, A. | en_US |
| dc.contributor.author | Makowski, Armand M. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:34:28Z | |
| dc.date.available | 2007-05-23T09:34:28Z | |
| dc.date.issued | 1985 | en_US |
| dc.description.abstract | Two 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.extent | 877274 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4411 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1985-38 | en_US |
| dc.title | An Optimal Scheme for Two Competing Queues with Constraints. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1