Synchronized reneging in queueing systems with vacations
نویسندگان
چکیده
منابع مشابه
Synchronized reneging in queueing systems with vacations
In this paper we present a detailed analysis of queueing models with vacations and impatient customers, where the source of impatience is the absence of the server. Instead of the standard assumption that customers perform independent abandonments, we consider situations where customers abandon the system simultaneously. This is, for example, the case in remote systems where customers may decid...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملQueueing Theory with Reneging
The literature on queueing with reneging is reviewed. Only random (Poisson) arrivals and unlimited capacity queues are considered, although some of the references also contain results for other arrival distributions or finite capacity queues. The paper focuses on the probability of service under steady state conditions; results for other metrics such as the expected waiting time may be found in...
متن کاملA queueing system with vacations
This paper is devoted to the study of an M/G/1 queue with a particular vacation discipline. The server is due to take a vacation as soon as it has served exactly N customers since the end of the previous vacation. N may be either a constant or a random variable. If the system becomes empty before the server has served N customers, then it stays idle until the next customer arrival. Such a vacat...
متن کاملDiscrete-time queueing systems with Markovian preemptive vacations
In this contribution we investigate discrete-time queueing systems with vacations. A framework is constructed that allows for studying numerous different vacation systems, including a.o. classical vacation systems like the exhaustive and limited vacation systems as well as queueing systems with service interruptions. Using a probability generating functions approach, we obtain steady-state perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2009
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-009-9112-2