A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks

DOI10.1080/15326340802232327zbMath1179.90087OpenAlexW2047826980MaRDI QIDQ3529857

A. R. de Wilde, Robert D. van der Mei, Sandjai Bhulai

Publication date: 14 October 2008

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326340802232327

zbMATH Keywords

variabilityresponse timeapproximationqueueing networkssojourn time

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Queues and service in operations research (90B22) Applications of branching processes (60J85) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Limit theorems for vector-valued random variables (infinite-dimensional case) (60B12)

Cites Work

• The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
• The multiple phase service network with generalized processor sharing
• Queues with delayed feedback
• Queueing Networks: A Survey of Their Random Processes
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

This page was built for publication: A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks