Article contents
COUNTEREXAMPLES TO A CONJECTURE ON BOUNDS FOR THE LOSS PROBABILITY IN FINITE-BUFFER QUEUES
Published online by Cambridge University Press: 01 April 1999
Abstract
In this paper, we provide counterexamples to a conjecture, made by Miyazawa and Tijms (1993), on the upper and lower bounds for the loss probability in finite-buffer queues.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 13 , Issue 2 , April 1999 , pp. 221 - 227
- Copyright
- © 1999 Cambridge University Press
- 1
- Cited by