DocumentCode :
1394229
Title :
The M/G/1 queue with permanent customers
Author :
Boxma, O.J. ; Cohen, J.W.
Author_Institution :
Centre for Math. & Comput. Sci., Amsterdam, Netherlands
Volume :
9
Issue :
2
fYear :
1991
fDate :
2/1/1991 12:00:00 AM
Firstpage :
179
Lastpage :
184
Abstract :
The authors examine an M/G/1 FCFS (first come, first served) queue with two types of customers: ordinary customers, who arrive according to a Poisson process, and permanent customers, who immediately return to the end of the queue after having received a service. The influence of the permanent customers on queue length and sojourn times of the Poisson customers is studied using results from queuing theory and from the theory of branching processes. In particular, it is shown that, when the service time distributions of the Poisson customers and all K permanent customers are negative exponential with identical means, the queue length and sojourn time distributions of the Poisson customers are the (K+1)-fold convolution of those for the case without permanent customers
Keywords :
queueing theory; M/G/1 queue; Poisson process; branching processes theory; first come first served queue; permanent customers; queue length; queuing theory; service time distributions; sojourn time; Communication networks; Computer science; Convolution; Mathematics; Queueing analysis; Stochastic processes;
fLanguage :
English
Journal_Title :
Selected Areas in Communications, IEEE Journal on
Publisher :
ieee
ISSN :
0733-8716
Type :
jour
DOI :
10.1109/49.68445
Filename :
68445
Link To Document :
بازگشت