An explicit upper bound for the mean busy period in a GI/G/1 queue
Author:
- 1 March 1978
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 15 (02) , 452-455
Abstract
In this paper, an upper bound is derived for the mean busy cycle duration in GI/G/1 queues. The bound is of the form A/(1 – ρ), where ρ is the traffic intensity and A involves three moments of the basic random variables of the queue. The proof uses a well-known result of random walk theory.Keywords
This publication has 1 reference indexed in Scilit:
- Embedded renewal processes in theGI/G/squeueJournal of Applied Probability, 1972