MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic

By Alexander L. Stolyar. 2004

461 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Management Information Systems

View Paper: https://www.semanticscholar.org/paper/c1d8f336f4bc7fde23f6960e89fc3926a1cac524

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

In Management Information Systems

Citations in the corpus

Resource Allocation and Cross-Layer Control in Wireless Networks (2006, background): “SUBJECT TERMS Wireless adhoc networks, fundamental capacity limits, node placement 15.”
On the dynamic control of matching queues (2014, unknown): “Under a so-called match-pooling condition, we devise a discrete-review matching policy that asymptotically – as the arrival rates become large – achieves the imbalance-based lower bound.”
Control Techniques for Complex Networks: Workload (2007, methodology): “Wireless models related to the ALOHA model are considered in a heavy-traffic setting in [462, 170, 62].”
Stein's method for steady-state diffusion approximations: an introduction through the Erlang-A and Erlang-C models (2015, background): “[58, 55, 18], or when the diffusion approximation is multi-dimensional [33, 51, 49, 9, 63].”
Downlink scheduling and resource allocation for OFDM systems (2009, methodology): “The “Max Weight” policy (e.g. [ 7 ]‐[9]) can also be viewed as a gradient-”
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation (2005, methodology): “(This system is same as in Stolyar 2004, where it is called generalized switch.) There is a finite set N = " 1� 2 ��N# of queues (and corresponding “customer types”) served by a switch.”
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm (2005, background): “Given this, the rest of the proof of (95) is analogous to the proof of Lemma 5(ii) in [20].”
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks (2006, background): “Consider a model of queueing network that is served by a generalized switch [27].”
Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule (2004, methodology): “The distinguishing feature of our analysis, compared to Stolyar (2004), is that here we deal with continuous time.”
Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic (2010, background): “For general queueing systems (with or without customer abandonment) there are numerous articles that address the issue of system optimization ([5,8,9,6,14,15,18,3,26, 29] is a partial list of such articles).”