Abstract
This letter investigates streaming coding that places multiple repair packets between source packets to achieve in-order delivery over highly lossy links. While directly analyzing the deterministic placement of repair packets is difficult, a tractable random model is proposed and analyzed to show that a finite in-order delay is achieved. Using it as a guide of the insertion percentage, the delay is then shown to be further reducible by uniformly placing the repair packets, which suppresses the random variation.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
