Abstract
The authors investigate the effects of protocol processing overhead on the performance of error recovery schemes. The focus is on the edge-to-edge error recovery scheme, in which retransmissions of erred packets only take place between source and destination nodes. An approximation is obtained for the Laplace transform for the distribution of the end-to-end packet transfer delay, considering the processing time required for error recovery. The performance of the link-by-link error recovery scheme, in which retransmissions take place between adjacent nodes, is evaluated and compared to the performance of the edge-to-edge scheme. Numerical results from a tandem queuing network model show that for a network with very-high-speed/low-error-rate channels, an edge-to-edge scheme gives a smaller packet transmission delay than a link-by-link scheme for both go-back-N and selective-repeat retransmission procedures, while keeping the packet loss probability sufficiently small.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
