Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-24T07:59:21.140Z Has data issue: false hasContentIssue false
  • English
  • Français

Inequalities for the GI/M/1/n loss system

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

Vyacheslav M. Abramov
Vyacheslav M. Abramov*
Affiliation:
Orika Optical Networks Ltd
*
∗ Postal address: 24/6 Balfour Street, Petach Tiqva 49350, Israel. Email address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

The present paper provides simple inequalities for the number of lost customers during a busy period of a GI/M/1/n queueing system.

Keywords

loss systemsbusy periodbranching processnumber of up- and down-crossingspartial ordering

MSC classification

Primary: 60K25: Queueing theory
Type
Short Communications
Information
Journal of Applied Probability , Volume 38 , Issue 1 , March 2001 , pp. 232 - 234
Copyright
Copyright © by the Applied Probability Trust 2001 

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. (1991). Investigation of a Queueing System with Service Depending on Queue Length. Donish, Dushanbe (in Russian).Google Scholar
Abramov, V. M. (1994). On the asymptotic distribution of the maximum number of infectives in epidemic models with immigration. J. Appl. Prob. 31, 606–613.Google Scholar
Abramov, V. M. (1997). On a property of a refusals stream. J. Appl. Prob. 34, 800–805.CrossRefGoogle Scholar
Cohen, J. W. (1977). On up- and down-crossings. J. Appl. Prob. 14, 405–410.Google Scholar
Righter, R. (1999). A note on losses in M/GI/1/n queues. J. Appl. Prob. 36, 1240–1243.Google Scholar
Stoyan, D. (1983). Comparison Methods for Queues and other Stochastic Models. John Wiley, Chichester.Google Scholar