6,189 research outputs found
Network Codes for Real-Time Applications
We consider the scenario of broadcasting for real-time applications and loss
recovery via instantly decodable network coding. Past work focused on
minimizing the completion delay, which is not the right objective for real-time
applications that have strict deadlines. In this work, we are interested in
finding a code that is instantly decodable by the maximum number of users.
First, we prove that this problem is NP-Hard in the general case. Then we
consider the practical probabilistic scenario, where users have i.i.d. loss
probability and the number of packets is linear or polynomial in the number of
users. In this scenario, we provide a polynomial-time (in the number of users)
algorithm that finds the optimal coded packet. The proposed algorithm is
evaluated using both simulation and real network traces of a real-time Android
application. Both results show that the proposed coding scheme significantly
outperforms the state-of-the-art baselines: an optimal repetition code and a
COPE-like greedy scheme.Comment: ToN 2013 Submission Versio
- …