Communications for Statistical Applications and Methods

The Korean Statistical Society (한국통계학회)
권호 표지

Waiting Times in Priority Polling Systems with Batch Poisson Arrivals

  • Ryu, W. (Electronics and Telecommunications Research Institute) ;
  • Jun, K.P. (Electronics and Telecommunications Research Institute) ;
  • Kim, D.W. (Department of Information Communications, Okchon College) ;
  • Park, B.U. (Department of Statistics, Seoul National University)
  • Published : 1998.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we consider a polling system where the token is passed according to a general service order table. We derive an exact and explicit formula to compute the mean waiting time for a message when the arrivals of messages are modeled by batch Poisson processes.

Keywords

References

  1. IEEE Transactions on Communications v.Com-35 Polling with a general-service order table Baker, J. E.;Rubin, I.
  2. Operations Research v.20 Queues with periodic service and changeover time Eisenberg, M.
  3. IEEE Transactions on Communications v.Com-33 Exact results for nonsymmetric token ring systems Ferguson, M. J.;Aminetzah, Y. J.
  4. Management Science v.22 Utilization of idle time in an M/G/1 queueing system Levy, Y.;Yechiali, U.
  5. Analysis of Polling Systems Takagi, H.
  6. Operations Research v.30 Poisson arrivals see time averages Wolff, R.