Collision resolution algorithms for a time-constrained multiaccess channel

S.S. Panwar, D. Towsley, Y. Armoni
1993 IEEE Transactions on Communications  
Collision resolution algorithms (CRA's) for the ternary feedback multiple access channel with time constraints are considered. We wish to maximize the number of packets successfully transmitted within a fixed deadline li 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 li 5 4.
doi:10.1109/26.231930 fatcat:z6eyhkaffrggneipb7aniz5sva