Paper Info
Title
Finding the minimum available transmission time for the timed token medium access control protocol
Abstract
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
Year
DOI
Venue
1999
10.1109/EMRTS.1999.777465
ECRTS
Keywords
Field
DocType
synchronous message set,network node,o(n)-time algorithm,fddi,access protocols,timed token medium access control protocol,minimum available transmission time,synchronous messages,real-time systems,real time systems,system testing,bandwidth,ring network,channel allocation,lower bound,test methods
Token passing,Computer science,Upper and lower bounds,Fiber Distributed Data Interface,Computer network,Token ring,Node (networking),Real-time computing,Transmission time,Security token,Token bus network,Distributed computing
Conference
ISSN
ISBN
Citations 
1068-3070
0-7695-0240-7
3
PageRank 
References 
Authors
0.53
9
4
Name
Order
Citations
PageRank
Sijing Zhang116323.40
E. Stewart Lee2609.22
Alan Burns373959.60
Hongji Yang41039137.37