Cycle Time Properties Of The FDDI Token Ring Protocol
IEEE Transactions on Software Engineering
Simulation and performance evaluation of 802.4 priority scheme
1987 Symposium on the simulation of computer networks on Simulation of computer networks
Design, implementation, and evaluation of a software-based real-time Ethernet protocol
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol
IEEE Transactions on Computers
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol
IEEE Transactions on Computers
Group Allocation Multiple Access with Collision Detection
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
| Hi-index | 0.01 |
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.