Random Multiple Access System with Impatient Packets

The authors consider a random system of multiple access of impatient packets to a shared channel with feedback. With probability $p$, the packets refuse further attempts at transmission every time that they become involved in a conflict. The transmission rate in a system with a modified subdivision algorithm is determined. Upper and lower bounds are obtained for the capacity of the system as a function of the maximum permissible intensity of packet loss and the probability $p$.