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>or=4.
展开▼
机译：考虑具有时间限制的三元反馈多路访问信道的冲突解决算法（CRA）。作者希望最大程度地增加到达目的地以在固定期限K内成功传输的数据包的数量。数据包到达被假定为泊松。描述了非嵌套的CRA，并将其性能与嵌套CRA的K> or = 4的值进行比较。
展开▼
