Mean Buffer Contents in Discrete-Time Single-Server Queues with Heterogeneous Sources

  • Authors:
  • Tetsuya Takine

  • Affiliations:
  • Department of Communication Engineering, Graduate School of Engineering, Osaka University, Suita, Japan 565-0871

  • Venue:
  • Queueing Systems: Theory and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider discrete-time single-server queues fed by independent, heterogeneous sources with geometrically distributed idle periods. While being active, each source generates some cells depending on the state of the underlying Markov chain. We first derive a general and explicit formula for the mean buffer contents in steady state when the underlying Markov chain of each source has finite states. Next we show the applicability of the general formula to queues fed by independent sources with infinite-state underlying Markov chains and discrete phase-type active periods. We then provide explicit formulas for the mean buffer contents in queues with Markovian autoregressive sources and greedy sources. Further we study two limiting cases in general settings, one is that the lengths of active periods of each source are governed by an infinite-state absorbing Markov chain, and the other is the model obtained by the limit such that the number of sources goes to infinity under an appropriate normalizing condition. As you will see, the latter limit leads to a queue with (generalized) M/G/驴 input sources. We provide sufficient conditions under which the general formula is applicable to these limiting cases.