Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach
type: Item
instance of: scholarly article
zbMATH Open document ID: 0985.60084
author: M. J. Lopez-Herrero
author: Jesus R. Artalejo
published in: Journal of Applied Probability
publication date: 2002-05-09T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 1625618
zbMATH Keywords: M/M/\(c\) queue
zbMATH Keywords: busy period
zbMATH Keywords: number of customer
zbMATH Keywords: maximum entropy principle
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1239/jap/996986654
OpenAlex ID: W2073233802
DOI: 10.1239/JAP/996986654
title: Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach
review text: In the literature, there are two different types of busy period analysis: (i) Full busy period: a period commencing when an arriving customer finds \(c-1\) customers in the system and ending at the first departure epoch behind \(c-1\) customers. (ii) Partial busy period: a period commencing with the arrival of a customer who finds the system empty and ends at the first departure epoch in which the system becomes empty again. NEWLINENEWLINENEWLINEThe authors deal with the second kind of busy period of an \(\text{M/M}/c\) queue and with its algorithmic analysis giving the Laplace-Stieltjes transform of the busy period as a solution of a finite system of linear equations. The maximum entropy principle is done to analyze the influence of moments on the busy period distribution.
reviewed by: Anatolij Dvurečenskij
description: scientific article; zbMATH DE number 1625618