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

On Two Interacting Markovian Queueing Systems

Author

Listed:
  • Valeriy A. Naumov

    (Service Innovation Research Institute, 8 A Annankatu, Helsinki 00120, Finland)

  • Yuliya V. Gaidamaka

    (Department of Applied Informatics and Probability, Peoples’ Friendship University of Russia (RUDN University), Miklukho-Maklaya St. 6, Moscow 117198, Russian
    Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, Vavilov St. 44-2, Moscow 119333, Russian)

  • Konstantin E. Samouylov

    (Department of Applied Informatics and Probability, Peoples’ Friendship University of Russia (RUDN University), Miklukho-Maklaya St. 6, Moscow 117198, Russian
    Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, Vavilov St. 44-2, Moscow 119333, Russian)

Abstract

In this paper, we study a Markovian queuing system consisting of two subsystems of an arbitrary structure. Each subsystem generates a multi-class Markovian arrival process of customers arriving to the other subsystem. We derive the necessary and sufficient conditions for the stationary distribution to be of product form and consider some particular cases of the subsystem interaction for which these conditions can be easily verified.

Suggested Citation

  • Valeriy A. Naumov & Yuliya V. Gaidamaka & Konstantin E. Samouylov, 2019. "On Two Interacting Markovian Queueing Systems," Mathematics, MDPI, vol. 7(9), pages 1-12, September.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:9:p:799-:d:262935
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/9/799/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/9/799/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Gely Basharin & Valeriy Naumov & Konstantin Samouylov, 2018. "On Markovian modelling of arrival processes," Statistical Papers, Springer, vol. 59(4), pages 1533-1540, December.
    2. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    3. Xiuli Chao, 2011. "Networks with Customers, Signals, and Product Form Solution," International Series in Operations Research & Management Science, in: Richard J. Boucherie & Nico M. Dijk (ed.), Queueing Networks, chapter 0, pages 217-267, Springer.
    4. William J. Gordon & Gordon F. Newell, 1967. "Closed Queuing Systems with Exponential Servers," Operations Research, INFORMS, vol. 15(2), pages 254-265, April.
    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. Nico Dijk & Barteld Schilstra, 2022. "On two product form modifications for finite overflow systems," Annals of Operations Research, Springer, vol. 310(2), pages 519-549, March.
    2. Daisik Nam & Minyoung Park, 2020. "Improving the Operational Efficiency of Parcel Delivery Network with a Bi-Level Decision Making Model," Sustainability, MDPI, vol. 12(19), pages 1-19, September.
    3. J. P. van der Gaast & M. B. M. de Koster & I. J. B. F. Adan, 2018. "Conveyor Merges in Zone Picking Systems: A Tractable and Accurate Approximate Model," Service Science, INFORMS, vol. 52(6), pages 1428-1443, December.
    4. Shuji Kijima & Tomomi Matsui, 2008. "Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers," Annals of Operations Research, Springer, vol. 162(1), pages 35-55, September.
    5. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    6. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    7. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    8. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    9. Sahba, Pedram & BalcIog[small tilde]lu, BarIs, 2011. "The impact of transportation delays on repairshop capacity pooling and spare part inventories," European Journal of Operational Research, Elsevier, vol. 214(3), pages 674-682, November.
    10. 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.
    11. Girish, Muckai K. & Hu, Jian-Qiang, 2000. "Higher order approximations for the single server queue with splitting, merging and feedback," European Journal of Operational Research, Elsevier, vol. 124(3), pages 447-467, August.
    12. van Ackere, Ann, 1995. "Capacity management: Pricing strategy, performance and the role of information," International Journal of Production Economics, Elsevier, vol. 40(1), pages 89-100, June.
    13. Sauer Cornelia & Daduna Hans, 2003. "Availability Formulas and Performance Measures for Separable Degradable Networks," Stochastics and Quality Control, De Gruyter, vol. 18(2), pages 165-194, January.
    14. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    15. 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.
    16. 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.
    17. Lin, Yu-Hsin & Lee, Ching-En, 2001. "A total standard WIP estimation method for wafer fabrication," European Journal of Operational Research, Elsevier, vol. 131(1), pages 78-94, May.
    18. Jonatha Anselmi & Bernardo D'Auria & Neil Walton, 2013. "Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 469-491, August.
    19. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    20. John S. Hollywood, 2005. "An approximate planning model for distributed computing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 590-605, 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:gam:jmathe:v:7:y:2019:i:9:p:799-:d:262935. 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.