Delay Analysis of 0.487 Contention Resolution Algorithms

We derive upper and lower bounds to the curve of expected delay versus throughput for the delay-enhanced version of the celebrated 0.487 multiple access contention resolution algorithm. The key to the derivation is a technique for generating upper and lower bounds to monotonic functions of the transmission lag via corresponding bounds on the kernel of the integral equation for the distribution of said lag. The separation between the upper and lower bounds is small, and the results agree well with simulations.