Principles on the benefits of manufacturing process flexibility
Management Science
On Pooling in Queueing Networks
Management Science
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Heavy traffic resource pooling in parallel-server systems
Queueing Systems: Theory and Applications
Database replication policies for dynamic content applications
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
A Staffing Algorithm for Call Centers with Skill-Based Routing
Manufacturing & Service Operations Management
Logarithmic delay for N × N packet switches under the crossbar constraint
IEEE/ACM Transactions on Networking (TON)
The nature of data center traffic: measurements & analysis
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Process Flexibility Revisited: The Graph Expander and Its Applications
Operations Research
A product form solution to a system with multi-type jobs and multi-type servers
Queueing Systems: Theory and Applications
Bipartite graph structures for efficient balancing of heterogeneous loads
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
| Hi-index | 0.00 |
We study a multi-server model with n flexible servers and rn queues, connected through a fixed bipartite graph, where the level of flexibility is captured by the average degree, d(n), of the queues. Applications in content replication in data centers, skill-based routing in call centers, and flexible supply chains are among our main motivations. We focus on the scaling regime where the system size n tends to infinity, while the overall traffic intensity stays fixed. We show that a large capacity region (robustness) and diminishing queueing delay (performance) are jointly achievable even under very limited flexibility (d(n) l n). In particular, when d(n) gg ln n , a family of random-graph-based interconnection topologies is (with high probability) capable of stabilizing all admissible arrival rate vectors (under a bounded support assumption), while simultaneously ensuring a diminishing queueing delay, of order ln n/ d(n), as n- ∞. Our analysis is centered around a new class of virtual-queue-based scheduling policies that rely on dynamically constructed partial matchings on the connectivity graph.