Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-27T21:13:55.710Z Has data issue: false hasContentIssue false
  • English
  • Français

On a property of a refusals stream

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

Vyacheslav M. Abramov
Vyacheslav M. Abramov*
Affiliation:
Chaim Sheba Medical Center
*
∗Postal address: Institute of Clinical Epidemiology, The Chaim Sheba Medical Center, Tel Hashomer, Ramat-Gan 52621, Israel. Present address: 26/7 Rambam St., Petach Tiqwa 49542, Israel.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper consists of two parts. The first part provides a more elementary proof of the asymptotic theorem of the refusals stream for an M/GI/1/n queueing system discussed in Abramov (1991a). The central property of the refusals stream discussed in the second part of this paper is that, if the expectations of interarrival and service time of an M/GI/1/n queueing system are equal to each other, then the expectation of the number of refusals during a busy period is equal to 1. This property is extended for a wide family of single-server queueing systems with refusals including, for example, queueing systems with bounded waiting time.

Keywords

REFUSALSM/GI/1/N QUEUEING SYSTEMBUSY PERIODRENEWAL PROCESS

MSC classification

Primary: 60K25: Queueing theory
Type
Short Communications
Information
Journal of Applied Probability , Volume 34 , Issue 3 , September 1997 , pp. 800 - 805
Copyright
Copyright © Applied Probability Trust 1997 

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 was supported by the Nate H. and Beatrice G. Sherman Fellowship at the Technion — Israel Institute of Technology.

References

Abramov, V. M. (1984) Some properties of lost customers. Izv. Akad. Nauk SSSR 3, 148–150. (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, 123–124. (In Russian.) Google Scholar
Asmussen, S. (1987) Applied Probability and Queues. Wiley, New York.Google Scholar
Cooper, R. B. and Tilt, B. (1976) On the relationship between the distribution of the maximal queue length in the M/G/1 queue and the mean busy period in the M/M/G/1/n queue. J. Appl. Prob. 13, 195–199.CrossRefGoogle Scholar
Karlin, S. and Taylor, H. G. (1975) A First Course in Stochastic Processes. 2nd edn. Academic Press, New York.Google Scholar
Subkhankulov, M. A. (1976) Tauberian Theorems with Remainder. Nauka, Moscow. (In Russian.) Google Scholar
Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar
Takács, L. (1967) Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York.Google Scholar
Tomko, J. (1967) One limit theorem in the queueing problem as input stream increases infinitely. Studia Sci. Math. Hungarica 2, 447–454. (In Russian.) Google Scholar