On the throughput of CSMA
Yayu Gao, Lin Dai · 2011
In this paper, a semi-Markov model is established to characterize the throughput performance of CSMA networks. Based on the assumption of Poisson distributed aggregate traffic, the throughput expression of p-persistent CSMA is derived, which includes the results of 1-persistent CSMA and non-persistent CSMA presented in Kleinrock and Tobagis landmark paper as two special cases. The analysis further reveals that the Poisson assumption requires that the transmission probability of packets is small enough, in which case the throughput performance becomes insensitive to the rescheduling policy of packets, i.e., p-persistent or non-persistent, and is solely determined by the normalized propagation delay.