✦ LIBER ✦

Ladder heights and the Markov-modulated M/G/1 queue

✍ Scribed by Søren Asmussen

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 773 KB
Volume: 37
Category: Article
ISSN: 0304-4149
DOI: 10.1016/0304-4149(91)90050-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Imbedded Markov chains in queueing syste

Imbedded Markov chains in queueing systems M/G/1 and GI/M/1 with limited waiting room

✍ U. N. Bhat 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 282 KB

The age of the arrival process in the G/

The age of the arrival process in the G/M/1 and M/G/1 queues

✍ Moshe Haviv; Yoav Kerner 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 185 KB

Queue length and waiting time of the M/G

Queue length and waiting time of the M/G/1 queue under theD-policy and multiple vacations

✍ Ho Woo Lee; Sahng Hoon Cheon; Won Joo Seo 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 646 KB

The preempt-resume M/G/1 queue with feed

The preempt-resume M/G/1 queue with feedback and clocked schedules

✍ J. Keilson; L.D. Servi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 985 KB

Joint distribution of sojourn time and q

Joint distribution of sojourn time and queue length in the M/G/1 queue with (in) finite capacity

✍ O.J. Boxma 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 441 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