Lower bound on delay in an RMA system with \(N\)-conflicts and errors (Q1310727)

The paper deals with lower bounds on packet delay in random multiple- access systems. The authors investigate the behaviour of a slotted random access system assuming presence of up to \(N\) conflicts of packets transmitted over an erroneous channel. They also present some results of asymptotic analysis of the channel throughput and system stability. The analysis is carried out accepting a Poisson arrival process. Additionally, the authors assume the stationary conditions and independence of errors in the common channel. The authors have been able to show that for \(N=2\) their results conform to the earlier results presented in the literature.