Open Access
Translator Disclaimer
May, 1994 Brownian Models of Closed Queueing Networks: Explicit Solutions for Balanced Three-Station Systems
Elizabeth Schwerer, Jan A. Van Mieghem
Ann. Appl. Probab. 4(2): 448-477 (May, 1994). DOI: 10.1214/aoap/1177005068

Abstract

We study a closed, three-station queueing network with general service time distributions and balanced workloads (that is, each station has the same relative traffic intensity). If the customer population is large, then the queue length process of such a network can be approximated by driftless reflected Brownian motion (RBM) in a simplex. Building on earlier work by Harrison, Landau ands Shepp, we develop explicit formulas for various quantities associated with the stationary distribution of RBM in a general triangle and use them to derive approximate performance measures for the closed queueing network. In particular, we develop approximations for the throughput rate and for moments and tail fractiles of the throughput time distribution. Also, crude bounds on the throughput rate and mean throughput time are proposed. Finally, we present three examples that test the accuracy of both the Brownian approximation and our performance estimates.

Citation

Download Citation

Elizabeth Schwerer. Jan A. Van Mieghem. "Brownian Models of Closed Queueing Networks: Explicit Solutions for Balanced Three-Station Systems." Ann. Appl. Probab. 4 (2) 448 - 477, May, 1994. https://doi.org/10.1214/aoap/1177005068

Information

Published: May, 1994
First available in Project Euclid: 19 April 2007

zbMATH: 0805.60096
MathSciNet: MR1272735
Digital Object Identifier: 10.1214/aoap/1177005068

Subjects:
Primary: 60K25
Secondary: 68M20 , 90B22

Keywords: Closed queueing networks , heavy traffic analysis , performance analysis , reflected Brownian motion , sojourn time analysis

Rights: Copyright © 1994 Institute of Mathematical Statistics

JOURNAL ARTICLE
30 PAGES


SHARE
Vol.4 • No. 2 • May, 1994
Back to Top