• Publications
  • Influence
Providing quality of service over a shared wireless link
TLDR
It is shown how scheduling algorithms exploiting asynchronous variations of channel quality can be used to maximize the channel capacity and maximize the number of users that can be supported with the desired QoS.
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 new
Scheduling algorithms for a mixture of real-time and non-real-time data in HDR
TLDR
The main conclusion is that intelligent scheduling algorithms in conjunction with token based rate control provide an efficient framework for supporting a mixture of real-time and non-real-time data applications in a single carrier.
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
  • A. Stolyar
  • Computer Science
    Queueing Syst. Theory Appl.
  • 1 August 2005
TLDR
A dynamic control algorithm, which is introduced, which the authors call Greedy Primal-Dual (GPD) algorithm, and prove its asymptotic optimality, and shows that it can accommodate a wide range of applications.
Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule
TLDR
A queueing system with multitype customers and flexible (multiskilled) servers that work in parallel is considered and a very simple generalizedcµ-rule is shown to minimizes both instantaneous and cumulative queueing costs, asymptotically, over essentially all scheduling disciplines, preemptive or non-preemptive.
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
TLDR
A simple online scheduling discipline, Modified Largest Weighted Delay First, along with its generalizations, is throughput optimal; namely, it ensures that the queues are stable as long as the vector of average arrival rates is within the system maximum stability region.
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
  • A. Stolyar
  • Computer Science, Mathematics
    Oper. Res.
  • 2005
TLDR
Asymptotic optimality of the gradient scheduling algorithm (which generalizes the well-known proportional fair algorithm) is proved for this model, which allows for simultaneous service of multiple users and for discrete sets of scheduling decisions.
Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing
TLDR
This paper presents solutions to address both of the above issues, and hence, improve the delay performance of the back-pressure algorithm and decreases the complexity of the queueing data structures at each node.
Scheduling for multiple flows sharing a time-varying channel: the exponential rule
TLDR
It is demonstrated that the exponential rule can be used to provide Quality of Service guarantees over a shared wireless link and is called the throughput-optimal rule.
Optimal utility based multi-user throughput allocation subject to throughput constraints
TLDR
The dynamics of user throughputs under GMR algorithm is studied, and it is shown that GMR is asymptotically optimal in the following sense.
...
1
2
3
4
5
...