Algorithmic Analysis of the Maximum Queue Length in a Busy Period for the M/M/c Retrial Queue

DOI10.1287/ijoc.1050.0156zbMath1241.90028OpenAlexW2039101550MaRDI QIDQ2892318

Antonis Economou, Maria Jesus Lopez-Herrero, Jesus R. Artalejo

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1050.0156

zbMATH Keywords

\(M/M/c\) retrial queue maximum orbit size busy period continuous-time Markov chain tridiagonal linear system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (14)

Maximum queue lengths during a fixed time interval in the \(M/M/c\) retrial queue ⋮ On the distribution of the successful and blocked events in the \(M/M/c\) retrial queue: a computational approach ⋮ Algorithmic approximations for the busy period distribution of the \(M/M/c\) retrial queue ⋮ Applications of maximum queue lengths to call center management ⋮ Computational analysis of the maximal queue length in the MAP/\(M\)/\(c\) retrial queue ⋮ Computing the performance measures in queueing models via the method of order statistics ⋮ THE RUNNING MAXIMUM OF A LEVEL-DEPENDENT QUASI-BIRTH-DEATH PROCESS ⋮ On the multi-server retrial queue with geometric loss and feedback: computational algorithm and parameter optimization ⋮ Multi-server retrial queue with second optional service: algorithmic computation and optimisation ⋮ The \(M/G/1\) retrial queue: New descriptors of the customer's behavior ⋮ A heuristic algorithm for the optimization of a retrial system with Bernoulli vacation ⋮ Heavy-traffic extreme value limits for Erlang delay models ⋮ Algorithmic analysis of the MAP/PH/1 retrial queue ⋮ Unnamed Item

This page was built for publication: Algorithmic Analysis of the Maximum Queue Length in a Busy Period for the M/M/c Retrial Queue