Token-cycle time characteristics of FDDI networks with multiple classes of traffic

The performance of the timer-based priority scheme of the fiber distributed data interface (FDDI) network is investigated. The token-cycle time distribution illustrating the mechanics of the priority scheme is presented. Analytical expressions are given to evaluate the first and the second moments of the token-cycle time for FDDI networks with multiple classes of traffic. An iterative procedure that uses the knowledge of the throughput characteristics is utilized to solve these analytical expressions. The worst case confidance intervals are given. Simulation results are presented for homogeneous and heterogeneous networks with multiple classes of traffic highlighting the token-cycle time variation when the network load changes from a low value to a substantially high value