Waiting Times in Polling Systems with Markov-Modulated Poisson Process Arrival

  • Kim, D. W. (Electronics and Telecommunications Research Institute) ;
  • W. Ryu (Electronics and Telecommunications Research Institute) ;
  • K. P. Jun (Electronics and Telecommunications Research Institute) ;
  • Park, B. U. (Department of Statistics, Seoul National University, Seoul 151-742) ;
  • H. D. Bae (Chungbuk National University)
  • Published : 1997.09.01

Abstract

In queueing theory, polling systems have been widely studied as a way of serving several stations in cyclic order. In this paper we consider Markov-modulated Poisson process which is useful for approximating a superposition of heterogeneous arrivals. We derive the mean waiting time of each station in a polling system where the arrival process is modeled by a Markov-modulated Poisson process.

Keywords

References

  1. IEEE Journal on Selected Areas in Communications v.Sac-4 A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance Heffes, H.;Lucantoni, D.M.
  2. Queueing Systems, Volume 1: Theory Kleinrock, L.
  3. Journal of Applied Probabilty v.16 A versatile Markovian point process Neuts, M.F.
  4. Analysis of Polling Systems Takagi, H.