A Lower Bound on Mean Delay for Free Access Class of RMA Algorithms

Abstract-The performance of a packet-switched network with the Poisson input source of rate λ and the infinite user population is studied. The users transmit their data packets over the communications channel with the success-empty-collision feedback information. We restrict our exploration to the class of the random multiple access algorithms for which a newly arrived packet is transmitted by a user as soon as possible. A function of λ is established such as the mean packet delay for any algorithm that belongs to the considered class is not below the value given by this function