Packet Dropping and Decoding Statistics for Linear Network Coded Broadcast with Feedback

Giri, Sovanjyoti; Roy, Rajarshi

doi:10.1109/lcnw.2018.8628590

Cited by 1 publication

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As an immediate future extension of this work, a thorough mathematical analysis of the packet dropping and decoding statistics of the rDWS scheme can be done. A similar analysis for DWS technique was performed in [61]. Though we have carried out the same statistical analysis in Section 5 through simulation, a mathematical analysis of the same will help in getting a strong theoretical underpinning about the performance of the rDWS scheme.…”

Section: Discussionmentioning

confidence: 99%

“…Several works are done [50,53,60] to modify the DWS algorithm for delay control while keeping the main advantages of the technique. Reference [61] performed a statistical packet dropping analysis of a generation-based DWS broadcast system, and based on that analysis, provided a closer look at the delay profile for different decoding situations. A throughput-delay tradeoff is shown in [54] by careful and dynamic adaption of the transmission rate.…”

Section: Motivationmentioning

confidence: 99%

“…The lower bound is important because it helps to find the maximum time required to see a packet for a receiver. As decoding means seeing all packets of a generation [61], we can find maximum time to decode a generation for a receiver as well as for the whole receiver system. In short, P CL (i) helps in characterizing the decoding delay [49,50,53] profile of the broadcasting system.…”

Section: Lower Bound On P C (I)mentioning

confidence: 99%

See 2 more Smart Citations

On NACK-Based rDWS Algorithm for Network Coded Broadcast

Giri¹,

Roy²

2019

Entropy

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Discussionmentioning

confidence: 99%