Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity

Ganti, Anand; Modiano, Eytan; Tsitsiklis, John N.

doi:10.1109/tit.2006.890695

Cited by 81 publications

(97 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was shown that LCQ stabilizes queue lengths if that is at all feasible, and that in symmetric models it minimizes mean delay within stationary policies that are based on current occupancies and channel states. Similar qualitative properties were shown to hold for analogues of LCQ in the case of multiple transmitters [5] and channel states [12]. Neely [8] provided bounds for mean queue lengths for certain variants of LCQ under the on/off channel model.…”

Section: Introductionmentioning

confidence: 62%

On power-of-choice in downlink transmission scheduling

Alanyali

Dashouk

2008

2008 Information Theory and Applications Workshop

View full text Add to dashboard Cite

Abstract-A low-complexity guiding principle is considered for transmission scheduling from n homogeneous queues whose channel states fluctuate independently. The scheduler transmits from a longest queue within d randomly chosen queues with eligible channel states. A Markovian model is studied where mean packet transmission time is n −1 and packet arrival rate is λ < 1 per queue. Equilibrium distribution of queue occupancy is obtained in the limit as n → ∞ and it is shown to have tails that decay as Θ((λ/d) k ). If transmissions are scheduled from a longest eligible queue in the entire system then almost all queues are empty in equilibrium; the number of queues with one packet is Θ(1) and the number of queues with more than one packet is o(1) as n → ∞. Equilibrium distribution of the total number of packets in the system is also characterized in this latter case.

show abstract

Section: Introductionmentioning

confidence: 62%

On power-of-choice in downlink transmission scheduling

Alanyali

Dashouk

2008

2008 Information Theory and Applications Workshop

View full text Add to dashboard Cite

show abstract

“…Thirdly, our scheduler considers the data rate from each AP. This is different to work such as [9], which only considers queue length.…”

Section: Related Workmentioning

confidence: 94%

An Opportunistic Scheduler for Dense WLANs

Chin¹

2011

IJCNC

View full text Add to dashboard Cite

The demand for bandwidth by multimedia applications remains unabated. This is particular critical given the growing number of devices with WiFi capability, and the ubiquity of Wireless Local Area Networks (WLANs). These trends have spurred researchers to develop low-cost and backward compatible solutions to increase the capacity of WLANs. One approach is to deploy additional Access Points (APs), and strategies to manage channel, user, and transmit power. As a result, stations are likely to be near one or more APs, and therefore are more likely to experience high data rates. In this paper, we take advantage of this fact to increase the capacity of a dense WLAN further by transmitting packets to a station via a neighboring AP if its associated AP is occupied by another station. Our approach is novel as prior works have not exploited the density and diversity of APs when scheduling downstream traffic. From extensive simulation studies, we show its viability in varying traffic scenarios, and in particular, WLANs with a high number of APs.s.

show abstract

“…This is primarily due to the tendency of these policies to 'balance out' the queues in the system, by preferentially serving longer queues. For example, [1] contains a strong sample path optimality result for queue backlogs under stochastically symmetric traffic to parallel queues; this is generalized in [11].…”

Section: Introductionmentioning

confidence: 99%

When heavy-tailed and light-tailed flows compete: The response time tail under generalized max-weight scheduling

Nair

Jagannathan

Wierman

2013

2013 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-This paper focuses on the design and analysis of scheduling policies for multi-class queues, such as those found in wireless networks and high-speed switches. In this context, we study the response time tail under generalized max-weight policies in settings where the traffic flows are highly asymmetric. Specifically, we study an extreme setting with two traffic flows, one heavy-tailed, and one light-tailed. In this setting, we prove that classical max-weight scheduling, which is known to be throughput optimal, results in the light-tailed flow having heavytailed response times. However, we show that via a careful design of inter-queue scheduling policy (from the class of generalized max-weight policies) and intra-queue scheduling policies, it is possible to maintain throughput optimality, and guarantee lighttailed delays for the light-tailed flow, without affecting the response time tail for the heavy-tailed flow.

show abstract

Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity

Cited by 81 publications

References 9 publications

On power-of-choice in downlink transmission scheduling

On power-of-choice in downlink transmission scheduling

An Opportunistic Scheduler for Dense WLANs

When heavy-tailed and light-tailed flows compete: The response time tail under generalized max-weight scheduling

Contact Info

Product

Resources

About