✦ LIBER ✦

A lower bound for mean characteristics in E k /G/1 and GI/E k /1 queues 1

✍ Scribed by Daley, D.J.

Book ID: 127281865
Publisher: Taylor and Francis Group
Year: 1986
Tongue: English
Weight: 357 KB
Volume: 17
Category: Article
ISSN: 0233-1934
DOI: 10.1080/02331938608843109

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds for the mean system size in M/G/1

Bounds for the mean system size in M/G/1/K-queues

✍ B. Heijnen; G.K. Janssens 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 654 KB

A unified algorithm for computing the st

A unified algorithm for computing the stationary queue length distributions inM(k)/G/1/Nand GI/M(k)/1/N queues

✍ Ping Yang 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 744 KB

An Interpolation Approximation for the M

An Interpolation Approximation for the Mean Workload in a GI/G/1 Queue

✍ Ward Whitt 📂 Article 📅 1989 🏛 INFORMS 🌐 English ⚖ 710 KB

A Conservation Property for General GI/G

A Conservation Property for General GI/G/1 Queues with an Application to Tandem Queues

✍ E. Nummelin 📂 Article 📅 1979 🏛 Applied Probability Trust 🌐 English ⚖ 986 KB

Approximations and bounds for the varian

Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue

✍ B.Venkateshwara Rao; Richard M. Feldman 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 114 KB

A read-once lower bound and a (1,+k)-hie

A read-once lower bound and a (1,+k)-hierarchy for branching programs

✍ P. Savický; S. Žák 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Branching programs (b. p.'s) or decision diagrams are a general graph-based model of sequential computation. The b. p.'s of polynomial size are a nonuniform counterpart of LOG. Lower bounds for di erent kinds of restricted b. p.'s are intensively investigated. An important restriction are the so-cal