Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines

Details Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines

2012-03-18

arxiv.org/abs/1203.4008v4

Computer Science

Systems and Control

11 pages, 13 figures

Scientific paper

We study adaptive network coding (NC) for scheduling real-time traffic over a single-hop wireless network. To meet the hard deadlines of real-time traffic, it is critical 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. Thus motivated, we explore adaptive NC, where the block size is adapted based on the remaining time to the deadline, by casting this sequential block size adaptation problem 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 the optimal block size is bounded by the "greedy" block size. These unique structures make it possible to narrow down the search space of dynamic programming, building on which we develop a monotonicity-based backward induction algorithm (MBIA) that can solve for the optimal block size in polynomial time. Since channel erasure probabilities would be time-varying in a mobile network, we further develop a joint real-time scheduling and channel learning scheme with adaptive NC that can adapt to channel dynamics. We also generalize the analysis to multiple flows with hard deadlines and long-term delivery ratio constraints, devise a low-complexity online scheduling algorithm integrated with the MBIA, and then establish its asymptotical throughput-optimality. In addition to analysis and simulation results, we perform high fidelity wireless emulation tests with real radio transmissions to demonstrate the feasibility of the MBIA in finding the optimal block size in real time.

Affiliated with

Also associated with

No associations

Rating

Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Network Coding for Scheduling Real-time Traffic with Hard Deadlines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211617