Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T20:00:43.690Z Has data issue: false hasContentIssue false
  • English
  • Français

COUNTEREXAMPLES TO A CONJECTURE ON BOUNDS FOR THE LOSS PROBABILITY IN FINITE-BUFFER QUEUES

Published online by Cambridge University Press:  01 April 1999

Yiqiang Q. Zhao
Yiqiang Q. Zhao
Affiliation:
Department of Mathematics and Statistics, University of Winnipeg, Winnipeg, Canada R3B 2E9
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

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