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

The authors explain 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, they 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.

Provided by: Cornell University Topic: Networking Date Added: Apr 2012 Format: PDF

Find By Topic