An efficient and practical local synchronous bandwidth allocation scheme for the timed-token MAC protocol

Authors:
Sijing Zhang;Alan Burns;Andy Wellings
Affiliations:
Department of Computer Science, University of York, UK;Department of Computer Science, University of York, UK;Department of Computer Science, University of York, UK
Venue:
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
Year:
1996

Citing 3
Cited 6

Synchronous bandwidth allocation in FDDI networks

MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol

IEEE Transactions on Computers
On the Schedulability of Synchronous Message Sets with the Minimum Message Deadline Less than 2*TTRT in an FDDI Network

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks

On the Effectiveness of the FDDI-M Medium Access Protocol for Real-Time Traffic

The Journal of Supercomputing - Special issue: high performance computing systems
Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol

Real-Time Systems
Hard Real-Time Communication with the Timed Token Protocol: Current State and Challenging Problems

Real-Time Systems
Time properties of the BuST protocol under the NPA budget allocation scheme

Proceedings of the conference on Design, automation and test in Europe
Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol

Computer Standards & Interfaces
The timely token protocol

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with deadline guarantees of synchronous messages with deadlines equal to periods, in a timed token ring network such as FDDI where the timed token medium access control (MAC) protocol is used. The timed token protocol guarantees a bounded access time and an average bandwidth for synchronous traffic. However, this guarantee alone, though necessary, is insufficient for guaranteeing the transmission of synchronous messages before their deadlines. To ensure timely delivery, the synchronous bandwidth must be carefully allocated to individual nodes. We propose and analyse an efficient and practical local synchronous bandwidth allocation (SBA) scheme. The new scheme performs better than any previously published as it calculates the synchronous bandwidth such that during the message period, the total synchronous transmission time definitely available (when judged only by local information) is exactly equal to the transmission time required. Our scheme also diffsers significantly from previously reported ones by explicitly taking into account the synchronous bandwidth allocation for message sets whose minimum message deadlines (Dmin) are less than twice the Target Token Rotation Time (ITRT), and consequently can apply to any synchronous message set (with Dmin TTRT). The feasibility of allocations produced by the proposed scheme and the worst case achievable utilisation of the scheme are also discussed.