M/G/1 Queueing System wish Vacation and Limited-1 Service Policy

  • Lee, B-L. (Korea Telecommunication) ;
  • W. Ryu (Electronic and Telecommunication Research Institute) ;
  • Kim, D-U. (Electronic and Telecommunication Research Institute) ;
  • Park, B.U. (Department of Statistics, Seoul National University) ;
  • J-W. Chung (Department of Information Engineering, Sungkyunkwan University)
  • 발행 : 2001.12.01

초록

In this paper we consider an M/G/1 queue where the server of the system has a vacation time and the service policy is limited-1. In this system, upon termination of a vacation the server returns to the queue and serves at most one message in the queue before taking another vacation. We consider two models. In the first, if the sever finds the queue empty at the end of a cacation, then the sever immediately takes another vacation. In the second model, if no message have arrived during a vacation, the sever waits for the first arrival to serve. The analysis of this system is particularly useful for a priority class polling system. We derive Laplace-Stieltjes transforms of the waiting time for both models, and compare their mean waiting times.

키워드

참고문헌

  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. Management Science v.22 Utilization of ilde time in an M/G/1 queueing system 1975-00-00
  4. The Korean Communications in Statistics v.5 Waiting times in priorit polling systems with batch Poisson arrivals Ryu;W.;Jun;K.P.;Kim;D.W.;Park;B.U.