Name
Abstract | ||
|---|---|---|
This paper is concerned with the dynamic assignment of servers to tasks in queueing networks where demand may exceed the capacity for service. The objective is to maximize the system throughput. We use fluid limit analysis to show that several quantities of interest, namely the maximum possible throughput, the maximum throughput for a given arrival rate, the minimum arrival rate that will yield a desired feasible throughput, and the optimal allocations of servers to classes for a given arrival rate and desired throughput, can be computed by solving linear programming problems. We develop generalized round-robin policies for assigning servers to classes for a given arrival rate and desired throughput, and show that our policies achieve the desired throughput as long as this throughput is feasible for the arrival rate. We conclude with numerical examples that illustrate the points discussed and provide insights into the system behavior when the arrival rate deviates from the one the system is designed for. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s11134-011-9258-6 | Queueing Syst. |
Keywords | Field | DocType |
Multi-class queueing networks,Stability,Fluid model,Maximum throughput,Jackson networks,60K25,90B22,90B15,68M20 | Throughput (business),Fluid limit,Mathematical optimization,Computer science,Server,Real-time computing,Queueing theory,Linear programming,Throughput | Journal |
Volume | Issue | ISSN |
70 | 1 | 0257-0130 |
Citations | PageRank | References |
3 | 0.40 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Salih Tekin | 1 | 4 | 1.10 |
| Sigrún Andradóttir | 2 | 548 | 55.09 |
| Douglas G. Down | 3 | 370 | 37.04 |