Discrete flow networks: bottleneck analysis and fluid approximations
Mathematics of Operations Research
Linear programming 1: introduction
Linear programming 1: introduction
Simple necessary and sufficient conditions for the stability of constrained processes
SIAM Journal on Applied Mathematics
Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
Queueing Systems: Theory and Applications
On Mutually Interfering Parallel Servers Subject to External Disturbances
Operations Research
Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers
Queueing Systems: Theory and Applications
Optimal processor allocation to differentiated job flows
Performance Evaluation
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Dynamic power control in a fading downlink channel subject to an energy constraint
Queueing Systems: Theory and Applications
Flow-level stability of data networks with non-convex and time-varying rate regions
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling, scheduling, and simulation of switched processing systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Dynamic scheduling for switched processing systems with substantial service-mode switching times
Queueing Systems: Theory and Applications
Projective cone scheduling (PCS) algorithms for packet switches of maximal throughput
IEEE/ACM Transactions on Networking (TON)
Computational Statistics & Data Analysis
Stability, fairness, and performance: a flow-level study on nonconvex and time-varying rate regions
IEEE Transactions on Information Theory
Job scheduling for maximal throughput in autonomic computing systems
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Routing to Manage Resolution and Waiting Time in Call Centers with Heterogeneous Servers
Manufacturing & Service Operations Management
Packet scheduling across networks of switches
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Hi-index | 0.06 |
We study a processing system comprised of parallel queues, whose individual service rates are specified by a global service mode (configuration). The issue is how to switch the system between various possible service modes, so as to maximize its throughput and maintain stability under the most workload-intensive input traffic traces (arrival processes). Stability preserves the job inflow–outflow balance at each queue on the traffic traces. Two key families of service policies are shown to maximize throughput, under the mild condition that traffic traces have long-term average workload rates. In the first family of cone policies, the service mode is chosen based on the system backlog state belonging to a corresponding cone. Two distinct policy classes of that nature are investigated, MaxProduct and FastEmpty. In the second family of batch policies (BatchAdapt), jobs are collectively scheduled over adaptively chosen horizons, according to an asymptotically optimal, robust schedule. The issues of nonpreemptive job processing and non-negligible switching times between service modes are addressed. The analysis is extended to cover feed-forward networks of such processing systems/nodes. The approach taken unifies and generalizes prior studies, by developing a general trace-based modeling framework (sample-path approach) for addressing the queueing stability problem. It treats the queueing structure as a deterministic dynamical system and analyzes directly its evolution trajectories. It does not require any probabilistic superstructure, which is typically used in previous approaches. Probability can be superposed later to address finer performance questions (e.g., delay). The throughput maximization problem is seen to be primarily of structural nature. The developed methodology appears to have broader applicability to other queueing systems.