Near‐optimal analysis of homogeneous central‐server queueing networks
✍ Scribed by Pentzaropoulos, G. C. ;Giokas, D.I.
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 239 KB
- Volume
- 13
- Category
- Article
- ISSN
- 8755-0024
No coin nor oath required. For personal study only.
✦ Synopsis
Number of servers in a queueing network N population of network (user tasks) Σ i representation of server i = 1, 2, 3, …, K I total number of inputs received from environment C time between successive inputs (cycle time) T time corresponding to measurements L i mean queue length (tasks) at server i = 1, 2, 3, …, K λ u mean input rate per user λ in overall input rate to the network λ i
mean access rate for server i = 1, 2, 3, …, K γ i mean service time at server i = 1, 2, 3, …, K Π i mean utilization factor of server i = 1, 2, 3, …, K Φ i mean throughput of server i = 1, 2, 3, …, K Φ 0 overall network throughput Φ 0max near-optimal value of overall network throughput W i mean waiting time at server i = 1, 2, 3, …, K W 0 overall network waiting time W 0min near-optimal value of overall network waiting time