✦ LIBER ✦

An efficient computation algorithm for a multiserver feedback retrial queue with a large queueing capacity

✍ Scribed by Tien Van Do

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 279 KB
Volume: 34
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.10.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient method to compute the rate

An efficient method to compute the rate matrix for retrial queues with large number of servers

✍ Tien Van Do; Ram Chakka 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 277 KB

The approximate solution technique for the main M/M/c retrial queue based on the homogenization of the model employs a quasi-birth-death (QBD) process in which the maximum retrial rate is restricted above a certain level. This approximated continuoustime Markov chain (CTMC) can be solved by the matr

A new computational algorithm for retria

A new computational algorithm for retrial queues to cellular mobile systems with guard channels

✍ Tien Van Do 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 286 KB

a b s t r a c t Retrial queueing models have been applied to evaluate the impact of new and handover calls on the call control mechanisms of cellular mobile networks. The fact that the retrial rate depends on the number of retried calls waiting in the system leads to an analytically intractable mode