Restless streaming bandits

Scheduling scalable video in wireless networks

S. Amir Hosseini, Shivendra Panwar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we consider the problem of optimal scalable video delivery to mobile users in wireless networks given arbitrary Quality Adaptation (QA) mechanisms. In current practical systems, QA and wireless channel scheduling are performed independently by the content provider and network operator, respectively. While most research has been focused on jointly optimizing these two tasks, the high complexity that comes with a joint approach makes the implementation impractical. Therefore, we present a scheduling mechanism that takes the QA logic of each user as input and optimizes the scheduling accordingly. Hence, there is no need for centralized QA and cross-layer interactions are minimized. We model the QA-adaptive scheduling and the jointly optimal problem as a Restless Bandit and a Multi-user Semi Markov Decision Process, respectively in order to compare the loss incurred by not employing a jointly optimal scheme. We then present heuristic algorithms in order to achieve the optimal outcome of the Restless Bandit solution, assuming the base station has knowledge of, but no control over, the underlying quality adaptation of each user (QA-Aware). We also present a simplified heuristic without the need for any higher layer knowledge at the base station (QA-Blind). We show that our QA-Aware strategy can achieve up to two times improvement in network utilization compared to popular baseline algorithms such as Proportional Fairness.

Original languageEnglish (US)
Title of host publication55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages620-628
Number of pages9
Volume2018-January
ISBN (Electronic)9781538632666
DOIs
StatePublished - Jan 17 2018
Event55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 - Monticello, United States
Duration: Oct 3 2017Oct 6 2017

Other

Other55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
CountryUnited States
CityMonticello
Period10/3/1710/6/17

Fingerprint

Streaming
Wireless Networks
Wireless networks
Scheduling
Base stations
Heuristic algorithms
Semi-Markov Decision Process
Proportional Fairness
Adaptive Scheduling
Cross-layer
Heuristic algorithm
Baseline
Optimise
Heuristics
Logic
Arbitrary
Operator
Interaction

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Signal Processing
  • Energy Engineering and Power Technology
  • Control and Optimization

Cite this

Hosseini, S. A., & Panwar, S. (2018). Restless streaming bandits: Scheduling scalable video in wireless networks. In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 (Vol. 2018-January, pp. 620-628). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ALLERTON.2017.8262794

Restless streaming bandits : Scheduling scalable video in wireless networks. / Hosseini, S. Amir; Panwar, Shivendra.

55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. Vol. 2018-January Institute of Electrical and Electronics Engineers Inc., 2018. p. 620-628.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hosseini, SA & Panwar, S 2018, Restless streaming bandits: Scheduling scalable video in wireless networks. in 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 620-628, 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, United States, 10/3/17. https://doi.org/10.1109/ALLERTON.2017.8262794
Hosseini SA, Panwar S. Restless streaming bandits: Scheduling scalable video in wireless networks. In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. Vol. 2018-January. Institute of Electrical and Electronics Engineers Inc. 2018. p. 620-628 https://doi.org/10.1109/ALLERTON.2017.8262794
Hosseini, S. Amir ; Panwar, Shivendra. / Restless streaming bandits : Scheduling scalable video in wireless networks. 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. Vol. 2018-January Institute of Electrical and Electronics Engineers Inc., 2018. pp. 620-628
@inproceedings{e03b18dc14f249eca997b84120cb12f1,
title = "Restless streaming bandits: Scheduling scalable video in wireless networks",
abstract = "In this paper, we consider the problem of optimal scalable video delivery to mobile users in wireless networks given arbitrary Quality Adaptation (QA) mechanisms. In current practical systems, QA and wireless channel scheduling are performed independently by the content provider and network operator, respectively. While most research has been focused on jointly optimizing these two tasks, the high complexity that comes with a joint approach makes the implementation impractical. Therefore, we present a scheduling mechanism that takes the QA logic of each user as input and optimizes the scheduling accordingly. Hence, there is no need for centralized QA and cross-layer interactions are minimized. We model the QA-adaptive scheduling and the jointly optimal problem as a Restless Bandit and a Multi-user Semi Markov Decision Process, respectively in order to compare the loss incurred by not employing a jointly optimal scheme. We then present heuristic algorithms in order to achieve the optimal outcome of the Restless Bandit solution, assuming the base station has knowledge of, but no control over, the underlying quality adaptation of each user (QA-Aware). We also present a simplified heuristic without the need for any higher layer knowledge at the base station (QA-Blind). We show that our QA-Aware strategy can achieve up to two times improvement in network utilization compared to popular baseline algorithms such as Proportional Fairness.",
author = "Hosseini, {S. Amir} and Shivendra Panwar",
year = "2018",
month = "1",
day = "17",
doi = "10.1109/ALLERTON.2017.8262794",
language = "English (US)",
volume = "2018-January",
pages = "620--628",
booktitle = "55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Restless streaming bandits

T2 - Scheduling scalable video in wireless networks

AU - Hosseini, S. Amir

AU - Panwar, Shivendra

PY - 2018/1/17

Y1 - 2018/1/17

N2 - In this paper, we consider the problem of optimal scalable video delivery to mobile users in wireless networks given arbitrary Quality Adaptation (QA) mechanisms. In current practical systems, QA and wireless channel scheduling are performed independently by the content provider and network operator, respectively. While most research has been focused on jointly optimizing these two tasks, the high complexity that comes with a joint approach makes the implementation impractical. Therefore, we present a scheduling mechanism that takes the QA logic of each user as input and optimizes the scheduling accordingly. Hence, there is no need for centralized QA and cross-layer interactions are minimized. We model the QA-adaptive scheduling and the jointly optimal problem as a Restless Bandit and a Multi-user Semi Markov Decision Process, respectively in order to compare the loss incurred by not employing a jointly optimal scheme. We then present heuristic algorithms in order to achieve the optimal outcome of the Restless Bandit solution, assuming the base station has knowledge of, but no control over, the underlying quality adaptation of each user (QA-Aware). We also present a simplified heuristic without the need for any higher layer knowledge at the base station (QA-Blind). We show that our QA-Aware strategy can achieve up to two times improvement in network utilization compared to popular baseline algorithms such as Proportional Fairness.

AB - In this paper, we consider the problem of optimal scalable video delivery to mobile users in wireless networks given arbitrary Quality Adaptation (QA) mechanisms. In current practical systems, QA and wireless channel scheduling are performed independently by the content provider and network operator, respectively. While most research has been focused on jointly optimizing these two tasks, the high complexity that comes with a joint approach makes the implementation impractical. Therefore, we present a scheduling mechanism that takes the QA logic of each user as input and optimizes the scheduling accordingly. Hence, there is no need for centralized QA and cross-layer interactions are minimized. We model the QA-adaptive scheduling and the jointly optimal problem as a Restless Bandit and a Multi-user Semi Markov Decision Process, respectively in order to compare the loss incurred by not employing a jointly optimal scheme. We then present heuristic algorithms in order to achieve the optimal outcome of the Restless Bandit solution, assuming the base station has knowledge of, but no control over, the underlying quality adaptation of each user (QA-Aware). We also present a simplified heuristic without the need for any higher layer knowledge at the base station (QA-Blind). We show that our QA-Aware strategy can achieve up to two times improvement in network utilization compared to popular baseline algorithms such as Proportional Fairness.

UR - http://www.scopus.com/inward/record.url?scp=85047910086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85047910086&partnerID=8YFLogxK

U2 - 10.1109/ALLERTON.2017.8262794

DO - 10.1109/ALLERTON.2017.8262794

M3 - Conference contribution

VL - 2018-January

SP - 620

EP - 628

BT - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -