• Publications
  • Influence
MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
In this work we consider a problem related to the equilibrium Statistical Mechanics of Spin Glasses, namely the study of the Gibbs measure of the Random Energy Model. For solving this problem newExpand
  • 403
  • 53
  • PDF
Scheduling algorithms for a mixture of real-time and non-real-time data in HDR
TLDR
We study various scheduling algorithms for a mixture of real-time and non-real-time data over HDR/CDMA and compare their performance. Expand
  • 428
  • 35
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
  • A. Stolyar
  • Computer Science
  • Queueing Syst. Theory Appl.
  • 1 August 2005
TLDR
We study a model of controlled queueing network, which operates and makes control decisions in discrete time. Expand
  • 494
  • 33
  • PDF
Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule
TLDR
We consider a queueing system with multitype customers and flexible (multiskilled) servers that work in parallel. Expand
  • 272
  • 29
  • PDF
Scheduling in a Queueing System with Asynchronously Varying Service Rates
TLDR
We consider a model motivated by the problem of scheduling transmissions of multiple data users ( ows) sharing the same wireless channel (server). Expand
  • 228
  • 23
  • PDF
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
  • A. Stolyar
  • Computer Science, Mathematics
  • Oper. Res.
  • 2005
TLDR
We prove asymptotic optimality of the gradient scheduling algorithm (which generalizes the well-known proportional fair algorithm) for our model, which, in particular, allows for simultaneous service of multiple users and for discrete sets of scheduling decisions. Expand
  • 289
  • 22
  • PDF
Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing
TLDR
In this paper, we present solutions to address both of the above issues, and hence, improve the delay performance of the back-pressure algorithm. Expand
  • 205
  • 22
  • PDF
Optimal utility based multi-user throughput allocation subject to throughput constraints
TLDR
We consider the problem of scheduling multiple users sharing a time-varying wireless channel. Expand
  • 198
  • 18
  • PDF
Scheduling for multiple flows sharing a time-varying channel: the exponential rule
TLDR
We study a scheduling rule, which we call the exponential rule, and prove that this rule is throughput-optimal, i.e., it makes the queues stable if there exists any rule which can do so. Expand
  • 342
  • 17
  • PDF
LARGEST WEIGHTED DELAY FIRST SCHEDULING: LARGE DEVIATIONS AND OPTIMALITY
We consider a single server system with N input flows. We assume that each flow has stationary increments and satisfies a sample path large deviation principle, and that the system is stable. WeExpand
  • 211
  • 15
  • PDF