Abstract
The <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">randomized drop when seen</i> (rDWS) scheme is an online, feedback-based network coding technique proven to be an efficient, lightweight variant of the deterministic <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">drop when seen</i> (DWS) scheme. We have proposed a non-generation-based, generalized version of rDWS with stochastic packet arrival at the sender queue (SQ) in this letter. Next, a queueing analysis is performed to find the expected SQ length with respect to the load factor. Analysis shows that asymptotic SQ length in rDWS approaches the same of DWS as the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">innovativeness factor</i> approaches unity, which establishes the effectiveness of rDWS in maintaining shorter expected SQ length.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
