IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v41y1995i10p1704-1715.html
   My bibliography  Save this article

Variability Functions for Parametric-Decomposition Approximations of Queueing Networks

Author

Listed:
  • Ward Whitt

    (AT&T Bell Laboratories, Murray Hill, New Jersey 07974-0636)

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.

Suggested Citation

  • Ward Whitt, 1995. "Variability Functions for Parametric-Decomposition Approximations of Queueing Networks," Management Science, INFORMS, vol. 41(10), pages 1704-1715, October.
    • Handle: RePEc:inm:ormnsc:v:41:y:1995:i:10:p:1704-1715
    DOI: 10.1287/mnsc.41.10.1704
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.41.10.1704
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.41.10.1704?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sunkyo Kim, 2005. "Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 399-408, August.
    2. Rabta, Boualem, 2013. "A hybrid method for performance analysis of G/G/m queueing networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 89(C), pages 38-49.
    3. Feng Dong & Qiguo Gong & Hui Wang & Siyuan Yi & Yue Cai, 2019. "Rest Breaks Arrange Based on Empirical Studies of Productivity in Manufacturing Industry," Asian Economic and Financial Review, Asian Economic and Social Society, vol. 9(9), pages 1043-1066, September.
    4. Ward Whitt & Wei You, 2018. "Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues," Operations Research, INFORMS, vol. 66(1), pages 184-199, January.
    5. Sunkyo Kim, 2011. "Modeling Cross Correlation in Three-Moment Four-Parameter Decomposition Approximation of Queueing Networks," Operations Research, INFORMS, vol. 59(2), pages 480-497, April.
    6. Wu, Kan & Zhao, Ning, 2015. "Dependence among single stations in series and its applications in productivity improvement," European Journal of Operational Research, Elsevier, vol. 247(1), pages 245-258.
    7. Van Nyen, Pieter L. M. & Van Ooijen, Henny P. G. & Bertrand, J.W.M.J. Will M., 2004. "Simulation results on the performance of Albin and Whitt's estimation method for waiting times in integrated production-inventory systems," International Journal of Production Economics, Elsevier, vol. 90(2), pages 237-249, July.
    8. Kim, Sunkyo, 2004. "The heavy-traffic bottleneck phenomenon under splitting and superposition," European Journal of Operational Research, Elsevier, vol. 157(3), pages 736-745, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:41:y:1995:i:10:p:1704-1715. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.