Delay analysis of buffered CSMA/CD protocols

An approximate method for the delay analysis of CSMA/CD (carrier-sense multiple access with collision detection) with infinite-buffered users is proposed. The authors propose a system queue approach in which a single Markov chain considering all packets in the system is formulated. Based on the identical statistical behavior of each user, the packets in the system are distributed to every user with equal probability. A recursive method is introduced to solve the Markov chain efficiently. In the proposed approach, buffered packets and newly arrived packets can be distinguished. It is concluded that the recursive method can be used to evaluate CSMA/CD under the immediate-first-transmission (IFT) protocol or the delay-first-transmission (DFT) protocol. It is found that IFT performs better than DFT. Numerical results exhibit good agreement with simulation results