Performance evaluation of prioritized collision-avoidance star local area networks

Abstract

A two-class prioritized collision-avoidance star local area network (CASLAN) protocol is proposed and analyzed. The retry time of a node is used for priority assignment. A three-dimensional Markovian chain is used to model the CASLAN which is represented by a polling system in which the central node chooses at random one of the idle or ready nodes. Numerical results from the analytical model are presented, and these results are compared to results from a simulation model. The simulation results show that the model yields very accurate results at light to medium offered load. At heavy load, however, the analytical results are not always accurate.<>