Finding the minimum available transmission time for the timed token medium access control protocol

Exactly capturing the minimum available time for a network node to transmit its synchronous messages during any given length of time is important for guaranteeing the transmission of synchronous messages before their deadlines in a timed token ring network (such as FDDI) where the timed token medium access control protocol is used. Previous results which only give a lower bound on the minimum transmission time could be too pessimistic for supporting the timely delivery of synchronous traffic in a hard real-time communication environment. This paper presents an O(n)-time algorithm for exactly determining the minimum available transmission time. The algorithm can be used to test whether or not a given allocation of synchronous bandwidths can guarantee a synchronous message set with message deadlines no more than periods; the test so formed is better than any previous testing method whose test is sufficient only, in the sense that it is both sufficient and necessary and therefore optimal.

[1]  Wei Zhao,et al.  Optimal synchronous capacity allocation for hard real-time communications with the timed token protocol , 1992, [1992] Proceedings Real-Time Systems Symposium.

[2]  Kang G. Shin,et al.  A polynomial-time optimal synchronous bandwidth allocation scheme for the timed-token MAC protocol , 1995, Proceedings of INFOCOM'95.

[3]  Alan Burns,et al.  An optimal synchronous bandwidth allocation scheme for guaranteeing synchronous message deadlines with the timed-token MAC protocol , 1995, TNET.

[4]  Alan Burns,et al.  An efficient and practical local synchronous bandwidth allocation scheme for the timed-token MAC protocol , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  Hongji Yang,et al.  Improving the normalized proportional allocation scheme for time-critical communication in FDDI networks , 1997, Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat..

[6]  Sijing Zhang,et al.  Testing the feasibility of synchronous bandwidth allocation for time-critical communication in FDDI networks , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[7]  Wei Zhao,et al.  Local synchronous capacity allocation schemes for guaranteeing message deadlines with the timed token protocol , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[8]  Alan Burns,et al.  On the schedulability of synchronous message sets with the minimum message deadline less than 2/spl middot/TTRT in an FDDI network , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[9]  Wei Zhao,et al.  Guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network , 1993, 1993 18th Conference on Local Computer Networks.

[10]  Sijing Zhang,et al.  The worst-case scenario for transmission of synchronous traffic in an FDDI network , 1999, Proceedings 24th Conference on Local Computer Networks. LCN'99.

[11]  Wei Zhao,et al.  Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol , 1994, IEEE Trans. Computers.