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

Matrix Approach for Analyzing n -Site Generalized ASIP Systems: PGF and Site Occupancy Probabilities

Author

Listed:
  • Uri Yechiali

    (Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Tel Aviv 6329302, Israel)

  • Yaron Yeger

    (Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Tel Aviv 6329302, Israel)

Abstract

The Asymmetric Simple Inclusion Process (ASIP) is an n -site tandem stochastic network with a Poisson arrival influx into the first site. Each site has an unlimited buffer with a gate in front of it. Each gate opens, independently of all other gates, following a site-dependent Exponential inter-opening time. When a site’s gate opens, all particles occupying the site move simultaneously to the next site. In this paper, a Generalized ASIP network is analyzed where the influx is to all sites, while gate openings are determined by a general renewal process. A compact matrix approach—instead of the conventional (and tedious) successive substitution method—is constructed for the derivation of the multidimensional probability-generating function (PGF) of the site occupancies. It is shown that the set of ( 2 n n ) linear equations required to obtain the PGF of an n -site network can be first cut by half into a set of 2 n − 1 n equations, and then further reduced to a set of 2 n − n + 1 equations. The latter set can be additionally split into several smaller triangular subsets. It is also shown how the PGF of an n + 1 -site network can be derived from the corresponding PGF of an n -site system. Explicit results for networks with n = 3 and n = 4 sites are obtained. The matrix approach is utilized to explicitly calculate the probability that site k k = 1 , 2 , … , n is occupied. We show that, in the case where arrivals occur to the first site only, these probabilities are functions of both the site’s index and the arrival flux and not solely of the site’s index. Consequently, refined formulas for the latter probabilities and for the mean conditional site occupancies are derived. We further show that in the case where the arrival process to the first site is Poisson with rate λ , the following interesting property holds: P s i t e k i s o c c u p i e d | λ = 1 = P s i t e k + 1 i s o c c u p i e d | λ → ∞ . The case where the inter-gate opening intervals are Gamma distributed is investigated and explicit formulas are obtained. Mean site occupancy and mean total load of the first k sites are calculated. Numerical results are presented.

Suggested Citation

  • Uri Yechiali & Yaron Yeger, 2022. "Matrix Approach for Analyzing n -Site Generalized ASIP Systems: PGF and Site Occupancy Probabilities," Mathematics, MDPI, vol. 10(23), pages 1-33, December.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4624-:d:995228
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/23/4624/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/23/4624/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yaron Yeger & Uri Yechiali, 2022. "Performance Measures in a Generalized Asymmetric Simple Inclusion Process," Mathematics, MDPI, vol. 10(4), pages 1-25, February.
    2. Onno Boxma & Offer Kella & Uri Yechiali, 2016. "An ASIP model with general gate opening intervals," Queueing Systems: Theory and Applications, Springer, vol. 84(1), pages 1-20, October.
    3. James R. Jackson, 1957. "Networks of Waiting Lines," Operations Research, INFORMS, vol. 5(4), pages 518-521, August.
    4. Onno Boxma & Offer Kella & Uri Yechiali, 2021. "Workload distributions in ASIP queueing networks," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 81-100, February.
    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. Yaron Yeger & Uri Yechiali, 2022. "Performance Measures in a Generalized Asymmetric Simple Inclusion Process," Mathematics, MDPI, vol. 10(4), pages 1-25, February.
    2. Jennifer Sommer & Joost Berkhout & Hans Daduna & Bernd Heidergott, 2017. "Analysis of Jackson networks with infinite supply and unreliable nodes," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 181-207, October.
    3. Amarjit Budhiraja & Chihoon Lee, 2009. "Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 45-56, February.
    4. Rosario Delgado, 2010. "State space collapse and stability of queueing networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 477-499, December.
    5. Ward Whitt & Wei You, 2022. "New decomposition approximations for queueing networks," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 365-367, April.
    6. 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.
    7. 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.
    8. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    9. Anthony Ebert & Ritabrata Dutta & Kerrie Mengersen & Antonietta Mira & Fabrizio Ruggeri & Paul Wu, 2021. "Likelihood‐free parameter estimation for dynamic queueing networks: Case study of passenger flow in an international airport terminal," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 70(3), pages 770-792, June.
    10. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    11. Mohammadi Bidhandi, Hadi & Patrick, Jonathan & Noghani, Pedram & Varshoei, Peyman, 2019. "Capacity planning for a network of community health services," European Journal of Operational Research, Elsevier, vol. 275(1), pages 266-279.
    12. Pavel Bocharov & Ciro D’Apice & Alexandre Pechinkin, 2006. "Product form solution for exponential G-networks with dependent service and completion of service of killed customers," Computational Management Science, Springer, vol. 3(3), pages 177-192, July.
    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. 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.
    16. 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.
    17. Li, Yongli & Gao, Xin & Xu, Zhiwei & Zhou, Xuanrui, 2018. "Network-based queuing model for simulating passenger throughput at an airport security checkpoint," Journal of Air Transport Management, Elsevier, vol. 66(C), pages 13-24.
    18. Dijk, N.M. van, 1988. "Closed queueing networks with batch services," Serie Research Memoranda 0050, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    19. 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.
    20. Ward Whitt & Wei You, 2020. "Heavy-traffic limits for stationary network flows," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 53-68, June.

    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:10:y:2022:i:23:p:4624-:d:995228. 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.