Multiserver Markovian Queueing System with Vacation

Abstract

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

Keywords:

• Multiple Vaction
• Waiting Time
• Markovian Queueing System