Counterexamples to a conjecture on bounds for the loss probability in finite-buffer queues

Counterexamples to a conjecture on bounds for the loss probability in finite-buffer queues

0.00 Avg rating0 Votes
Article ID: iaor2000546
Country: United States
Volume: 13
Issue: 2
Start Page Number: 221
End Page Number: 227
Publication Date: Jan 1999
Journal: Probability in the Engineering and Informational Sciences
Authors:
Abstract:

In this paper, we provide counterexamples to a conjecture, made by Miyazawa and Tijms, on the upper and lower bounds for the loss probability in finite-buffer queues.

Reviews

Required fields are marked *. Your email address will not be published.