A numerical approach to cyclic-service queueing models

DOI10.1007/BF02411472zbMath0702.60091OpenAlexW2113745994MaRDI QIDQ915288

J. P. C. Blanc

Publication date: 1990

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02411472

zbMATH Keywords

numerical techniquememory spacepower-series expansionsqueue length distributions

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

Approximating queue size and waiting time distributions in general polling systems, Workload minimization in re-entrant lines, Taylor-series expansion for multivariate characteristics of classical risk processes, Efficient visit frequencies for polling tables: Minimization of waiting cost, Mathematical methods to study the polling systems, Performance evaluation of polling systems by means of the power-series algorithm, Cyclic reservation schemes for efficient operation of multiple-queue single-server systems, Adaptive solution of infinite linear systems by Krylov subspace methods, A 2-class maintenance model with dynamic server behavior, Solution of infinite linear systems by automatic adaptive iterations

Cites Work

• Unnamed Item
• On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
• A note on waiting times in systems with queues in parallel
• Pseudo-conservation laws in cyclic-service systems
• Power Series for Stationary Distributions of Coupled Processor Models
• Waiting-time approximations in multi-queue systems with cyclic service
• On the Convergence and Stability of the Epsilon Algorithm
• Queues Served in Cyclic Order: Waiting Times