An invariance principle for semimartingale reflecting Brownian motions in an orthant
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
State space collapse with application to heavy traffic limits for multiclass queueing networks
Queueing Systems: Theory and Applications
Heavy traffic resource pooling in parallel-server systems
Queueing Systems: Theory and Applications
Critical Thresholds for Dynamic Routing in Queueing Networks
Queueing Systems: Theory and Applications
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers
Queueing Systems: Theory and Applications
MARO - MinDrift affinity routing for resource management in heterogeneous computing systems
CASCON '07 Proceedings of the 2007 conference of the center for advanced studies on Collaborative research
Limited choice and locality considerations for load balancing
Performance Evaluation
Dynamic routing of customers with general delay costs in a multiserver queuing system
Probability in the Engineering and Informational Sciences
Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
Operations Research
Control of systems with flexible multi-server pools: a shadow routing approach
Queueing Systems: Theory and Applications
State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems
Mathematics of Operations Research
Centralized vs. Decentralized Ambulance Diversion: A Network Perspective
Management Science
Shadow-Routing Based Control of Flexible Multiserver Pools in Overload
Operations Research
Distributed α-optimal user association and cell load balancing in wireless networks
IEEE/ACM Transactions on Networking (TON)
Asymptotic Optimality of Balanced Routing
Operations Research
| Hi-index | 0.00 |
We consider a queuing system with multitype customers and nonhomogeneous flexible servers, in the heavy traffic asymptotic regime and under a complete resource pooling (CRP) condition. For the input-queued (IQ) version of such a system (with customers being queued at the system “entrance,” one queue per each type), it was shown in the work of Mandelbaum and Stolyar that a simple parsimonious Gc&mgr; scheduling rule is optimal in that it asymptotically minimizes the system customer workload and some strictly convex queuing costs. In this article, we consider a different—output-queued (OQ)—version of the model, where each arriving customer must be assigned to one of the servers immediately upon arrival. (This constraint can be interpreted as immediate routing of each customer to one of the “output queues,” one queue per each server.) Consequently, the space of controls allowed for an OQ system is a subset of that for the corresponding IQ system.We introduce the MinDrift routing rule for OQ systems (which is as simple and parsimonious as Gc&mgr;) and show that this rule, in conjunction with arbitrary work-conserving disciplines at the servers, has asymptotic optimality properties analogous to those Gc&mgr; rule has for IQ systems. A key element of the analysis is the notion of system server workload, which, in particular, majorizes customer workload. We show that (1) the MinDrift rule asymptotically minimizes server workload process among all OQ-system disciplines and (2) this minimal process matches the minimal possible customer workload process in the corresponding IQ system. As a corollary, MinDrift asymptotically minimizes customer workload among all disciplines in either the OQ or IQ system.