Asymptotic bounds of throughput in series-parallel queueing networks.
Hemant D. GosaviJ. MacGregor SmithPublished in: Comput. Oper. Res. (1995)
Keyphrases
- series parallel
- queueing networks
- buffer allocation
- asymptotically optimal
- worst case
- arrival rate
- product form
- heavy traffic
- steady state
- upper bound
- temporal reasoning
- buffer management
- long run
- lower bound
- state dependent
- tree decomposition
- production line
- multiclass queueing networks
- stationary distribution
- queue length
- single server
- precedence constraints
- constraint networks
- redundancy allocation
- multistage
- np hard
- artificial neural networks
- video sequences
- machine learning