✦ LIBER ✦

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

✍ Scribed by O.J. Boxma

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 441 KB
Volume: 16
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(84)90078-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sojourn time distributions for the M/M/1

Sojourn time distributions for the M/M/1 queue in a Markovian environment

✍ Bhaskar Sengupta 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 751 KB

On the average idle time and average que

On the average idle time and average queue length estimates in an M/M/1 queue

✍ Anurag Kumar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 295 KB

A note on sojourn times in M/G/1 queues

A note on sojourn times in M/G/1 queues with instantaneous, bernoulli feedback

✍ Ralph L. Disney 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB

Optimal control of a removable server in

Optimal control of a removable server in an M/G/1 queue with finite capacity

✍ J. Teghem Jr. 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 495 KB

Waiting time analysis of the M/G/1 queue

Waiting time analysis of the M/G/1 queue with finite retrial group

✍ Jesus R. Artalejo; A. Gómez-Corral 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

Optimal selection of buffers in a tandem

Optimal selection of buffers in a tandem finite capacity G/M/1 queueing system

✍ Behnam Pourbabai 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 631 KB

Given that the &stnbutlon of the mterarnval time of the amval process of a tandem queuemg system consisting of a set of fimte capacRy G/M/1 queuemg systems, each wRh generally dtstnbuted mterarnval time (t e G), a single Markovtan server (t e M), and the first come first served queuemg dtsophne (t e