Collision resolution algorithms for a time-constrained multiaccess channel

Collision resolution algorithms (CRAs) for the ternary feedback multiple access channel with time constraints are considered. The authors wish to maximize the number of packets successfully transmitted within a fixed deadline K after their arrival for transmission. Packet arrivals are assumed to be Poisson. A nonnested CRA is described and its performance is compared with a nested CRA for values of K>