Multi-server queue with a finite buffer and Batch Markov Arrival Process (BMAP) is considered. Customers, which do not succeed to enter the system upon arrival (due to unavailability of servers and buffer space), move to orbit to make repeated attempts in exponentially distributed time intervals. Customers in a buffer are impatient. After exponentially distributed amount of time they may leave the system without a service or go to the orbit. Stability condition of the system is derived, steady state distribution is computed, expressions for key performance measures and for waiting time distribution are given. Numerical illustrations are presented. © 2013 Springer-Verlag.
CITATION STYLE
Kim, C. S., Klimenok, V., & Dudin, A. (2013). Retrial queueing system with correlated input, finite buffer, and impatient customers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7984 LNCS, pp. 262–276). https://doi.org/10.1007/978-3-642-39408-9_19
Mendeley helps you to discover research relevant for your work.