Deadline-aware scheduling with adaptive network coding for real-time traffic

Lei Yang, Yalin E. Sagduyu, Junshan Zhang, Jason H. Li

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

We study deadline-aware scheduling with adaptive network coding (NC) for real-time traffic over a single-hop wireless network. To meet hard deadlines of real-time traffic, the block size for NC is adapted based on the remaining time to the deadline so as to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. This sequential block size adaptation problem is then cast as a finite-horizon Markov decision process. One interesting finding is that the optimal block size and its corresponding action space monotonically decrease as the deadline approaches, and that the optimal block size is bounded by the "greedy" block size. These unique structures make it possible to significantly narrow down the search space of dynamic programming, building on which we develop a monotonicity-based backward induction algorithm (MBIA) that can find the optimal block size in polynomial time. Furthermore, a joint real-time scheduling and channel learning scheme with adaptive NC is developed to adapt to channel dynamics in a mobile network environment. Then, we generalize the analysis to multiple flows with hard deadlines and long-term delivery ratio constraints. We devise a low-complexity online scheduling algorithm integrated with the MBIA, and then establish its asymptotical utility optimality. The analysis and simulation results are corroborated by high-fidelity wireless emulation tests, where actual radio transmissions over emulated channels are performed to demonstrate the feasibility of the MBIA in finding the optimal block size in real time.

Original languageEnglish (US)
Article numberp1430
Pages (from-to)1430-1443
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume23
Issue number5
DOIs
StatePublished - Oct 1 2015

Fingerprint

Network coding
Scheduling
Wireless networks
Radio transmission
Scheduling algorithms
Dynamic programming
Throughput
Polynomials

Keywords

  • Deadlines
  • Delay
  • Network coding
  • Real-time scheduling
  • Resource allocation
  • Throughput
  • Wireless broadcast

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Deadline-aware scheduling with adaptive network coding for real-time traffic. / Yang, Lei; Sagduyu, Yalin E.; Zhang, Junshan; Li, Jason H.

In: IEEE/ACM Transactions on Networking, Vol. 23, No. 5, p1430, 01.10.2015, p. 1430-1443.

Research output: Contribution to journalArticle

Yang, Lei ; Sagduyu, Yalin E. ; Zhang, Junshan ; Li, Jason H. / Deadline-aware scheduling with adaptive network coding for real-time traffic. In: IEEE/ACM Transactions on Networking. 2015 ; Vol. 23, No. 5. pp. 1430-1443.
@article{eee5a3ae662641459153bb0959189dff,
title = "Deadline-aware scheduling with adaptive network coding for real-time traffic",
abstract = "We study deadline-aware scheduling with adaptive network coding (NC) for real-time traffic over a single-hop wireless network. To meet hard deadlines of real-time traffic, the block size for NC is adapted based on the remaining time to the deadline so as to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. This sequential block size adaptation problem is then cast as a finite-horizon Markov decision process. One interesting finding is that the optimal block size and its corresponding action space monotonically decrease as the deadline approaches, and that the optimal block size is bounded by the {"}greedy{"} block size. These unique structures make it possible to significantly narrow down the search space of dynamic programming, building on which we develop a monotonicity-based backward induction algorithm (MBIA) that can find the optimal block size in polynomial time. Furthermore, a joint real-time scheduling and channel learning scheme with adaptive NC is developed to adapt to channel dynamics in a mobile network environment. Then, we generalize the analysis to multiple flows with hard deadlines and long-term delivery ratio constraints. We devise a low-complexity online scheduling algorithm integrated with the MBIA, and then establish its asymptotical utility optimality. The analysis and simulation results are corroborated by high-fidelity wireless emulation tests, where actual radio transmissions over emulated channels are performed to demonstrate the feasibility of the MBIA in finding the optimal block size in real time.",
keywords = "Deadlines, Delay, Network coding, Real-time scheduling, Resource allocation, Throughput, Wireless broadcast",
author = "Lei Yang and Sagduyu, {Yalin E.} and Junshan Zhang and Li, {Jason H.}",
year = "2015",
month = "10",
day = "1",
doi = "10.1109/TNET.2014.2331018",
language = "English (US)",
volume = "23",
pages = "1430--1443",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Deadline-aware scheduling with adaptive network coding for real-time traffic

AU - Yang, Lei

AU - Sagduyu, Yalin E.

AU - Zhang, Junshan

AU - Li, Jason H.

PY - 2015/10/1

Y1 - 2015/10/1

N2 - We study deadline-aware scheduling with adaptive network coding (NC) for real-time traffic over a single-hop wireless network. To meet hard deadlines of real-time traffic, the block size for NC is adapted based on the remaining time to the deadline so as to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. This sequential block size adaptation problem is then cast as a finite-horizon Markov decision process. One interesting finding is that the optimal block size and its corresponding action space monotonically decrease as the deadline approaches, and that the optimal block size is bounded by the "greedy" block size. These unique structures make it possible to significantly narrow down the search space of dynamic programming, building on which we develop a monotonicity-based backward induction algorithm (MBIA) that can find the optimal block size in polynomial time. Furthermore, a joint real-time scheduling and channel learning scheme with adaptive NC is developed to adapt to channel dynamics in a mobile network environment. Then, we generalize the analysis to multiple flows with hard deadlines and long-term delivery ratio constraints. We devise a low-complexity online scheduling algorithm integrated with the MBIA, and then establish its asymptotical utility optimality. The analysis and simulation results are corroborated by high-fidelity wireless emulation tests, where actual radio transmissions over emulated channels are performed to demonstrate the feasibility of the MBIA in finding the optimal block size in real time.

AB - We study deadline-aware scheduling with adaptive network coding (NC) for real-time traffic over a single-hop wireless network. To meet hard deadlines of real-time traffic, the block size for NC is adapted based on the remaining time to the deadline so as to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. This sequential block size adaptation problem is then cast as a finite-horizon Markov decision process. One interesting finding is that the optimal block size and its corresponding action space monotonically decrease as the deadline approaches, and that the optimal block size is bounded by the "greedy" block size. These unique structures make it possible to significantly narrow down the search space of dynamic programming, building on which we develop a monotonicity-based backward induction algorithm (MBIA) that can find the optimal block size in polynomial time. Furthermore, a joint real-time scheduling and channel learning scheme with adaptive NC is developed to adapt to channel dynamics in a mobile network environment. Then, we generalize the analysis to multiple flows with hard deadlines and long-term delivery ratio constraints. We devise a low-complexity online scheduling algorithm integrated with the MBIA, and then establish its asymptotical utility optimality. The analysis and simulation results are corroborated by high-fidelity wireless emulation tests, where actual radio transmissions over emulated channels are performed to demonstrate the feasibility of the MBIA in finding the optimal block size in real time.

KW - Deadlines

KW - Delay

KW - Network coding

KW - Real-time scheduling

KW - Resource allocation

KW - Throughput

KW - Wireless broadcast

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

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

U2 - 10.1109/TNET.2014.2331018

DO - 10.1109/TNET.2014.2331018

M3 - Article

AN - SCOPUS:84954383777

VL - 23

SP - 1430

EP - 1443

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 5

M1 - p1430

ER -