Sixth International Conference on Computer Communications and Networks (ICCCN '97) Testing the Feasibility of Synchronous Bandwidth Allocation for Time-Critical Communication in FDDI Networks Las Vegas, NV September 22-September 25 ISBN: 0-8186-8186-1
One of the key issues related to deadline guarantees of synchronous messages in FDDI networks is the feasibility test of synchronous bandwidth allocation (SBA). Much work has been done on how to allocate synchronous bandwidth appropriately in order to guarantee synchronous messages transmission before their deadlines, and as a result quite a few SBA schemes have been proposed. In contrast, limited research has been done on how to effectively test the feasibility of a given allocation of synchronous bandwidths (i.e., whether or not a given allocation can guarantee the synchronous message set being considered), and the existing approach cannot always give an effective testing and may even produce wrong testing results. In this paper we present an algorithm of polynomial time worst-case complexity which ensures the correctness and effectiveness of the testing for any given synchronous message set with message deadlines equal to periods.
Index Terms:
Synchronous bandwidth allocation, synchronous messages, FDDI networks, timed token MAC protocol, real-time communications, feasibility test
Citation:
Sijing Zhang, Tee-Hiang Cheng, K.R. Subramanian, Liren Zhang, Chee Heng Tan, "Testing the Feasibility of Synchronous Bandwidth Allocation for Time-Critical Communication in FDDI Networks," icccn, pp.326, Sixth International Conference on Computer Communications and Networks (ICCCN '97), 1997 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||