Inequalities for the GI/M/1/n loss system
Vyacheslav M. Abramov
Source: J. Appl. Probab. Volume 38, Number 1
(2001), 232-234.
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.
First Page:
Show
Hide
Primary Subjects:
60K25
Keywords: loss systems; busy period; branching process; number of up- and down-crossings; partial ordering
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jap/996986656
Digital Object Identifier: doi:10.1239/jap/996986656
Mathematical Reviews number (MathSciNet): MR1816126
Zentralblatt MATH identifier: 0980.60115
Journal of Applied Probability
