The robustness of tree algorithms in an unshared feedback error environment

The robustness of the Capetanakis Collision Resolution Algorithm (CCRA) for multiple-access networks is discussed. In particular, the authors show that the algorithm is robust against errors that cause different stations to see different feedback information on the results of transmission attempts, and they quantify, through simulations, the performance (throughput/delay) degradation caused by those unshared errors.<
>