IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v23y2021i1d10.1007_s11009-020-09836-4.html
   My bibliography  Save this article

A New and Pragmatic Approach to the GIX/Geo/c/N Queues Using Roots

Author

Listed:
  • J. J. Kim

    (Royal Military College of Canada)

  • M. L. Chaudhry

    (Royal Military College of Canada)

  • V. Goswami

    (Kalinga Institute of Industrial Technology)

  • A. D. Banik

    (Indian Institute of Technology Bhubaneswar)

Abstract

A simple and complete solution to determine the distributions of queue lengths at different observation epochs for the model GIX/Geo/c/N is presented. In the past, various discrete-time queueing models, particularly the multi-server bulk-arrival queues with finite-buffer have been solved using complicated methods that lead to results in a non-explicit form. The purpose of this paper is to present a simple derivation for the model GIX/Geo/c/N that leads to a complete solution in an explicit form. The same method can also be used to solve the GIX/Geo/c/N queues with heavy-tailed inter-batch-arrival time distributions. The roots of the underlying characteristic equation form the basis for all distributions of queue lengths at different time epochs. All queue-length distributions are in the form of sums of geometric terms.

Suggested Citation

  • J. J. Kim & M. L. Chaudhry & V. Goswami & A. D. Banik, 2021. "A New and Pragmatic Approach to the GIX/Geo/c/N Queues Using Roots," Methodology and Computing in Applied Probability, Springer, vol. 23(1), pages 273-289, March.
    • Handle: RePEc:spr:metcap:v:23:y:2021:i:1:d:10.1007_s11009-020-09836-4
    DOI: 10.1007/s11009-020-09836-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-020-09836-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-020-09836-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Arunava Maity & U. C. Gupta, 2015. "A Comparative Numerical Study of the Spectral Theory Approach of Nishimura and the Roots Method Based on the Analysis of BDMMAP/G/1 Queue," International Journal of Stochastic Analysis, Hindawi, vol. 2015, pages 1-9, February.
    2. M. L. Chaudhry & U. C. Gupta & V. Goswami, 2001. "Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GI X /Geom/m," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 172-180, August.
    3. Mohan L. Chaudhry & James J. Kim, 2016. "Analytically elegant and computationally efficient results in terms of roots for the $$GI^{X}/M/c$$ G I X / M / c queueing system," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 237-257, February.
    4. Carl M. Harris & Percy H. Brill & Martin J. Fischer, 2000. "Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 261-271, November.
    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. Michiel De Muynck & Herwig Bruneel & Sabine Wittevrongel, 2023. "Analysis of a Queue with General Service Demands and Multiple Servers with Variable Service Capacities," Mathematics, MDPI, vol. 11(4), pages 1-21, February.

    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. James J. Kim & Douglas G. Down & Mohan Chaudhry & Abhijit Datta Banik, 2022. "Difference Equations Approach for Multi-Server Queueing Models with Removable Servers," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1297-1321, September.
    2. Peixia Gao & Sabine Wittevrongel & Joris Walraevens & Herwig Bruneel, 2008. "Analytic study of multiserver buffers with two-state Markovian arrivals and constant service times of multiple slots," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 269-284, April.
    3. F. P. Barbhuiya & U. C. Gupta, 2019. "Discrete-time queue with batch renewal input and random serving capacity rule: $$GI^X/ Geo^Y/1$$ G I X / G e o Y / 1," Queueing Systems: Theory and Applications, Springer, vol. 91(3), pages 347-365, April.
    4. Seok Ho Chang & Dae Won Choi, 2006. "Modeling and Performance Analysis of a Finite-Buffer Queue with Batch Arrivals, Batch Services, and Setup Times: The M X /G Y /1/K + B Queue with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 218-228, May.
    5. Ramírez Cobo, Josefa & Wilson, Simon P., 2008. "Inference for double Pareto lognormal queues with applications," DES - Working Papers. Statistics and Econometrics. WS ws080402, Universidad Carlos III de Madrid. Departamento de Estadística.
    6. Miaomiao Yu & Yinghui Tang, 2018. "Analysis of the Sojourn Time Distribution for M/GL/1 Queue with Bulk-Service of Exactly Size L," Methodology and Computing in Applied Probability, Springer, vol. 20(4), pages 1503-1514, December.
    7. John F. Shortle & Martin J. Fischer & Percy H. Brill, 2007. "Waiting-Time Distribution of M/D N /1 Queues Through Numerical Laplace Inversion," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 112-120, February.
    8. John F. Shortle & Percy H. Brill & Martin J. Fischer & Donald Gross & Denise M. B. Masi, 2004. "An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 152-161, May.

    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:spr:metcap:v:23:y:2021:i:1:d:10.1007_s11009-020-09836-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.