Advertisement

Queueing Systems

, Volume 42, Issue 1, pp 5–31 | Cite as

A Multi-Server Retrial Queue with BMAP Arrivals and Group Services

  • Srinivas R. Chakravarthy
  • Alexander N. Dudin
Article

Abstract

In this paper, we consider a c-server queuing model in which customers arrive according to a batch Markovian arrival process (BMAP). These customers are served in groups of varying sizes ranging from a predetermined value L through a maximum size, K. The service times are exponentially distributed. Any customer not entering into service immediately orbit in an infinite space. These orbiting customers compete for service by sending out signals that are exponentially distributed with parameter θ. Under a full access policy freed servers offer services to orbiting customers in groups of varying sizes. This multi-server retrial queue under the full access policy is a QBD process and the steady state analysis of the model is performed by exploiting the structure of the coefficient matrices. Some interesting numerical examples are discussed.

batch Markovian arrival process retrials algorithmic probability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.R. Artalejo, Accessible bibliography on retrial queues, Math. Comput. Modelling 30 (1999) 1-6.Google Scholar
  2. [2]
    J.R. Artalejo, A classified bibliograph of research on retrial queues: Progress in 1990-1999, TOP 7 (1999) 187-211.Google Scholar
  3. [3]
    J.R. Artalejo, A. Gomez-Corral and M.F. Neuts, Numerical analysis of multiserver retrial queues operating under a full access policy, in: Advances in Algorithmic Methods for Stochastic Models, eds. G. Latouche and P.G. Taylor (Notable Publications, NJ, 2000) pp. 1-19.Google Scholar
  4. [4]
    R.E. Bellman, Introduction to Matrix Analysis (McGraw-Hill, New York, 1960).Google Scholar
  5. [5]
    S. Chakravarthy, A finite capacity GI/PH/1 queue with group services, Naval Res. Logistics Quart. 39 (1992) 345-357.Google Scholar
  6. [6]
    S. Chakravarthy, Analysis of a finite MAP/G/1 queue with group services, Queueing Systems 13 (1993) 385-407.Google Scholar
  7. [7]
    S. Chakravarthy, A finite capacity queueing network with single and multiple processing nodes, in: Queueing Network with Finite Capacity, eds R.F. Onvural and I.F. Akyildiz (North-Holland, Amsterdam, 1993) pp. 197-211.Google Scholar
  8. [8]
    S. Chakravarthy, Two finite queues in series with nonrenewal input and group services, in: Proc. of the 7th Internat. Symposium on Applied Stochastic Models and Data Analysis, 1995, pp. 78-87.Google Scholar
  9. [9]
    S. Chakravarthy, Analysis of the MAP/PH/1/K queue with service control, Appl. Stochastic Models Data Anal. 12 (1996) 179-191.Google Scholar
  10. [10]
    S.R. Chakravarthy, Analysis of a priority polling system with group services, Stochastic Models 14 (1998) 25-49.Google Scholar
  11. [11]
    S.R. Chakravarthy, Analysis of a multi-server queue with batch Markovian arrivals and group services, Engrg. Simulation 18 (2000) 51-66.Google Scholar
  12. [12]
    S.R. Chakravarthy, The batch Markovian arrival process: A review and future work, in: Advances in Probability Theory and Stochastic Processes, eds. A. Krishnamoorthy et al. (Notable Publications, NJ, 2000) pp. 21-39.Google Scholar
  13. [13]
    S. Chakravarthy and A.S. Alfa, A finite capacity queue with Markovian arrivals and two servers with group services, J. Appl. Math. Stochastic Anal. 7 (1994) 161-178.Google Scholar
  14. [14]
    S. Chakravarthy and L. Bin, A finite capacity queue with nonrenewal input and exponential dynamic group services, INFORMS J. Computing 9 (1997) 276-287.Google Scholar
  15. [15]
    S. Chakravarthy and S.Y. Lee, An optimization problem in a finite capacity PH/PH/1 queue with group services, in: Stochastic Models, Optimization Techniques and Computer Applications, eds. G.V. Krishna Reddy et al. (Wiley Eastern Limited, New Delhi, 1994) pp. 3-13.Google Scholar
  16. [16]
    B.D. Choi, Y.H. Chung and A.N. Dudin, The BMAP/SM/1 retrial queue with controllable operation modes, European J. Oper. Res. 131 (2001) 16-30.Google Scholar
  17. [17]
    A. Dudin and V. Klimenok, Queueing system BMAP/G/1 with repeated calls, Math. Comput. Modelling 30 (1999) 115-128.Google Scholar
  18. [18]
    A. Dudin and V. Klimenok, A Retrial BMAP/SM/1 system with linear repeated requests, Queueing Systems 34 (2000) 47-66.Google Scholar
  19. [19]
    G.I. Falin, A survey of retrial queues, Queueing Systems 7 (1990) 127-167.Google Scholar
  20. [20]
    G.I. Falin and J.G.C. Templeton, Retrial Queues (Chapman and Hall, London, 1997).Google Scholar
  21. [21]
    G. Fayolle, A simple telephone exchange with delayed feedbacks, in: Teletraffic Analysis and Computer Performance Evaluation, eds. O.J. Boxma et al. (Elsevier Science, Amsterdam, 1986).Google Scholar
  22. [22]
    A. Gomez-Corral and M.F. Ramalhoto, On the stationary distribution of a Markovian process arising in the theory of multiserver retrial queueing systems, Math. Comput. Modelling 30 (1999) 141-158.Google Scholar
  23. [23]
    A. Gomez-Corral, Stochastic analysis of a single-server retrial queue with general retrial times, Naval Res. Logistics 46 (1999) 561-581.Google Scholar
  24. [24]
    D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7 (1991) 1-46.Google Scholar
  25. [25]
    M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models-An Algorithmic Approach (Dover, New York, 1995); originally published by (Johns Hopkins Univ. Press, Baltimore, MD, 1981).Google Scholar
  26. [26]
    M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).Google Scholar
  27. [27]
    M.F. Neuts and B.M. Rao, Numerical investigation of a multiserver retrial queue, Queueing Systems 7 (1990) 169-190.Google Scholar
  28. [28]
    T. Yang and J.G. Templeton, A survey on retrial queues, Queueing Systems 2 (1987) 201-233.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Srinivas R. Chakravarthy
    • 1
  • Alexander N. Dudin
    • 2
  1. 1.Department of Industrial and Manufacturing Engineering and BusinessKettering UniversityFlintUSA
  2. 2.Department of Applied Mathematics and Computer ScienceBelarussian State UniversityMinskBelarus

Personalised recommendations