IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i14p2202-d1434504.html
   My bibliography  Save this article

Regenerative Analysis and Approximation of Queueing Systems with Superposed Input Processes

Author

Listed:
  • Irina Peshkova

    (Department of Applied Mathematics and Cybernetics, Petrozavodsk State University, Lenin str. 33, 185910 Petrozavodsk, Russia
    These authors contributed equally to this work.)

  • Evsey Morozov

    (Department of Applied Mathematics and Cybernetics, Petrozavodsk State University, Lenin str. 33, 185910 Petrozavodsk, Russia
    Institute of Applied Mathematical Research, Karelian Research Centre of Russian Academy of Sciences, Pushkinskaja str. 11, 185910 Petrozavodsk, Russia
    Moscow Center for Fundamental and Applied Mathematics, Lomonosov Moscow State University, GSP-1, Leninskie Gory, 119991 Moscow, Russia
    These authors contributed equally to this work.)

  • Michele Pagano

    (Department of Information Engineering, University of Pisa, Via G. Caruso 16, 56122 Pisa, Italy
    These authors contributed equally to this work.)

Abstract

A single-server queueing system with n classes of customers, stationary superposed input processes, and general class-dependent service times is considered. An exponential splitting is proposed to construct classical regeneration in this (originally non-regenerative) system, provided that the component processes have heavy-tailed interarrival times. In particular, we focus on input processes with Pareto interarrival times. Moreover, an approximating G I / G / 1 -type system is considered, in which the independent identically distributed interarrival times follow the stationary Palm distribution corresponding to the stationary superposed input process. Finally, Monte Carlo and regenerative simulation techniques are applied to estimate and compare the stationary waiting time of a customer in the original and in the approximating systems, as well as to derive additional information on the regeneration cycles’ structure.

Suggested Citation

  • Irina Peshkova & Evsey Morozov & Michele Pagano, 2024. "Regenerative Analysis and Approximation of Queueing Systems with Superposed Input Processes," Mathematics, MDPI, vol. 12(14), pages 1-22, July.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:14:p:2202-:d:1434504
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/14/2202/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/14/2202/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. S. L. Albin, 1982. "On Poisson Approximations for Superposition Arrival Processes in Queues," Management Science, INFORMS, vol. 28(2), pages 126-137, February.
    2. Whitt, Ward, 1985. "Queues with superposition arrival processes in heavy traffic," Stochastic Processes and their Applications, Elsevier, vol. 21(1), pages 81-91, December.
    3. G. F. Newell, 1984. "Approximations for Superposition Arrival Processes in Queues," Management Science, INFORMS, vol. 30(5), pages 623-632, May.
    4. Karl Sigman, 1990. "One-Dependent Regenerative Processes and Queues in Continuous Time," Mathematics of Operations Research, INFORMS, vol. 15(1), pages 175-189, February.
    5. Thorisson, Hermann, 1985. "The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergence," Stochastic Processes and their Applications, Elsevier, vol. 19(1), pages 85-99, February.
    6. Peter W. Glynn & Donald L. Iglehart, 1993. "Notes: Conditions for the Applicability of the Regenerative Method," Management Science, INFORMS, vol. 39(9), pages 1108-1111, September.
    Full references (including those not matched with items on IDEAS)

    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. Sunkyo Kim, 2024. "The superposition of Markovian arrival processes: moments and the minimal Laplace transform," Annals of Operations Research, Springer, vol. 335(1), pages 237-259, April.
    2. Hill, R.M. & Seifbarghy, M. & Smith, D.K., 2007. "A two-echelon inventory model with lost sales," European Journal of Operational Research, Elsevier, vol. 181(2), pages 753-766, September.
    3. S. Rajagopalan, 2002. "Make to Order or Make to Stock: Model and Application," Management Science, INFORMS, vol. 48(2), pages 241-256, February.
    4. Shane G. Henderson & Peter W. Glynn, 1999. "Derandomizing Variance Estimators," Operations Research, INFORMS, vol. 47(6), pages 907-916, December.
    5. 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.
    6. M. Rosário Moreira & Rui Alves, 2006. "Does Order Negotiation Improve The Job-Shop Workload Control?," FEP Working Papers 213, Universidade do Porto, Faculdade de Economia do Porto.
    7. Thangam, A. & Uthayakumar, R., 2008. "A two-level supply chain with partial backordering and approximated Poisson demand," European Journal of Operational Research, Elsevier, vol. 187(1), pages 228-242, May.
    8. Hau L. Lee & Kamran Moinzadeh, 1987. "Operating characteristics of a two‐echelon inventory system for repairable and consumable items under batch ordering and shipment policy," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 365-380, June.
    9. T. P. I. Ahamed & V. S. Borkar & S. Juneja, 2006. "Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation," Operations Research, INFORMS, vol. 54(3), pages 489-504, June.
    10. Konstantin Avrachenkov & Evsey Morozov, 2014. "Stability analysis of GI/GI/c/K retrial queue with constant retrial rate," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 79(3), pages 273-291, June.
    11. Sarang Deo & Milind Sohoni, 2015. "Optimal Decentralization of Early Infant Diagnosis of HIV in Resource-Limited Settings," Manufacturing & Service Operations Management, INFORMS, vol. 17(2), pages 191-207, May.
    12. A. Korhan Aras & Xinyun Chen & Yunan Liu, 2018. "Many-server Gaussian limits for overloaded non-Markovian queues with customer abandonment," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 81-125, June.
    13. Olsson, Ralph J. & Hill, Roger M., 2007. "A two-echelon base-stock inventory model with Poisson demand and the sequential processing of orders at the upper echelon," European Journal of Operational Research, Elsevier, vol. 177(1), pages 310-324, February.
    14. Xiaowei Zhang & Peter W. Glynn, 2018. "Affine Jump-Diffusions: Stochastic Stability and Limit Theorems," Papers 1811.00122, arXiv.org.
    15. L. Dai, 1999. "Effective Bandwidths and Performance Bounds in High-Speed Communication Systems," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 549-574, March.
    16. Glynn, Peter & Sigman, Karl, 1998. "Independent sampling of a stochastic process," Stochastic Processes and their Applications, Elsevier, vol. 74(2), pages 151-164, June.
    17. Alexander Veretennikov, 2023. "On Positive Recurrence of the M n / GI /1/ ∞ Model," Mathematics, MDPI, vol. 11(21), pages 1-18, November.
    18. Bitran, Gabriel R. & Morabito, Reinaldo., 1994. "Open queueing networks : optimization and performance evaluation models for discrete manufacturing systems," Working papers 3743-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    19. 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.
    20. Ananth. V. Iyer, 2002. "Inventory cost impact of order processing priorities based on demand uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(4), pages 376-390, June.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:gam:jmathe:v:12:y:2024:i:14:p:2202-:d:1434504. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.