On the $ BMAP_1, BMAP_2/PH/g, c $ retrial queueing system
نویسندگان
چکیده
منابع مشابه
On the BMAP_1, BMAP_2/PH/g, c retrial queueing system
In this paper, we analyze a retrial queueing system with Batch Markovian Arrival Processes and two types of customers. The rate of individual repeated attempts from the orbit is modulated according to a Markov Modulated Poisson Process. Using the theory of multi-dimensional asymptotically quasi-Toeplitz Markov chain, we obtain the stability condition and the algorithm for calculating the statio...
متن کاملRetrial Queueing System with Several Input Flows
type i, , K , 1 i = who finds the server free begins to get service inmediately and leaves the system after completion. Otherwise, if the server is busy, the customer with probability 1 Hi leaves the system without service and with probability Hi > 0 joins an orbit of repeated customer but conserves its own type. The intervals separating two succesive repeated attempts of each customers from th...
متن کاملA Discrete-Time Retrial Queueing System With Service Upgrade
This paper considers a discrete-time retrial queueing system with displacements. The arriving customers can opt to go directly to the server obtaining immediately its service or to join the orbit. In the first case, the displaced customer goes directly to the orbit. The arrivals follow a geometrical law and the service times are general. We study the Markov chain underlying the considered queue...
متن کاملRetrial Queueing Models: A Survey on Theory and Applications
Retrial phenomenon naturally arises in various systems such as call centers, cellular networks and random access protocols in local area networks. This paper gives a comprehensive survey on theory and applications of retrial queues in these systems. We investigate the state of the art of the theoretical researches including exact solutions, stability, asymptotic analyses and multidimensional mo...
متن کاملThe transient M/D/c Queueing System
For any initial state of the M/D/c queueing system this paper presents explicit expressions for the transient distributions of the number of customers in the system at time t > 0, the virtual waiting time for a customer arriving at time t > 0, the queue length at the service intitiation of the nth customer, and the waiting time of the nth customer to be served after t = 0. The analysis requires...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial & Management Optimization
سال: 2020
ISSN: 1553-166X
DOI: 10.3934/jimo.2020124