A method for approximating the variance of the sojourn times in star-shaped queueing networks

R.D. van der Mei, A.R. de Wilde, S. Bhulai

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

We study the sojourn times in an open star-shaped queueing network, with a central processor-sharing (PS) node and multiple multi-server First-Come-First Served (FCFS) nodes. Each customer alternatingly visits the central node and one of the other nodes, before departing from the system. For this model, exact expressions for the mean sojourn time can be easily obtained, but an exact analysis of the variance is not possible. Therefore, we propose a method for deriving simple but accurate approximations for the variance of the sojourn times. Extensive simulations demonstrate that the approximations are extremely accurate for a wide range of parameter values.
Original languageEnglish
Pages (from-to)487-501
JournalStochastic Models
Volume24
Issue number3
DOIs
Publication statusPublished - 2008

Fingerprint

Dive into the research topics of 'A method for approximating the variance of the sojourn times in star-shaped queueing networks'. Together they form a unique fingerprint.

Cite this