Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Framework for the Analysis of a General M/G/1 Queue with Variable Server Vacations


Affiliations
1 Department of Mathematics, Sathyabama University, Chennai, India
2 Department of Mathematics, Kingston Engineering College, Vellore, India
     

   Subscribe/Renew Journal


The systematic growth of vacation queueing model in recent part is described in this paper .An M/G/1 queue with probability association is also analyzed in this paper. A two phase service queueing system with multiple server vacation is the subject matter. Service to customer starts with a batch mode service in the phase-I followed by individual mode service in phase – II. Each customer may or may not balk on the arrival at the queue. As soon as the system becomes empty, the server starts taking sequence of different distributed vacations. The number of Poisson arrivals during the time interval is distributed as the forward recurrence time of vacation and the number of customers present in the standard M/G/1 queueing system is random. Based on the numerical values of service rate and mean system time is analyzed in a graphical manner.

Keywords

Busy Cycle, Distribution Function Server Idle Time, System Size, Utilization Factor, Waiting Time.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 315

PDF Views: 3




  • A Framework for the Analysis of a General M/G/1 Queue with Variable Server Vacations

Abstract Views: 315  |  PDF Views: 3

Authors

C. Vijayalakshmi
Department of Mathematics, Sathyabama University, Chennai, India
K. Ramya
Department of Mathematics, Kingston Engineering College, Vellore, India

Abstract


The systematic growth of vacation queueing model in recent part is described in this paper .An M/G/1 queue with probability association is also analyzed in this paper. A two phase service queueing system with multiple server vacation is the subject matter. Service to customer starts with a batch mode service in the phase-I followed by individual mode service in phase – II. Each customer may or may not balk on the arrival at the queue. As soon as the system becomes empty, the server starts taking sequence of different distributed vacations. The number of Poisson arrivals during the time interval is distributed as the forward recurrence time of vacation and the number of customers present in the standard M/G/1 queueing system is random. Based on the numerical values of service rate and mean system time is analyzed in a graphical manner.

Keywords


Busy Cycle, Distribution Function Server Idle Time, System Size, Utilization Factor, Waiting Time.