Testing the feasibility of synchronous bandwidth allocation for time-critical communication in FDDI networks

Sijing Zhang, Tee Hiang Cheng, K. R. Subramanian, Liren Zhang, Chee Heng Tan

    Research output: Contribution to conferencePaperpeer-review

    4 Citations (Scopus)

    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 languageEnglish
    Pages326-331
    Number of pages6
    Publication statusPublished - Dec 1 1997
    EventProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA
    Duration: Sep 22 1997Sep 25 1997

    Other

    OtherProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97
    CityLas Vegas, NV, USA
    Period9/22/979/25/97

    ASJC Scopus subject areas

    • Computer Science(all)

    Fingerprint

    Dive into the research topics of 'Testing the feasibility of synchronous bandwidth allocation for time-critical communication in FDDI networks'. Together they form a unique fingerprint.

    Cite this