Discrete flow networks: bottleneck analysis and fluid approximations
Mathematics of Operations Research
Introduction to Linear Optimization
Introduction to Linear Optimization
Heavy traffic resource pooling in parallel-server systems
Queueing Systems: Theory and Applications
Dynamic Server Allocation for Queueing Networks with Flexible Servers
Operations Research
OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS
Probability in the Engineering and Informational Sciences
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers
Operations Research
Optimal overload response in sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Bandwidth-sharing networks in overload
Performance Evaluation
Dynamic assignment of dedicated and flexible servers in tandem lines
Probability in the Engineering and Informational Sciences
Compensating for Failures with Flexible Servers
Operations Research
A Push---Pull Network with Infinite Supply of Work
Queueing Systems: Theory and Applications
Rate stability and output rates in queueing networks with shared resources
Performance Evaluation
Positive Harris recurrence and diffusion scale analysis of a push pull queueing network
Performance Evaluation
Fluid models of congestion collapse in overloaded switched networks
Queueing Systems: Theory and Applications
Stability of multi-class queueing networks with infinite virtual queues
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.