Abstract
A single-server queue concatenated with a multilayer channel encoder is considered. The main focus of this work is on minimization of the expected delay of a packet from entering the queue until completion of successful service. Tight bounds are derived for the expected delay for different numbers of coded layers. Numerical optimization is applied to find the optimal resource allocation minimizing the average delay. Similar bounds are also derived for the case of continuous layering. It is demonstrated that code layering may give pronounced performance gains in terms of delay, which are more impressive than those associated with throughput. This makes layering more attractive when communicating under stringent delay constraints.
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.
