Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-27T13:56:41.613Z 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
Get access Rights & Permissions [Opens in a new window]

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)