Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-18T04:03:05.961Z Has data issue: false hasContentIssue false

A note on losses in M/GI/1/n queues

Published online by Cambridge University Press:  14 July 2016

Rhonda Righter*
Affiliation:
Santa Clara University
*
Postal address: Department of Operations and Management Information Systems, Santa Clara University, Santa Clara, CA 95053, USA. Email address: rrighter@scu.edu

Abstract

Let Ln be the number of losses during a busy period of an M/GI/1/n queueing system. We develop a coupling between Ln and Ln+1 and use the resulting relationship to provide a simple proof that when the mean service time equals the mean interarrival time, ELn = 1 for all n. We also show that Ln is increasing in the convex sense when the mean service time equals the mean interarrival time, and it is increasing in the increasing convex sense when the mean service time is less than the mean interarrival time.

MSC classification

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1999 

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

References

Abramov, V. M. (1984). Some properties of lost customers. Izv. Akad. Nauk SSSR 3, 148150. (In Russian.)Google Scholar
Abramov, V. M. (1991a). Investigation of a Queueing System with Service Depending on Queue Length. Donish, Dushanbe. (In Russian.)Google Scholar
Abramov, V. M. (1991b). Asymptotic properties of lost customers for one queueing system with refusals. Kibernetika 2, 123124. (In Russian.)Google Scholar
Abramov, V. M. (1997). On a property of a refusals stream. J. Appl. Prob. 34, 800805.CrossRefGoogle Scholar