NUMERICAL STUDY OF OPTIMAL BUFFER SIZE AND VACATION LENGTH IN M/G/1/K QUEUES WITH MULTIPLE VACATIONS
نویسندگان
چکیده
منابع مشابه
An analysis of multiple-class vacation queues with individual thresholds
This study examines a multiple-class M=G=1 queue with multiple thresholds. Each class of customer arrives according to an independent Poisson process, and each class has its own threshold. The idle server is reactivated as soon as any one of the thresholds is reached. Both FCFS and non-preemptive priority cases are considered. The Laplace–Stieltjes transform of the waiting time distribution fun...
متن کاملOn One Approach to Study of Departure Process in Batch Arrival Queues with Multiple Vacations
A batch arrival single-server queueing system of a general type is considered. At the end of each busy period the server begins a multiple vacation period when the service process is stopped. A new approach to the study of departure process in such a system is proposed. Using the formula of total probability and renewal theory we direct the analysis to that in the system without vacations. An e...
متن کاملFinite Buffer Bulk Service Queue with Multiple Vacations
In this paper, it is studied about finite buffer bulk service queue M/G (a,b) /1 with multiple vacations and some analytical results, relations among queue length distributions, computations of state probabilities at various epochs are included.
متن کاملA STUDY OF OPTIMAL DIMENSIONING OF QUEUES WITH RESPECT TO SOCIAL AND INDIVIDUAL PROFIT
In this paper, a system of GIG/l/K queue is considered. The optimal system's capacity (K), when the system is optimized with respect to the benefit of the entire system (social optimization) and when the criterion for optimality is individual gains (individual optimization), is determined and compared. In social optimization, the system capacity is obtained through maximization of the syst...
متن کاملDiscrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations
This paper treats a discrete-time single-server finite-buffer exhaustive (singleand multiple-) vacation queueing system with discrete-time Markovian arrival process (D-MAP). The service and vacation times are generally distributed random variables and their durations are integral multiples of a slot duration. We obtain the queue-length distributions at departure, service completion, vacation te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering Technologies and Management Research
سال: 2020
ISSN: 2454-1907
DOI: 10.29121/ijetmr.v6.i2.2019.350