On finite moments of full busy periods of GI/G/c queues
Saeed Ghahramani and Ronald W. Wolff
Source: J. Appl. Probab. Volume 42, Number 1
(2005), 275-278.
Abstract
For a GI/G/c queue, a full busy period is an interval that begins when an arrival finds c - 1 customers in the system, and ends when, for the first time after that, a departure leaves behind c - 1 customers in the system. We present a probabilistic proof of conditions for full busy periods to have finite moments. For queues that empty, this result may be deduced from results in the literature, but our proof is much easier. For queues that do not empty, our proof still applies, and this result is new.
First Page:
Show
Hide
Primary Subjects:
60K25
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/1110381387
Digital Object Identifier: doi:10.1239/jap/1110381387
Mathematical Reviews number (MathSciNet): MR2144910
Zentralblatt MATH identifier: 1076.60080
References
Brumelle, S. L. (1971). Some inequalities for parallel-server queues. Operat. Res. 19, 402--413.
Mathematical Reviews (MathSciNet): MR288877
Ghahramani, S. (1989). Finiteness of moments of virtual work for GI/G/$c$ queues. J. Appl. Prob. 26, 423--425.
Mathematical Reviews (MathSciNet): MR1000303
Ghahramani, S. and Wolff, R. W. (1989). A new proof of finite moment conditions for GI/G/$1$ busy periods. Queueing Systems 4, 171--178.
Mathematical Reviews (MathSciNet): MR1009753
Digital Object Identifier: doi:10.1007/BF01158551
Zentralblatt MATH: 0671.60085
Kiefer, J. and Wolfowitz, J. (1955). On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 1--18.
Mathematical Reviews (MathSciNet): MR66587
Kiefer, J. and Wolfowitz, J. (1956). On the characteristics of the general queueing process with applications to random walks. Ann. Math. Statist. 27, 147--161.
Mathematical Reviews (MathSciNet): MR77019
Digital Object Identifier: doi:10.1214/aoms/1177728354
Scheller-Wolf, A. and Sigman, K. (1997). Delay moments for FIFO GI/GI/$s$ queues. Queueing Systems 25, 77--95.
Mathematical Reviews (MathSciNet): MR1458586
Digital Object Identifier: doi:10.1023/A:1019152317954
Sigman, K. (1988). Regeneration in tandem queues with multi-server stations. J. Appl. Prob. 25, 391--403.
Mathematical Reviews (MathSciNet): MR938203
Sigman, K. (1990). One-dependent regenerative processes and queues in continuous time. Math. Operat. Res. 15, 175--189.
Mathematical Reviews (MathSciNet): MR1038240
Thorisson, H. (1985). The queue GI/G/$k$: finite moments of the cycle variables and uniform rates of convergence. Commun. Statist. Stoch. Models 1, 221--238.
Mathematical Reviews (MathSciNet): MR836609
Whitt, W. (1972). Embedded renewal processes in the GI/G/$s$ queues. J. Appl. Prob. 9, 650--658.
Mathematical Reviews (MathSciNet): MR341670
Wolff, R. W. (1984). Conditions for finite ladder height and delay moments. Operat. Res. 32, 906--916.
Mathematical Reviews (MathSciNet): MR865586
Wolff, R. W. (1988). Sample-path derivations of the excess, age, and spread distributions. J. Appl. Prob. 25, 432--436.
Mathematical Reviews (MathSciNet): MR938209
Journal of Applied Probability
