q-SERIES IN MARKOV CHAINS WITH BINOMIAL TRANSITIONS

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.

[1]  Marcel F. Neuts.  AN INTERESTING RANDOM WALK ON THE NON-NEGATIVE INTEGERS , 1994 .

[2]  Absorption sampling and the absorption distribution , 1998 .

[3]  A. W. Kemp,et al.  Steady-state Markov chain models for certain q-confluent hypergeometric distributions , 2005 .

[4]  M. Schlosser.  BASIC HYPERGEOMETRIC SERIES , 2007 .

[5]  Jesus R. Artalejo,et al.  Numerical Calculation of the Stationary Distribution of the Main Multiserver Retrial Queue , 2002, Ann. Oper. Res..

[6]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[7]  J R Artalejo,et al.  Evaluating growth measures in an immigration process subject to binomial and geometric catastrophes. , 2007, Mathematical biosciences and engineering : MBE.

[8]  Ward Whitt,et al.  An Introduction to Numerical Transform Inversion and Its Application to Probability Models , 2000 .

[9]  Hideaki Takagi.  Queueing analysis A foundation of Performance Evaluation Volume 1: Vacation and priority systems , 1991 .

[10]  Sidney L. Hantler,et al.  Use of Characteristic Roots for Solving Infinite State Markov Chains , 2000 .

[11]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[12]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[13]  Julian Keilson,et al.  The matrix M/M/∞ system: retrial models and Markov modulated sources , 1993 .

[14]  Naishuo Tian,et al.  Vacation Queueing Models: Theory and Applications (International Series in Operations Research & Management Science) , 2006 .

[15]  L. Ahlfors.  Complex Analysis , 1979 .

[16]  Jesús R. Artalejo,et al.  Steady state solution of a single-server queue with linear repeated requests , 1997, Journal of Applied Probability.

[17]  Beatrice Meini,et al.  Numerical methods for structured Markov chains , 2005 .

[18]  Ijbf Ivo Adan,et al.  A compensation approach for queueing problems , 1991 .

[19]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[20]  Steady-state Markov chain models for the Heine and Euler distributions , 1992 .

[21]  Tom Burr,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 2001, Technometrics.

[22]  Eitan Altman,et al.  Analysis of customers’ impatience in queues with server vacations , 2006, Queueing Syst. Theory Appl..

[23]  Achyutha Krishnamoorthy,et al.  An M|G|1 Retrial Queue with Nonpersistent Customers and Orbital Search , 2005 .

[24]  Steven G. Krantz,et al.  Handbook of Complex Variables , 1999 .

[25]  A. W. Kemp,et al.  Certain state-dependent processes for dichotomised parasite populations , 1990 .

[26]  Naishuo Tian,et al.  Vacation Queueing Models , 2006 .

[27]  Ram Chakka,et al.  Spectral Expansion Solution for a Class of Markov Models: Application and Comparison with the Matrix-Geometric Method , 1995, Perform. Evaluation.

[28]  Ben Atkinson,et al.  A Compensation Approach for Queueing Problems. , 1996 .

[29]  Antonis Economou,et al.  The compound Poisson immigration process subject to binomial catastrophes , 2004, Journal of Applied Probability.

[30]  MELIKE BAYKAL-GURSOY,et al.  Stochastic Decomposition in M/M/∞ Queues with Markov Modulated Service Rates , 2004, Queueing Syst. Theory Appl..

[31]  Naishuo Tian,et al.  Vacation Queueing Models Theory and Applications , 2006 .

[32]  Mourad E. H. Ismail,et al.  A queueing model and a set of orthogonal polynomials , 1985 .

[33]  D. P. Kroese,et al.  Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process , 2003 .

[34]  Winfried K. Grassmann,et al.  Real eigenvalues of certain tridiagonal matrix polynomials, with queueing applications , 2002 .

[35]  Onno Boxma,et al.  Boundary value problems in queueing system analysis , 1983 .

[36]  J. Gani,et al.  Birth, immigration and catastrophe processes , 1982, Advances in Applied Probability.

[37]  Beatrice Meini,et al.  Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation) , 2005 .