Wireless Scheduling Design for Optimizing Both Service Regularity and Mean Delay in Heavy-Traffic Regimes

Li, Bin; Li, Ruogu; Eryılmaz, Atilla

doi:10.1109/tnet.2015.2432119

Cited by 10 publications

(1 citation statement)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yet, the presence of the rate C i,j [t] in (3) also incorporates the channel conditions into the decision. Here, we note that TSLS counter was first introduced in [11][12][13][14].…”

Section: Tsls-based Algorithm Designmentioning

confidence: 99%

Emulating round-robin for serving dynamic flows over wireless fading channels

Eryılmaz

Srikant

2020

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Netw

Self Cite

View full text Add to dashboard Cite

Motivated by the Internet of Things (IoT) and Cyber-Physical Systems (CPS), we consider dynamic wireless fading networks, where each incoming flow has a random service demand and leaves the system once its service request is completed. In such networks, one of the primary goals of network algorithm design is to achieve shortterm fairness that characterizes how often each flow is served, in addition to the more traditional goals such as throughput-optimality and delay-insensitivity to the flow size distribution. In wireline networks, all of these desired properties can be achieved by the roundrobin scheduling algorithm. In the context of wireless networks, a natural extension of round-robin scheduling has been developed in the last few years through the use of a counter called the Time-Since-Last-Service (TSLS) that keeps track of the time that passed since the last service time of each flow. However, the performance of this round-robin-like algorithm has been primarily studied in the context of persistent flows that continuously inject packets into the network and do not ever leave the network. The analysis of dynamic flow arrivals and departures is challenging since each individual flow experiences independent wireless fading and thus, flows cannot be served in a strict round-robin manner. In this paper, we overcome this difficulty by exploring the intricate dynamics of TSLS-based algorithm and show that flows are provided roundrobin-like service with a very high probability. Consequently, we then show that our algorithm can achieve throughput-optimality. Moreover, through simulations, we demonstrate that the proposed TSLS-based algorithm also exhibits desired properties such as delayinsensitivity and excellent short-term fairness performance in the presence of dynamic flows over wireless fading channels.

show abstract

“…Yet, the presence of the rate C i,j [t] in (3) also incorporates the channel conditions into the decision. Here, we note that TSLS counter was first introduced in [11][12][13][14].…”

Section: Tsls-based Algorithm Designmentioning

confidence: 99%

Emulating round-robin for serving dynamic flows over wireless fading channels

Eryılmaz

Srikant

2020

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Netw

Self Cite

View full text Add to dashboard Cite

show abstract

Achieving Regular and Fair Learning in Combinatorial Multi-Armed Bandit

Wu,

2024

IEEE INFOCOM 2024 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks

Kadota

Sinha

Uysal-Biyikoğlu

et al. 2018

IEEE/ACM Trans. Networking

522

408

View full text Add to dashboard Cite

We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network.We first show that in symmetric networks a Greedy policy, which transmits the packet with highest current age, is optimal. For general networks, we develop three low-complexity scheduling policies: a randomized policy, a Max-Weight policy and a Whittle's Index policy, and derive performance guarantees as a function of the network configuration. To the best of our knowledge, this is the first work to derive performance guarantees for scheduling policies that attempt to minimize AoI in wireless networks with unreliable channels. Numerical results show that both Max-Weight and Whittle's Index policies outperform the other scheduling policies in every configuration simulated, and achieve near optimal performance.

show abstract

Wireless Scheduling Design for Optimizing Both Service Regularity and Mean Delay in Heavy-Traffic Regimes

Cited by 10 publications

References 27 publications

Emulating round-robin for serving dynamic flows over wireless fading channels

Emulating round-robin for serving dynamic flows over wireless fading channels

Achieving Regular and Fair Learning in Combinatorial Multi-Armed Bandit

Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks

Contact Info

Product

Resources

About