2019
DOI: 10.3390/e21090905
|View full text |Cite
|
Sign up to set email alerts
|

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 compr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 60 publications
0
1
0
Order By: Relevance
“…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.…”
Section: Introductionmentioning
confidence: 99%
“…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.…”
Section: Introductionmentioning
confidence: 99%