On a numerical method for calculating state probabilities for queueing systems with more than one waiting line

DOI10.1016/0377-0427(87)90129-4zbMath0629.90039OpenAlexW2064281565MaRDI QIDQ1094319

J. P. C. Blanc

Publication date: 1987

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(87)90129-4

zbMATH Keywords

power series expansionstraffic intensityexponential queueing systemsmoments of queue length distributionsqueues in parallelstate probabilities of queueing systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Probabilistic methods, stochastic differential equations (65C99)

Related Items (9)

Asymptotics for the late arrivals problem ⋮ Bad luck when joining the shortest queue ⋮ Analysis of the asymmetric shortest queue problem ⋮ Power series approximations for two-class generalized processor sharing systems ⋮ A numerical approach to cyclic-service queueing models ⋮ Performance evaluation of polling systems by means of the power-series algorithm ⋮ Analysis of the shortest relay queue policy in a cooperative random access network with collisions ⋮ Necessary conditions for the compensation approach for a random walk in the quarter-plane ⋮ Analysis of nonpreemptive priority queues with multiple servers and two priority classes

Cites Work

• Unnamed Item
• The shorter queue problem: A numerical study using the matrix-geometric solution
• A two-queue, one-server model with priority for the longer queue
• The autostrada queueing problem
• A note on waiting times in systems with queues in parallel
• Two coupled processors: The reduction to a Riemann-Hilbert problem

This page was built for publication: On a numerical method for calculating state probabilities for queueing systems with more than one waiting line