Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-29T04:25:47.346Z Has data issue: false hasContentIssue false
  • English
  • Français

Characterizing losses during busy periods in finite buffer systems

Part of: Operations research and management science Special processes

Published online by Cambridge University Press:  14 July 2016

Erol A. Peköz ,
Rhonda Righter  and
Cathy H. Xia
Erol A. Peköz*
Affiliation:
Boston University
Rhonda Righter*
Affiliation:
Santa Clara University
Cathy H. Xia*
Affiliation:
IBM
*
∗ Postal address: School of Management, Boston University, Boston, MA 02215, USA.
∗∗ Postal address: Department of Operations and Management Information Systems, Santa Clara University, Santa Clara, CA 95053, USA. Email address: [email protected]
∗∗∗ Postal address: IBM T.J. Watson Research Center, PO Box 704, Yorktown, NY 10598, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

For multiple-server finite-buffer systems with batch Poisson arrivals, we explore how the distribution of the number of losses during a busy period changes with the buffer size and the initial number of customers. We show that when the arrival rate equals the maximal service rate (ρ = 1), as the buffer size increases the number of losses in a busy period increases in the convex sense, and when ρ > 1, as the buffer size increases the number of busy period losses increases in the increasing convex sense. Also, the number of busy period losses is stochastically increasing in the initial number of customers. A consequence of our results is that, when ρ = 1, the mean number of busy period losses equals the mean batch size of arrivals regardless of the buffer size. We show that this invariance does not extend to general arrival processes.

Keywords

Finite buffer systembusy period lossesMX/GI/1/n queue

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B22: Queues and service
Type
Short Communications
Information
Journal of Applied Probability , Volume 40 , Issue 1 , March 2003 , pp. 242 - 249
Copyright
Copyright © Applied Probability Trust 2003 

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.)

Footnotes

Research supported by the Breetwor Fellowship of the Leavey School of Business of Santa Clara University.

References

[1] Abramov, V. M. (1997). On a property of a refusals stream. J. Appl. Prob. 34, 800–805.Google Scholar
[2] Abramov, V. M. (2001). Inequalities for the GI/M/1/n loss system. J. Appl. Prob. 38, 232–234.Google Scholar
[3] Abramov, V. M. (2001). On losses in MX/GI/1/n queues. J. Appl. Prob. 38, 1079–1080.Google Scholar
[4] Abramov, V. M. (2002). Asymptotic analysis for the GI/M/1/n loss system as n increases to infinity. Preprint.Google Scholar
[5] Abramov, V. M. (2002). New inequalities for the GI/M/1/n loss system. Preprint.Google Scholar
[6] Billingsley, P. B. (1986). Probability and Measure, 2nd edn. John Wiley, New York.Google Scholar
[7] Peköz, E. A., (1999). On the number of refusals in a busy period. Prob. Eng. Inf. Sci. 13, 71–74.Google Scholar
[8] Righter, R. (1999). A note on losses in M/GI/1/n queues. J. Appl. Prob. 36, 1240–1241.Google Scholar
[9] Wolff, R. W. (2002). Losses per cycle in a single-server queue. J. Appl. Prob. 39, 905–909.Google Scholar