Throughput-optimal h-qmw scheduling for hybrid wireless networks with persistent and dynamic flows
The well-known Queue-length-based MaxWeight scheduling algorithm (QMW) has been
proved to be throughput-optimal for persistent flows only, which are long-lived with infinite …
proved to be throughput-optimal for persistent flows only, which are long-lived with infinite …
Head-of-line access delay-based scheduling algorithm for flow-level dynamics
Scheduling algorithm design is a critical and challenging issue in multiuser wireless
networks with dynamic flows. The well-known Queue-length-based MaxWeight (QMW) …
networks with dynamic flows. The well-known Queue-length-based MaxWeight (QMW) …
HOL delay based scheduling in wireless networks with flow-level dynamics
How to design a throughput-optimal scheduling algorithm in a heterogeneous wireless
network with flow-level dynamics is a challenging problem. In this paper, we investigate the …
network with flow-level dynamics is a challenging problem. In this paper, we investigate the …
Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks
B Li, R Li, A Eryilmaz - Proceedings of the fourteenth ACM international …, 2013 - dl.acm.org
We consider the design of throughput-optimal scheduling policies in multi-hop wireless
networks that also possess good mean delay performance and provide regular service for …
networks that also possess good mean delay performance and provide regular service for …
Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference
We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless
networks with multihop traffic under the one-hop interference model. Although it is well …
networks with multihop traffic under the one-hop interference model. Although it is well …
Throughput optimality of delay-driven MaxWeight scheduler for a wireless system with flow dynamics
B Sadiq, G De Veciana - 2009 47th Annual Allerton Conference …, 2009 - ieeexplore.ieee.org
We consider a wireless downlink shared by a dynamic population of flows. The flows of
random size (bits) arrive at the base station at random times, and leave when they have …
random size (bits) arrive at the base station at random times, and leave when they have …
Wireless scheduling design for optimizing both service regularity and mean delay in heavy-traffic regimes
B Li, R Li, A Eryilmaz - IEEE/ACM Transactions on Networking, 2015 - ieeexplore.ieee.org
We consider the design of throughput-optimal scheduling policies in multihop wireless
networks that also possess good mean delay performance and provide regular service for …
networks that also possess good mean delay performance and provide regular service for …
Throughput-optimal scheduling in multihop wireless networks without per-flow information
In this paper, we consider the problem of link scheduling in multihop wireless networks
under general interference constraints. Our goal is to design scheduling schemes that do not …
under general interference constraints. Our goal is to design scheduling schemes that do not …
Distributed throughput optimal scheduling in the presence of heavy-tailed traffic
The heavy tailed traffic in wireless networks fundamentally challenges the applicability of
conventional throughput optimal scheduling algorithms. To encounter this, the stability …
conventional throughput optimal scheduling algorithms. To encounter this, the stability …
The stability of longest-queue-first scheduling with variable packet sizes
It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless
networks. However, its complexity is exponential in the number of links in an ad hoc wireless …
networks. However, its complexity is exponential in the number of links in an ad hoc wireless …