A polynomial-time optimal synchronous bandwidth allocation scheme for the timed-token MAC protocol

Authors:
Ching-Chih Han;K. G. Shin
Affiliations:
-;-
Venue:
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Year:
1995

Citing 0
Cited 8

On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks

IEEE Transactions on Computers
Allocation of Periodic Task Modules with Precedence and Deadline Constraints in Distributed Real-Time Systems

IEEE Transactions on Computers
Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model

IEEE Transactions on Computers
Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol

Real-Time Systems
Pfair Scheduling of Generalized Pinwheel Task Systems

IEEE Transactions on Computers
Hard Real-Time Communication with the Timed Token Protocol: Current State and Challenging Problems

Real-Time Systems
Cycle time properties of the PROFIBUS timed-token protocol

Computer Communications
The timely token protocol

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Numerous methods have been proposed to integrate real-time and non-real-time services of the timed-token medium access control (MAC) protocol. One of the key issues in tailoring the timed-token MAC protocol for real-time applications is the synchronous bandwidth allocation (SEA) problem whose objective is to meet both the protocol and deadline constraints. Several non-optimal local SEA schemes and an optimal global scheme have been proposed previously. Local SEA schemes use only information available locally to each node, and are thus preferred to global schemes because of their lower network-management overhead. Unfortunately it has been formally proved in Han et al. (1995) that there does not exist any optimal local SEA scheme. Chen et al. [1992] proposed the only-known optimal global SEA scheme which is based on an iterative approach. However, their algorithm may not terminate theoretically. The present authors give an optimal global SEA scheme of polynomial-time worst-case complexity.