The robustness and performance of tree algorithms in an unshared feedback error environment
T. Suda, J.J. Bae, D.C. Baxter · 2003
A discussion is presented of the robustness of the Capetanakis collision resolution algorithm for multiple-access networks. In particular, they show that the algorithm is robust against errors that cause different stations to see different feedback information on the results of the transmission attempts, and they quantify, using simulation, the performance (throughput/delay) degradation caused by those unshared errors.>