✦ LIBER ✦

A new Markovian description of the M/G/1 retrial queue

✍ Scribed by A. Rodrigo; M. Vázquez; G. Falin

Book ID: 104339574
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 494 KB
Volume: 104
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(97)00250-6

No coin nor oath required. For personal study only.

✦ Synopsis

This article deals with a new Markovian description of the M/G/1 retrial queue. We consider the process (M(t), N(t)), where M(t) is the total number of arrivals from the last departure until time t and N(t) is the number of customers in orbit at time t. We obtain the generating function together with a recurrent formula for factorial moments in the steady state. We use this process to get an estimator of the parameter of retrial and its variance by solving some linear differential equations. We also give some numerical examples.

📜 SIMILAR VOLUMES

A G/M/1-queue with exponential retrial

✍ R. E. Lillo 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 674 KB

The m/g/1 retrial queue with nonpersiste

The m/g/1 retrial queue with nonpersistent customers

✍ T. Yang; M. J. M. Posner; J. G. C. Templeton 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 461 KB

The M/G/1 retrial queue with bernoulli s

The M/G/1 retrial queue with bernoulli schedule

✍ Bong Dae Choi; Kwang Kyu Park 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 361 KB

The M/G/1 retrial queue with Bernoulli s

The M/G/1 retrial queue with Bernoulli schedules and general retrial times

✍ B. Krishna Kumar; D. Arivudainambi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 698 KB

This paper is concerned with the analysis of a single-server queue with Bernoulli vacation schedules and general retrial times. We assume that the customers who find the server busy axe queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the h

Waiting-time probabilities in the M/G/1

Waiting-time probabilities in the M/G/1 retrial queue

✍ R. D. Nobel; H. C. Tijms 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

On the busy period of the M/G/1 retrial

On the busy period of the M/G/1 retrial queue

✍ J.R. Artalejo; M.J Lopez-Herrero 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of t