𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation method for the M/G/1 retrial queue with general retrial times

✍ Scribed by T. Yang; M.J.M. Posner; J.G.C. Templeton; H. Li

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
604 KB
Volume
76
Category
Article
ISSN
0377-2217

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

Optimization of the T policy M/G/1 queue
Optimization of the T policy M/G/1 queue with server breakdowns and general startup times
✍ Tsung-Yin Wang; Kuo-Hsiung Wang; Wen Lea Pearn πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 667 KB

This paper investigates the T policy M/G/1 queue with server breakdowns, and startup times. Customers arrive at the system according to a Poisson process. Service times, repair times, and startup times are assumed to be generally distributed. The server is turned on after a fixed length of time T re