Queueing system topologies with limited flexibility

@inproceedings{Tsitsiklis2013QueueingST,
  title={Queueing system topologies with limited flexibility},
  author={John N. Tsitsiklis and Kuang Xu},
  booktitle={SIGMETRICS '13},
  year={2013}
}
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… 

Figures from this paper

Flexible Queueing Architectures
TLDR
This work shows that a large capacity region and an asymptotically vanishing queueing delay are simultaneously achievable even under limited flexibility, and demonstrates that a family of expander-graph-based flexibility architectures has a capacity region that is within a constant factor of the maximum possible.
Impact of Fairness and Heterogeneity on Delays in Large-scale Content Delivery Networks
TLDR
This work considers multi-class queueing systems where the per class service rates depend on the network state, fairness criterion, and is constrained to be in a symmetric polymatroid capacity region, and studies performance robustness to heterogeneity in per class loads and fairness criteria.
Asymptotically Optimal Load Balancing Topologies
TLDR
It is proved that if GN is an Erdöo s-Rényi random graph with average degree d(N), then with high probability it is N-Optimal and √N-optimal if d( n) → ∞ and d( N)/√Nlog(N) →∞ as N → �irth, respectively.
Asymptotically Optimal Load Balancing Topologies
TLDR
It is proved that if G N is an Erdos-Rényi random graph with average degree d(N), then with high probability it is N -optimal and ∞N-optimal if d (N) -> ınfty$ and d( N) / (∞N łog(N)) -> Turkishnfty as N -> Istanbulnfty, respectively.
Load Balancing Under Strict Compatibility Constraints
TLDR
Proportionally sparse random compatibility graphs can be constructed, which reduce the server-degree almost by a factor N/ln(N) compared to the complete bipartite compatibility graph.
Online Resource Allocation with Limited Flexibility
TLDR
The effectiveness of the long chain design in mitigating supply-demand mismatch under a simple myopic online allocation policy is shown and an upper bound on the expected total number of lost sales is provided that is irrespective of how large the market size is.
Performance Analysis of Low-Complexity Resource-Allocation Algorithms in Stochastic Networks Using Fluid Models
TLDR
An algorithm based on limited queue information at the machines is examined and its asymptotic delay performance is characterized and it is shown that the proposed algorithm achieves the same delay with remarkably less sampling overhead compared to the well-known power-of-two-choices algorithm.
On the power of (even a little) flexibility in dynamic resource allocation
TLDR
The results suggest that, with the right architecture, information, and decision policies, large-scale systems with partial flexibility can often vastly outperform their inflexible counterparts in terms of delay and capacity, and sometimes be almost as good as fully flexible systems.
Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints
Service systems often face task-server assignment-constraints due to skill-based routing or geographical conditions. Redundancy scheduling responds to this limited flexibility by replicating tasks to
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 30 REFERENCES
Bipartite graph structures for efficient balancing of heterogeneous loads
TLDR
This paper describes the asymptotic system efficiency under an optimal matching policy, and shows that -in contrast to greedy matching- optimal matching incurs an inefficiency that is exponentially small in the server storage size, even at critical system loads.
A Little Flexibility is All You Need: On the Asymptotic Value of Flexible Capacity in Parallel Queuing Systems
TLDR
“tailored pairing” is characterized as the theoretical benchmark configuration that maximizes the value of flexibility when demand and service uncertainty are the main concerns and it is proved that “a little flexibility is all you need”.
On the Power of (Even a Little) Resource Pooling
TLDR
A multi-server model that captures a performance trade-off between centralized and distributed processing is proposed and analyzed, demonstrating a surprising phase transition in the steady-state delay scaling.
Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing
TLDR
This work studies approximating deterministic fluid models for overloaded queueing systems having multiple customer classes and multiple service pools, each with many servers, and obtains the desired routing flow rates in three cases: when the routing graph is a tree, a tree-like structure, or complete bipartite.
Heavy traffic resource pooling in parallel‐server systems
TLDR
A queueing system with r non‐identical servers working in parallel, exogenous arrivals into m different job classes, and linear holding costs for each class is considered, and the Brownian solution suggests the following: virtually all backlogged work should be held in one particular job class.
Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
TLDR
This work studies approximating deterministic fluid models for overloaded queueing systems having multiple customer classes and multiple service pools, each with many servers, and obtains the desired routing flow rates in three cases: when the routing graph is a tree, a tree-like structure, or complete bipartite.
Bin Packing with Queues
TLDR
This paper establishes that the average queue size scales as Ω(hlogh), under any policy, and provides an easily implementable policy, which packs at most two items per bin.
Dynamic Scheduling of a System with Two Parallel Servers in Heavy Traffic with Resource Pooling: Asy
TLDR
A threshold control policy is proposed for use in the original parallel server system and it is shown that this policy is asymptotically optimal in the heavy traac limit and the limiting cost is the same as the optimal cost in the Brownian control problem.
On Pooling in Queueing Networks
TLDR
The main insight from the analysis is that care must be used in pooling, which can be devastating enough to turn a stable Jackson network into an unstable Bramson network.
Heavy-Traffic Limits for Queues with Many Exponential Servers
TLDR
Two different kinds of heavy-traffic limit theorems have been proved for s -server queues and the resulting approximation is better than the earlier ones for many-server systems operating at typically encountered loads.
...
1
2
3
...