Analysis of MAP/PH/c Retrial Queue with Phase Type Retrials – Simulation Approach

Document Type

Conference Proceeding

Publication Date


Publication Title

Communications in Computer and Information Science, vol 356. Springer, Berlin, Heidelberg

Conference Name



In this paper we study a multi-server retrial queueing model in which customers arrive according to a Markovian arrival process (MAP) and the service times are assumed to be of phase type (PH-type). An arriving customer finding all servers busy will enter into a (retrial) orbit of infinite size. The customers in orbit will try to capture a free server after a random amount of time which is assumed to be of PH-type. Thus, every customer in the orbit has his/her own phase type distribution before attempting to get into service. Due to the complexity of the model and lack of attention to such models in the literature, we study this via simulation. After validating our simulated results against known results (both exact and approximation) for some special cases, we illustrate how one can underestimate or overestimate some key system performance measures by incorrectly assuming the retrial times to be exponential.


DOI 10.1007/978-3-642-35980-4_6 Print ISBN 978-3-642-35979-8 Online ISBN 978-3-642-35980-4. p 37 - p 49.

Rights Statement

© 2013 Springer-Verlag Berlin Heidelberg