The Community for Technology Leaders
Green Image
<p>Timed-token protocols are used to handle, on the same local area network, both real-time and non-real-time traffic. The authors analyze this type of protocol, giving worst-case values for the throughput of non-real-time traffic and the average token rotation time. Results are obtained for synchronous traffic generated according to a generic periodic pattern under heavy conditions for non-real-time traffic and express not only theoretical lower bounds but values deriving from the analysis of some real networks. A model which addresses the asynchronous overrun problem is presented. The influence of introducing multiple priority classes for non-real-time traffic on the total throughput of this type of message is shown. It is also shown that the differences between the values obtained under worst-case assumptions are close to those obtained under best-case assumptions; the method may therefore be used to provide important guidelines inproperly tuning timed-token protocol parameters for each specific network installation.</p>
real-time traffic; timed token medium access protocols; local area network; non-real-time traffic; worst-case values; throughput; average token rotation time; synchronous traffic; generic periodic pattern; heavy conditions; theoretical lower bounds; real networks; asynchronous overrun problem; multiple priority classes; worst-case assumptions; best-case assumptions; timed-token protocol parameters; network installation; electronic messaging; protocols; token networks.

A. Valenzano, L. Ciminiera and P. Montuschi, "Some Properties of Timed Token Medium Access Protocols," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 858-869, 1990.
92 ms
(Ver 3.3 (11022016))