论文信息 - Multiserver Markovian Queueing System with Vacation

Multiserver Markovian Queueing System with Vacation

An M|M|s queueing model with repeated vacation is studied under the following condition. The system should have at least r servers always available (busy or idle) for service and only the remaining (s — r) servers are allowed to go for vacation, when they are free. The distribution of the number of busy servers and the mean number of units in the system are derived. The steady state system probabilities and the waiting time distribution of an arriving customer are obtained for a particular case

R. Nadarajan | M. I. Afthab Begum | M. I. A. Begum | R. Nadarajan

[1] S. P. Mukherjee,et al. GI/M/1 Queue with Server Vacations , 1990 .

[2] S. W. Fuhrmann. Technical Note - A Note on the M/G/1 Queue with Server Vacations , 1984, Oper. Res..

[3] U. Yechiali,et al. Utilization of idle time in an M/G/1 queueing system Management Science 22 , 1975 .

[4] B. Vinod,et al. Exponential Queues with Server Vacations , 1986 .

[5] Edward P. C. Kao,et al. Analyses of an M/M/N/ queue with server's vacations , 1991 .

[6] Uri Yechiali,et al. AnM/M/s Queue with Servers''Vacations , 1976 .

[7] Chengxuan Cao,et al. The GI/M/1 queue with exponential vacations , 1989, Queueing Syst. Theory Appl..

[8] B. T. Doshi,et al. Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[9] J. Doob. Stochastic processes , 1953 .

[10] Nobuko Igaki. Exponential two server queue withN-policy and general vacations , 1992, Queueing Syst. Theory Appl..