Synchronous bandwidth allocation in FDDI networks
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
FDDI handbook: high-speed networking using fiber and other media
FDDI handbook: high-speed networking using fiber and other media
Selection of timed token protocol parameters to guarantee message deadlines
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol
IEEE Transactions on Computers
The Worst-Case Scenario for Transmission of Synchronous Traffic in an FDDI Network
LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
A polynomial-time optimal synchronous bandwidth allocation scheme for the timed-token MAC protocol
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.00 |
One of the key issues related to guaranteeing synchronous message deadlines in a timed token network (such as fiber distributed data interface) where the timed token medium access control protocol is used is the schedulability test of synchronous traffic (i.e., testing whether or not all synchronous messages can be transmitted before their deadlines, under a given setting of network parameters). Much work has been done on how to assign network parameters appropriately in order to guarantee timely transmission of synchronous traffic. As a result quite a few synchronous bandwidth allocation schemes and some good guidelines on selection of the target token rotation time have been proposed. In contrast, limited research has been conducted on how to effectively test whether or not given network parameters can guarantee timely transmission of all synchronous messages (of a considered synchronous message set) before their deadlines. The previous testing methods for synchronous message schedulability only provide a sufficient (but not necessary) test and therefore fail to always keep effective for any synchronous message set considered. In this paper, we propose two testing methods for determining the schedulability of a synchronous message set with message deadlines no longer than periods. The proposed tests perform better than any previous test in the sense that they are both sufficient and necessary. Some numerical examples are given to compare different testing methods, all of which have demonstrated the superiority of the proposed tests to other existing testing methods.