An efficient contention resolution algorithm for multiple access channels

Abstract : In this thesis, the general form of a first-come first-served contention resolution algorithm is given. A sub-class of FCFS algorithms, called single interval algorithms, are analyzed using Markovian decision theory. It is seen that, if the horizon is infinite, Humblet's algorithm has the maximum throughput for this sub-class. However, if the system is shut down after a finite number of transmissions, then an extended version of his algorithm is optimal.