Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T04:22:42.237Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  14 July 2016

J. R. Artalejo*
Affiliation:
Universidad Complutense de Madrid
M. J. Lopez-Herrero*
Affiliation:
Universidad Complutense de Madrid
*
∗ Postal address: Faculty of Mathematics, Department of Statistics and O.R., Complutense University of Madrid, Madrid 28040, Spain. Email address: jesus_artalejo@mat.ucm.es
∗∗ Postal address: School of Statistics, Complutense University of Madrid, Madrid 28040, Spain.

Abstract

This paper presents an algorithmic analysis of the busy period for the M/M/c queueing system. By setting the busy period equal to the time interval during which at least one server is busy, we develop a first step analysis which gives the Laplace-Stieltjes transform of the busy period as the solution of a finite system of linear equations. This approach is useful in obtaining a suitable recursive procedure for computing the moments of the length of a busy period and the number of customers served during it. The maximum entropy formalism is then used to analyse what is the influence of a given set of moments on the distribution of the busy period and to estimate the true busy period distribution. Our study supplements a recent work of Daley and Servi (1998) and other studies where the busy period of a multiserver queue follows a different definition, i.e., a busy period is the time interval during which all servers are engaged.

MSC classification

Information

Type
Research Papers
Copyright
Copyright © by the Applied Probability Trust 2001 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable