## Abstract Queueing networks with finite buffers, multiple servers, arbitrary acyclic, series‐parallel topologies, and general service time distributions are considered in this paper. An approach to optimally allocate servers to series, merge, and split topologies and their combinations is demonst
✦ LIBER ✦
Optimal control of single-server queueing networks
✍ Scribed by Svend-Holger Friis; Ulrich Rieder; Jürgen Weishaupt
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 620 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Optimal server allocation in general, fi
✍
J. MacGregor Smith; F. R. B. Cruz; T. van Woensel
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 510 KB
On the optimal control of a single-serve
✍
C. F. Klein; W. A. Gruver
📂
Article
📅
1978
🏛
Springer
🌐
English
⚖ 237 KB
On the optimal control of a single-serve
✍
C. H. Scott; T. R. Jefferson
📂
Article
📅
1978
🏛
Springer
🌐
English
⚖ 104 KB
On the optimal control problem of a sing
✍
S. Chakravarthy
📂
Article
📅
1983
🏛
Springer
🌐
English
⚖ 308 KB
Near‐optimal analysis of homogeneous cen
✍
Pentzaropoulos, G. C. ;Giokas, D.I.
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 239 KB
👁 1 views
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
On the optimal control of a single-serve
✍
C. F. Klein; W. A. Gruver
📂
Article
📅
1979
🏛
Springer
🌐
English
⚖ 180 KB