Computing Estimates Of Waiting Times In Ring Local Area Networks With Priority Classes.

A heuristic algorithm for evaluating average waiting times for asymmetric ring local area networks with priority classes is presented. The algorithm extends the model proposed by R. Berry and M. Chandy for rings with FCFS queues. The average waiting time for each priority class in each site of the network is computed using iterative formulation with rapid convergence. Numerical comparison results of the algorithm with a SLAM simulation model are presented for three different data transmission protocols