Cycle Time Properties Of The FDDI Token Ring Protocol
IEEE Transactions on Software Engineering
Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Some Properties of Timed Token Medium Access Protocols
IEEE Transactions on Software Engineering
Synchronous bandwidth allocation in FDDI networks
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol
IEEE Transactions on Computers
IEEE Transactions on Computers
Guaranteeing hard real-time traffic constraints with ATM networks
Integrated Computer-Aided Engineering
Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol
Computer Standards & Interfaces
| Hi-index | 14.99 |
One of the key issues in tailoring the timed-token MAC protocol for real-time applications is synchronous bandwidth allocation (SBA), whose objective is to meet both the protocol and deadline constraints. The former constraint requires that the total time allocated to all nodes for transmitting synchronous messages should not exceed the target token rotation time. The latter constraint requires that the minimum time available for a node to transmit its synchronous messages before their deadlines should be no less than the maximum message transmission time. Several nonoptimal local SBA schemes and an optimal global SBA scheme have been proposed [1], [2], [3], [8], [17], [29]. Local SBA schemes use only information available locally to each node and are thus preferred to global schemes because of their lower network-management overhead. If optimal local SBA schemes, if any, can be devised, they will be superior to their global counterparts both in performance and in ease of network management. In this paper, we formally prove that there does not exist any optimal local SBA scheme. We also propose an optimal global SBA scheme which has an $O(nM)$ polynomial-time worst-case complexity, where $n$ is the number of synchronous message streams in the system and $M$ is the time complexity for solving a linear programming problem with $3n$ constraints and $n$ variables.