✦ LIBER ✦

Recurrence times of buffer overflows in Jackson networks

✍ Scribed by Meyn, S.P.; Frater, M.R.

Book ID: 114539654
Publisher: IEEE
Year: 1993
Tongue: English
Weight: 481 KB
Volume: 39
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.179346

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotics of overflow probabilities in

Asymptotics of overflow probabilities in Jackson networks

✍ Jiyeon Lee 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 222 KB

We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply a stronger logarithmic limit when multiple nodes have the same maxima

Fast simulation of buffer overflows in t

Fast simulation of buffer overflows in tandem networks ofGI/GI/1 queues

✍ Michael R. Frater; Brian D. O. Anderson 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 653 KB

Cycle times in single server cyclic Jack

Cycle times in single server cyclic Jackson networks

✍ Michael A. Zazanis 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 238 KB

On passage times in Jackson networks: Tw

On passage times in Jackson networks: Two-stations walk and overtake-free paths

✍ H. Daduna 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 562 KB

Duration of the buffer overflow period i

Duration of the buffer overflow period in a batch arrival queue

✍ Andrzej Chydzinski 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 302 KB

Engineering Calculation of Overflow Prob

Engineering Calculation of Overflow Probabilities in Buffers with Markov-Interrupted Service

✍ Woodside, C.; Ho, E. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 585 KB