Abstract

This paper discusses in detail the robustness of the Capetanakis Collision Resolution Algorithm (CCRA) with and without the arrival epoch modification for multiple access networks. In particular, we show that the algorithm is robust against errors that cause different stations to see different feedback information about the results of the transmission attempts, and we quantify, through simulations and analysis, the performance (throughput/delay) degradation caused by those unshared errors.

Full Text
Paper version not known

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 call

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.