On NACK-Based rDWS Algorithm for Network Coded Broadcast

Abstract

The Drop when seen (DWS) technique, an online network coding strategy is capable of making a broadcast transmission over erasure channels more robust. This throughput optimal strategy reduces the expected sender queue length. One major issue with the DWS technique is the high computational complexity. In this paper, we present a randomized version of the DWS technique (rDWS), where the unique strength of the DWS, which is the sender’s ability to drop a packet even before its decoding at receivers, is not compromised. Computational complexity of the algorithms is reduced with rDWS, but the encoding is not throughput optimal here. So, we perform a throughput efficiency analysis of it. Exact probabilistic analysis of innovativeness of a coefficient is found to be difficult. Hence, we carry out two individual analyses, maximum entropy analysis, average understanding analysis, and obtain a lower bound on the innovativeness probability of a coefficient. Based on these findings, innovativeness probability of a coded combination is analyzed. We evaluate the performance of our proposed scheme in terms of dropping and decoding statistics through simulation. Our analysis, supported by plots, reveals some interesting facts about innovativeness and shows that rDWS technique achieves near-optimal performance for a finite field of sufficient size.

Entropy Analysis of a Flexible Markovian Queue with Server Breakdowns

“…The earliest document using entropy maximization in the context of queues that came to our attention is that of Bechtold et al [ 3 ]. Among the latest theoretical papers applying the maximum entropy principle we cite Yen et al [ 4 ], Shah [ 5 ], and Singh et al [ 6 ], while She et al [ 7 ], Giri and Roy [ 8 ], and Lin et al [ 9 ] present recent applications.…”