Skip to main content Accessibility help
×
×
Home

q-SERIES IN MARKOV CHAINS WITH BINOMIAL TRANSITIONS: STUDYING A QUEUE WITH SYNCHRONIZATION

  • Antonis Economou (a1) and Stella Kapodistria (a1)

Abstract

We consider a single-server Markovian queue with synchronized services and setup times. The customers arrive according to a Poisson process and are served simultaneously. The service times are independent and exponentially distributed. At a service completion epoch, every customer remains satisfied with probability p (independently of the others) and departs from the system; otherwise, he stays for a new service. Moreover, the server takes multiple vacations whenever the system is empty.

Some of the transition rates of the underlying two-dimensional Markov chain involve binomial coefficients dependent on the number of customers. Indeed, at each service completion epoch, the number of customers n is reduced according to a binomial (n, p) distribution. We show that the model can be efficiently studied using the framework of q-hypergeometric series and we carry out an extensive analysis including the stationary, the busy period, and the sojourn time distributions. Exact formulas and numerical results show the effect of the level of synchronization to the performance of such systems.

Copyright

References

Hide All
1.Abate, J., Choudhury, G.L., & Whitt, W. (2000). An introduction to numerical transform inversion and its application to probability models. In Grassmann, W.K. (ed.), Computational probability. Boston: Kluwer Academic Publishers, pp. 257323.
2.Adan, I.J.B.F. (1991). A compensation approach for queueing problems, doctoral dissertation, Technische Universiteit Eindhoven, Eindhoven.
3.Ahlfors, L.V. (1979). Complex analysis, 3rd ed.Singapore: McGraw-Hill.
4.Altman, E. & Yechiali, U. (2006). Analysis of customers' impatience in queues with server vacations. Queueing Systems 52: 261279.
5.Artalejo, J.R., Economou, A., & Lopez-Herrero, M.J. (2007). Evaluating growth measures in populations subject to binomial and geometric catastrophes. Mathematical Biosciences and Engineering 4: 573594.
6.Artalejo, J.R. & Gomez-Corral, A. (1997). Steady state solution of a single-server queue with linear repeated requests. Journal of Applied Probability 34: 223233.
7.Artalejo, J.R. & Pozo, M. (2002). Numerical calculation of the stationary distribution of the main multiserver retrial queue. Annals of Operations Research 116: 4156.
8.Baykal-Gursoy, M. & Xiao, W. (2004). Stochastic decomposition in M/M/∞ queues with Markov modulated service rates. Queueing Systems 48: 7588.
9.Bini, D.A., Latouche, G., & Meini, B. (2005). Numerical methods for structured Markov chains. New York: Oxford Science Publications.
10.Brockwell, P.J., Gani, J., & Resnick, S.I. (1982). Birth, immigration and catastrophe processes. Advances in Applied Probability 14: 709731.
11.Cohen, J.W. & Boxma, O.J. (1983). Boundary value problems in queueing system analysis. North-Holland Mathematics Studies 79. Amsterdam: North-Holland.
12.Economou, A. (2004). The compound Poisson immigration process subject to binomial catastrophes. Journal of Applied Probability 41: 508523.
13.Gail, H.R., Hantler, S.L., & Taylor, B.A. (2000). Use of characteristics roots for solving infinite state Markov chains. In Grassmann, W.K. (ed.), Computational probability. Boston: Kluwer Academic Publishers, pp. 205255.
14.Gasper, G. & Rahman, M. (2004). Basic hypergeometric series, 2nd ed.Cambridge: Cambridge University Press.
15.Grassmann, W.K. (2002). Real eigenvalues of certain tridiagonal matrix polynomials, with queueing applications. Journal of Linear Algebra and its Applications 342: 93106.
16.Ismail, M.E.H. (1985). A queueing model and a set of orthogonal polynomials. Journal of Mathematical Analysis and Applications 108: 575594.
17.Keilson, J. & Servi, L.D. (1993). The matrix M/M/∞ system: retrial models and Markov modulated sources. Advances in Applied Probability 25: 453471.
18.Kemp, A.W. (1992). Steady-state Markov chain models for the Heine and Euler distributions. Journal of Applied Probability 29: 869876.
19.Kemp, A.W. (1998). Absorption sampling and absorption distribution. Journal of Applied Probability 35: 489494.
20.Kemp, A.W. (2005). Steady-state Markov chain models for certain q-confluent hypergeometric distributions. Journal of Statistical Planning and Inference 135: 107120.
21.Kemp, A.W. & Newton, J. (1990). Certain state-dependent processes for dichotomised parasite populations. Journal of Applied Probability 27: 251258.
22.Krantz, S.G. (1999). Handbook of complex variables. Boston: Birkhanser.
23.Krishnamoorthy, A., Deepak, T.G., & Joshua, V.C. (2005). An M/G/1 retrial queue with nonpersistent customers and orbital search. Stochastic Analysis and Applications 23: 975997.
24.Kroese, D.P., Scheinhardt, W.R.W., & Taylor, P.G. (2004). Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process. Annals of Applied Probability 14: 20572089.
25.Latouche, G. & Ramaswami, V. (1999). Introduction to matrix-analytic methods in stochastic modeling. ASA-SIAM Series on Statistics and Applied Probability. Philadelphia: SIAM.
26.Mitrani, I. & Chakka, R. (1995). Spectral expansion solution for a class of Markov models: Application and comparison with the matrix-geometric method. Performance Evaluation 23: 241260.
27.Neuts, M.F. (1981). Matrix-geometric solutions in stochastic models: An algorithmic approach. Baltimore, MD: Johns Hopkins University Press.
28.Neuts, M.F. (1989). Structured stochastic matrices of M/G/1 type and their applications. New York: Marcel Dekker.
29.Neuts, M.F. (1994). An interesting random walk on the nonnegative integers. Journal of Applied Probability 31: 4858.
30.Takagi, H. (1991). Queueing analysis: A foundation of performance evaluation. Vol. 1: Vacation and priority systems. Amsterdam: North-Holland.
31.Tian, N. & Zhang, Z.G. (2006). Vacation queueing models. Theory and applications. New York: Springer.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Probability in the Engineering and Informational Sciences
  • ISSN: 0269-9648
  • EISSN: 1469-8951
  • URL: /core/journals/probability-in-the-engineering-and-informational-sciences
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed