On Markov Chain Modelling of Asynchronous Optical CSMA/CA Protocol

This paper presents a novel model to analyze the performance of the asynchronous optical CSMA/CA protocol with variable packet sizes. The model combines Continuous Time Markov Chain (CTMC) approach and probabilistic approximation for FIFO scheduling. Realistic simulation models were developed in order to identify the difficulties in modelling CSMA/CA scheme and to show the errors introduced by the probabilistic service discipline. Although the service discipline is approximate, the proposed model includes all factors felt to be important in dimensioning the memory size at access points so as to meet access delay and throughput criteria.