Abstract
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 properly 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 considered), and the existing approach cannot always give an effective test and may even produce wrong testing results. This paper presents 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.
| Original language | English |
|---|---|
| Pages | 326-331 |
| Number of pages | 6 |
| Publication status | Published - Dec 1 1997 |
| Event | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA Duration: Sept 22 1997 → Sept 25 1997 |
Other
| Other | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 |
|---|---|
| City | Las Vegas, NV, USA |
| Period | 9/22/97 → 9/25/97 |
ASJC Scopus subject areas
- Computer Science(all)