Guaranteeing synchronous message deadlines in high speed token ring networks with timed token protocol /
Abstract: "We study the problem of guaranteeing synchronous message deadlines in high speed token ring networks where the timed token medium access control protocol is employed. Synchronous capacity, defined as the maximum time a node can transmit its synchronous message every time it receives...
| Other Authors: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1991]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
91-042. |
| Subjects: |
| Summary: | Abstract: "We study the problem of guaranteeing synchronous message deadlines in high speed token ring networks where the timed token medium access control protocol is employed. Synchronous capacity, defined as the maximum time a node can transmit its synchronous message 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. We address the issues of appropriate allocations of the synchronous capacities. Several synchronous capacity allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. We show that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed, even when the synchronous traffic is extremely low. We propose a scheme, called the Normalized Proportional Allocation Scheme, which can guarantee the synchronous message deadlines for the synchronous traffic up to 33%. Another major contribution of this paper is an extension to the previous work on the bounded token rotation time. We prove that the time elapsed between any m consecutive visits to a particular node is bounded by m·TTRT where TTRT is the target token rotation time set up at system initialization time. We use this result in the analysis of various synchronous allocation schemes. It can also be applied in other similar studies." |
|---|---|
| Item Description: | "October 1991." |
| Physical Description: | 22 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |