DocumentCode
458639
Title
Analysis of the Slotted Non-persistent CSMA Protocol with Poissonian Packet Size Using a Semi-Markov Graph Representation
Author
Galtier, Jérôme
Author_Institution
France Telecom R&D
Volume
3
fYear
2006
fDate
38869
Firstpage
258
Lastpage
262
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
Keywords
Markov processes; Poisson distribution; carrier sense multiple access; graph theory; protocols; Poissonian distribution; Poissonian packet size; semi-Markov graph representation; slotted nonpersistent CSMA protocol; Access protocols; Calculus; Ethernet networks; Multiaccess communication; Performance analysis; Propagation delay; Research and development; Stochastic processes; Telecommunications; Throughput; Protocol analysis; graph representation; poissonian process; semi-Markov process; slotted non-persistent CSMA;
fLanguage
English
Publisher
ieee
Conference_Titel
Transparent Optical Networks, 2006 International Conference on
Conference_Location
Nottingham
Print_ISBN
1-4244-0235-2
Electronic_ISBN
1-4244-0236-0
Type
conf
DOI
10.1109/ICTON.2006.248447
Filename
4013844
Link To Document