IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v59y2011i2p480-497.html
   My bibliography  Save this article

Modeling Cross Correlation in Three-Moment Four-Parameter Decomposition Approximation of Queueing Networks

Author

Listed:
  • Sunkyo Kim

    (School of Business, Ajou University, Suwon 443-749, Republic of Korea)

Abstract

In two-moment decomposition approximations of queueing networks, the arrival process is modeled as a renewal process, and each station is approximated as a GI/G/1 queue whose mean waiting time is approximated based on the first two moments of the interarrival times and the service times. The departure process is also approximated as a renewal process even though the autocorrelation of this process may significantly affect the performance of the subsequent queue depending on the traffic intensity. When the departure process is split into substreams by Markovian random routing, the split processes typically are modeled as independent renewal processes even though they are correlated with each other. This cross correlation might also have a serious impact on the queueing performance. In this paper, we propose an approach for modeling both the cross correlation and the autocorrelation by a three-moment four-parameter decomposition approximation of queueing networks. The arrival process is modeled as a nonrenewal process by a two-state Markov-modulated Poisson process, viz., MMPP(2). The cross correlation between randomly split streams is accounted for in the second and third moments of the merged process by the innovations method. The main contribution of the present research is that both the cross correlation and the autocorrelation can be modeled in parametric decomposition approximations of queueing networks by integrating the MMPP(2) approximation of the arrival/departure process and the innovations method. We also present numerical results that strongly support our refinements.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:oropre:v:59:y:2011:i:2:p:480-497
    DOI: 10.1287/opre.1100.0893
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1100.0893
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.1100.0893?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
    ---><---

    References listed on IDEAS

    as
    1. Ward Whitt, 1995. "Variability Functions for Parametric-Decomposition Approximations of Queueing Networks," Management Science, INFORMS, vol. 41(10), pages 1704-1715, October.
    2. 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.
    3. Gabriel R. Bitran & Devanath Tirupati, 1988. "Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference," Management Science, INFORMS, vol. 34(1), pages 75-100, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Vinarskiy, Miron, 2017. "A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes," European Journal of Operational Research, Elsevier, vol. 258(1), pages 207-215.
    2. Jean-Sébastien Tancrez, 2020. "A decomposition method for assembly/disassembly systems with blocking and general distributions," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 272-296, June.
    3. Sarat Babu Moka & Yoni Nazarathy & Werner Scheinhardt, 2023. "Diffusion parameters of flows in stable multi-class queueing networks," Queueing Systems: Theory and Applications, Springer, vol. 103(3), pages 313-346, April.
    4. Conlon, Thomas & Cotter, John & Gençay, Ramazan, 2018. "Long-run wavelet-based correlation for financial time series," European Journal of Operational Research, Elsevier, vol. 271(2), pages 676-696.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Sohner, Volkmar & Schneeweiss, Christoph, 1995. "Hierarchically integrated lot size optimization," European Journal of Operational Research, Elsevier, vol. 86(1), pages 73-90, October.
    8. Pradhan, Salil & Damodaran, Purushothaman & Srihari, Krishnaswami, 2008. "Predicting performance measures for Markovian type of manufacturing systems with product failures," European Journal of Operational Research, Elsevier, vol. 184(2), pages 725-744, January.
    9. Kumar Satyam & Ananth Krishnamurthy, 2013. "Performance analysis of CONWIP systems with batch size constraints," Annals of Operations Research, Springer, vol. 209(1), pages 85-114, October.
    10. Kris Lieckens & Nico Vandaele, 2016. "Differential evolution to solve the lot size problem in stochastic supply chain management systems," Annals of Operations Research, Springer, vol. 242(2), pages 239-263, July.
    11. Dasu, Sriram, 1998. "Class dependent departure process from multiclass phase queues: Exact and approximate analyses," European Journal of Operational Research, Elsevier, vol. 108(2), pages 379-404, July.
    12. Yang, Feng, 2010. "Neural network metamodeling for cycle time-throughput profiles in manufacturing," European Journal of Operational Research, Elsevier, vol. 205(1), pages 172-185, August.
    13. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    14. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    15. Kavusturucu, Ayse & Gupta, Surendra M., 1999. "Manufacturing systems with machine vacations, arbitrary topology and finite buffers," International Journal of Production Economics, Elsevier, vol. 58(1), pages 1-15, January.
    16. Miltenburg, John & Sparling, David, 1996. "Managing and reducing total cycle time: models and analysis," International Journal of Production Economics, Elsevier, vol. 46(1), pages 89-108, December.
    17. Kurt M. Bretthauer, 2000. "Optimal service and arrival rates in Jackson queueing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 1-17, February.
    18. Bitran, Gabriel R. & Morabito, Reinaldo., 1995. "Manufacturing system design : tradeoff curve analysis," Working papers 3805-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    19. Opher Baron & Antonis Economou & Athanasia Manou, 2018. "The state-dependent M / G / 1 queue with orbit," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 89-123, October.
    20. Liming Liu & Xiaoming Liu & David D. Yao, 2004. "Analysis and Optimization of a Multistage Inventory-Queue System," Management Science, INFORMS, vol. 50(3), pages 365-380, March.

    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:oropre:v:59:y:2011:i:2:p:480-497. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.