Deadlock-free window algorithm with limited splitting for multiple access channels

By limiting the total number of splitting windows and using a probabilistic retransmission scheme, the authors propose a window algorithm to be deadlock-free from noisy feedback and simultaneous arrival of messages. The performance of the limited splitting algorithm is evaluated with respect to the maximal throughput under a Poisson infinite-user model.