A discrete-time, fixed-point performance model for the Orwell protocol with bursty arrivals

This paper describes a discrete-time Markov chain network model of a Slotted Ring operating under the Orwell protocol with a Bernoulli arrival process, comparable with a single type of data traffic. The accuracy of this model is compared favourably with simulation results. A simple set of rules are proposed to allow the Bernoulli arrivals model to be transformed to cater for more realistic, bursty types of traffic characterised by a multiple-state Markov modulated Bernoulli process