arXiv · math/0505046
Analysis of Multiserver Retrial Queueing System: A Martingale Approach and an Algorithm of Solution
Abstract
The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon arrival all servers are busy, then the customer goes to the secondary queue, orbit, and after some random time retries more and more to occupy a server. A service time of each customer is exponentially distributed random variable with parameter $μ_1$. A time between retrials is exponentially distributed with parameter $μ_2$ for each customer. Using a martingale approach the paper provides an analysis of this system. The paper establishes the stability condition and studies a behavior of the limiting queue-length distributions as $μ_2$ increases to infinity. As $μ_2\to\infty$, the paper also proves the convergence of appropriate queue-length distributions to those of the associated `usual' multiserver queueing system without retrials. An algorithm for numerical solution of the equations, associated with the limiting queue-length distribution of retrial systems, is provided.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Vyacheslav M. Abramov. 2005-11-06. Analysis of Multiserver Retrial Queueing System: A Martingale Approach and an Algorithm of Solution. https://doi.org/10.1007/s10479-006-5292-x
Cite the original work for its findings. Save a collection to share your selection of sources.