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.
Type de document :
[Research Report] RR-1570, INRIA. 1991, pp.23
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:10:02
Dernière modification le : samedi 27 janvier 2018 - 01:31:34
Document(s) archivé(s) le : mardi 12 avril 2011 - 20:28:24



  • HAL Id : inria-00074991, version 1



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



Consultations de la notice


Téléchargements de fichiers