Analysis of the Slotted Non-persistent CSMA Protocol with Poissonian Packet Size Using a Semi-Markov Graph Representation

Abstract

In this paper, we analyze the slotted non-persistent CSMA protocol when the packet size follows a Poissonian distribution. To that purpose, we use a semi-Markov representation of the protocol and derive a closed form for the saturation throughput. The method can apply to a very large family of protocols and therefore unifies lots of results. The new formula for non-persistent CSMA with non unitary packet size present many interesting aspects