Analysis of the busy period for the M / M / c queue: An algorithmic approach

Journal of Applied Probability

Volumn 38, Issue 1, 2001, Pages 209-222

  Artalejo, J R ^a   Lopez Herrero, M J ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Multiserver queues; busy period; number of customers served; maximum entropy principle

Indexed keywords

EID: 0035533784     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/996986654     Document Type: Article

References (23)

1. ARORA, K. L. (1964). Two-server bulk-service queuing process. Operat. Res. 12, 286-294.
2. ARTALEJO, J. R. (1999). Accessible bibliography on retrial queues. Math. Comput. Model. 30, 1-6.
3. ARTALEJO, J. R. AND GOMEZ-CORRAL, A. (1997). Steady state solution of a single-server queue with linear repeated request. J. Appl. Prob. 34, 223-233.
4. ARTALEJO, J. R. AND LOPEZ-HERRERO, M. J. (2000). On the busy period of the M/ G / 1 retrial queue. Naval Res. Logist. 47, 115-127.
5. DALEY, D. J. AND SERVI, L. D. (1998). Idle and busy periods in stable M/ M / k queues. J. Appl. Prob. 35, 950-962.
6. FALIN, G. I., MARTIN, M. AND ARTALEJO, J. R. (1994). Information theoretic approximations for the M /G / 1 retrial queue. Acta Inf. 31, 559-571.
7. FALIN, G. I. AND TEMPLETON, J. G. C. (1997). Retrial Queues. Chapman and Hall, London.
8. GHAHRAMANI, S. (1986). Finiteness of moments of partial busy periods for M / G / c queues. J. Appl. Prob. 23, 261-264.
9. GHAHRAMANI, S. (1990). On remaining full busy periods of G1 / G / c queues and their relation to stationary point processes. J. Appl. Prob. 27, 232-236.
10. KARLIN, S. AND MCGREGOR, J. (1958). Many server queueing processes with Poisson input and exponential service times. Pacific J. Math. 8, 87-118.
11. KIEFER, J. AND WOLFOWITZ, J. (1956). On the characteristics of the general queuing process with applications to random walks. Ann. Math. Statist. 27, 147-161.
12. KLEINROCK, L. (1975). Queueing Systems, Vol. 1: Theory. John Wiley, New York.
13. KOUVATSOS, D. D. (1994). Entropy maximization and queueing networks models. Ann. Operat. Res. 48, 63-126.
14. KOUVATSOS, D. D. AND AWAN, I. U. (1998). MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes. Ann. Operat. Res. 79, 231-269.
15. MCCORMICK, W. P. AND PARK, Y. S. (1992). Approximating the distribution of the maximum queue length for M / M / s queues. In Queuing and Related Models, eds U. N. Bhat and I. V. Basawa, Clarendon Press, Oxford, pp. 240-261.
16. NATVIG, B. (1975a). On the waiting-time and busy period distributions for a general birth-and-death queueing model. J. Appl. Prob. 12, 524-532.
17. NATVIG, B. (1975b). A Contribution to the Theory of Birth-and-Death Queueing Models. Doctoral Thesis, University of Sheffield.
18. SHARMA, O. P. (1990). Markovian Queues. Ellis Horwood, New York.
19. SHORE, J. E. AND JOHNSON, R. W. (1981). Properties of cross-entropy minimization. IEEE Trans. Inf. Theory 27, 472-482.
20. SYSKI, R. (1986). Introduction to Congestion Theory in Telephone Systems. Elsevier/North-Holland, Amsterdam.
21. OMAHEN, K. AND MARATHE, V. (1978). Analysis and applications of the delay cycle for the M / M / c queueing system. J. Assoc. Comput. Mach. 25, 283-303.
22. WAGNER, U. AND GEYER, A. L. (1995). A maximum entropy method for inverting Laplace transforms of probability density functions. Biometrika 82, 887-892.
23. WIENS, D. P. (1989). On the busy period distribution of the M / G / 2 queueing system. J. Appl. Prob. 27, 858-865.