Abstract
Of the automatic-repeat-request (ARQ) techniques commonly used in communication systems, selective protocols, while the most efficient, have the notable drawback of requiring large buffers at the receiver side. A selective ARQ protocol with a finite-length buffer is described. If N is the number of codewords transmittable in the round-trip delay, the protocol requires a buffer length N+N/sub a/, N/sub a/>or=2 being an integer. A lower bound on the throughput of the protocol is derived. It achieves higher throughputs than similar schemes giving results comparable to those for selective protocols with infinite-length buffer for high error rates in the communication channel.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
