The Power-Series Algorithm Applied to the Shortest-Queue Model

DOI10.1287/opre.40.1.157zbMath0743.60092OpenAlexW2109268366MaRDI QIDQ5966610

J. P. C. Blanc

Publication date: 28 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/842e33f77b8fdcbf67ab34dbb36189a8d19ffca0

zbMATH Keywords

queue length distributionpower series algorithmiterative numerical techniqueshortest-queue model

Mathematics Subject Classification ID

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

Related Items (12)

Bad luck when joining the shortest queue ⋮ Analysis of the asymmetric shortest queue problem ⋮ Taylor series expansions for Poisson-driven (max,+)-linear systems ⋮ A level-crossing approach to the solution of the shortest-queue problem ⋮ Analysis of stationary queue length distribution for Geo/T-IPH/1 queue ⋮ Analytic approximations of queues with lightly- and heavily-correlated autoregressive service times ⋮ Stationary Distribution Analysis of a Queueing Model with Local Choice ⋮ Analysis of two queues in parallel with jockeying and restricted capacities ⋮ Performance evaluation of polling systems by means of the power-series algorithm ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Analysis of the shortest relay queue policy in a cooperative random access network with collisions ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system

This page was built for publication: The Power-Series Algorithm Applied to the Shortest-Queue Model