Communications for Statistical Applications and Methods

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

Two Priority Class Polling Systems with Batch Poisson Arrivals

  • Ryu, Won (Electronics and Telecommunications Research Institute) ;
  • Kim, Dae-Ung (Electronics and Telecommunications Research Institute) ;
  • Lee, Bok-Lai (Korea Telecommunication) ;
  • Park, Byeong-U (Department of Statistics, Seoul National University) ;
  • Chung, Jin-Wook (Department of Information Engineering, Sungkyunkwan University)
  • Published : 1999.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we consider a polling system with two classes of stations; high priority and low priority. High priority stations are polled more frequently than low priority stations. We derive an exact and explicit formula for computing the mean waiting times for a message when the arrival processes are batch Poisson. In general the formula requires to solve two sets of simultaneous equations By specializing them to the case of two priority classes we greatly reduce the number equations and provide a simple formula for mean waiting times. We apply the results to a data communication processing system and show that the overall mean waiting time can be reduced by using priority polling.

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. The Korean Communications in Statistics v.5 Waiting times in priority polling systems with batch Poisson arrivals Ryu, W.;Jun, K.P.;Kim, D.W.;Park, B.U.
  5. Analysis of Polling Systems Takagi, H.