Bounds for Design Parameters in Queues
The authors purport to obtain bounds on and approximations to the probability of first passage for extreme values over a given number of periods, as applied to single server queues with Poisson arrivals and exponential service. The calculations found in the paper are elementary, and are directly based on standard results. There is considerably conceptual confusion on the definition of symbols and the meaning of the computations; the latter also simultaneously mix time, number, and discrete period parameters. Two numerical examples are offered to suggest design choices that avoid extreme values over a specified number of periods with a designated probability.
- Optimal design and control of queues
- Upper bounds for a theory of queues
- Optimal design of measurements on queueing systems
- Limits of applicability of approximate methods of design of queuing networks
- Performance bounds for queueing networks and scheduling policies
- On the optimal design of tandem queueing systems with finite buffers
- Performance bounds for nonhomogeneous queues
- Design and analysis of general bulk queueing models and its applications
- Optimal buffer design of an m/g/s queue with finite capacity∗
This page was built for publication: Bounds for Design Parameters in Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024151)