Abstract
A sliding window mechanism is well known to be a convenient way to integrate cumulative acknowledgement and flow control functions in a simple manner. Hence, widely used reliable data-transfer protocols such as TCP-SACK and RLC utilize this sliding window mechanism in conjunction with a selective-repeat ARQ (automatic repeat request) function, namely, the selective-repeat sliding window protocol (SR-SWP). We demonstrate that SR-SWP yields a throughput restraint effect (TORE) in particular situations when packet losses occur. We propose an analytical performance model to represent the TORE in the case of heavy traffic. Using this model, we derive explicit forms of goodput and mean resequencing delay, which are fundamental qualities of service parameters. From numerical results, we demonstrate that the impact of TORE on the performance is not negligible for high packet-loss probabilities. Furthermore, we show that the SR-SWP model exhibits the lower goodput and the smaller mean resequencing delay than those obtained from the traditional SR-ARQ protocol model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.