Variability Functions for Parametric-Decomposition Approximations of Queueing Networks

Ward Whitt
Additional contact information
Ward Whitt: AT&T Bell Laboratories, Murray Hill, New Jersey 07974-0636

Management Science, 1995, vol. 41, issue 10, 1704-1715

Abstract: We propose an enhancement to the parametric-decomposition method for calculating approximate steady-state performance measures of open queueing networks with non-Poisson arrival processes and nonexponential service-time distributions. Instead of using a variability parameter c a 2 for each arrival process, we suggest using a variability function c a 2 \rho, 0 a 2 \rho should be 0 for \rho near 0 or 1, but c a 2 \rho can assume arbitrarily large values for appropriate intermediate \rho. We present a full network algorithm with variability functions, showing that the idea is implementable. We also show how simulations of single queues can be effectively exploited to determine variability functions for difficult external arrival processes.

Keywords: queueing networks; Tandem queues; approximations; parametric-decomposition approximations; two-moment approximations; heavy traffic; squared coefficient of variation (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.41.10.1704 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:41:y:1995:i:10:p:1704-1715

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().