q-series in markov chains with binomial transitions: Studying a queue with synchronization

  • Authors:

  • Antonis Economou;Stella Kapodistria

  • Affiliations:

  • Department of mathematics, university of athens, panepistemiopolis, athens 15784, greece e-mail: aeconom@math.uoa.gr/ stellakap@math.uoa.gr;Department of mathematics, university of athens, panepistemiopolis, athens 15784, greece e-mail: aeconom@math.uoa.gr/ stellakap@math.uoa.gr

  • Venue:
  • Probability in the Engineering and Informational Sciences
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.