Skip to main content
Log in

Computational analysis of single-server bulk-arrival queues: GIX/M/1

  • Short Communications
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper deals with numerical computations for the bulk-arrival queueing modelGI X/M/1. First an algorithm is developed to find the roots inside the unit circle of the characteristic equation for this model. These roots are then used to calculate both the moments and the steady-state distribution of the number of customers in the system at a pre-arrival epoch. These results are used to compute the distribution of the same random variable at post-departure and random epochs. Unifying the method used by Easton [7], we have extended its application to the special cases where the interarrival time distribution is deterministic or uniform, and to cases whereX has a given arbitrary distribution. We also improved on the various root-finding methods used by several previous authors so that high values of the parameters, in particular large batch sizes, can be investigated as well.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. G. Brère and M.L. Chaudhry, Computational analysis of single-server bulk-arrival queuesMX/G/1. Paper presented at EURO VII, Bologna (1985).

  2. M.L. Chaudhry, J.L. Jain and J.G.C. Templeton, Numerical analysis for bulk-arrival queueing systems: root-finding and steady-state probabilities in GIr/M/1 queues, Ann. Oper. Res. 8(1987)307.

    Google Scholar 

  3. M.L. Chaudhry, B.R. Madill and G. Brière, Computational analysis of steady-state probabilities of M/Ga,b/1 and related non-bulk queues, Queueing Systems 2(1987)93.

    Google Scholar 

  4. M.L. Chaudhry and B.R.K. Kashyap, unpublished results (1986).

  5. M.L. Chaudhry and J.G.C. Templeton,A First Course in Bulk Queues (Wiley, New York, 1983).

    Google Scholar 

  6. S.D. Conte and C. DeBoor,Elementary Numerical Analysis (McGraw-Hill, New York, 1972).

    Google Scholar 

  7. G.D. Easton, Contributions to the analysis of some bulk-queueing systems, M.Sc. Thesis, Royal Military College of Canada, Kingston, Ontario (1981).

    Google Scholar 

  8. W.K. Grassmann and M.L. Chaudhry, A new method to solve steady-state queueing equations, Naval Res. Log. Quart. 29(1982)461.

    Google Scholar 

  9. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (The Johns Hopkins University Press, Baltimore, 1981).

    Google Scholar 

  10. W.B. Powell, Analysis of vehicle holding and cancellation strategies in bulk arrival, bulk service queues, Transportation Sci. 19(1985)352.

    Google Scholar 

  11. W.B. Powell, Iterative algorithms for bulk arrival, bulk service queues with Poisson and non-Poisson arrivals, Transportation Sci. 20(1986)65.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brière, G., Chaudhry, M.L. Computational analysis of single-server bulk-arrival queues: GIX/M/1. Queueing Syst 2, 173–185 (1987). https://doi.org/10.1007/BF01158398

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158398

Keywords

Navigation