Title :
Guaranteeing synchronous message deadlines with the timed token protocol
Author :
Agrawal, Gopal ; Chen, Baio ; Zhao, Wei ; Davari, Sadegh
Author_Institution :
Dept. of Comput. Sci., Texas A&M Univ., College Stastion, TX, USA
Abstract :
The problem of guaranteeing synchronous message deadlines in token ring networks in which the timed token medium access control protocol is used is discussed. Synchronous capacity, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. Several synchronous capacity allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. It is shown that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed, even if the synchronous traffic is extremely low. The normalized proportional allocation scheme, which can guarantee the synchronous message deadlines for synchronous traffic of up to 33% of available utilization is proposed
Keywords :
protocols; token networks; deadline constraints; normalized proportional allocation scheme; synchronous capacities; synchronous message deadlines; synchronous traffic; timed token medium access control protocol; timed token protocol; token ring networks; Access protocols; Application software; Computer science; FDDI; Lakes; Media Access Protocol; Optical fibers; Space stations; Spine; Token networks;
Conference_Titel :
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location :
Yokohama
Print_ISBN :
0-8186-2865-0
DOI :
10.1109/ICDCS.1992.235007