HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Analysis of timed-token ring protocols

Abstract : We analyze in this paper the performance of Token Ring Protocols with constraints on the cycle times. Each stations may have a different cycle time constraint, and a different number of buffers. We consider two types of service discipline in the different stations: (i) the 1-limited case, xhare at most one packet may be transmitted from each queue at each visit of the token and (ii) the exhaustive service discipline where in each queue, packets are transmitted till either the queue empties or the cycle time constraint in that queue is exceeded. The system we analyze approximates both the FDDI protocol (Fiber Distributed Data Interface) and the IEEE 802.4 Token Bus Standard. The technique of the analysis is based on the power-series expansions of the state probabilities as functions of the load of the system, a method introduced by Blanc [3] for analyzing multi dimensional queuing systems. We obtain the expected throughput and delay in every station, as well as the first two moments of the queues' length.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 5:10:02 PM
Last modification on : Friday, February 4, 2022 - 3:14:53 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 8:28:24 PM


  • HAL Id : inria-00074991, version 1



Eitan Altman. Analysis of timed-token ring protocols. [Research Report] RR-1570, INRIA. 1991, pp.23. ⟨inria-00074991⟩



Record views


Files downloads