A simulation study on a high-speed slotted ring access mechanism with dynamically adaptive slot sizes

H.L. Pasch, I.G.M.M. Niemegeers

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)
    175 Downloads (Pure)

    Abstract

    Two access mechanisms complementary in performance are the token ring and the slotted ring. While the token ring outperforms the slotted ring for long messages, the latter performs significantly better for short messages. The paper shows that the factor that causes this difference is the number of tokens on the ring. It proposes a new network design in which the number of tokens has been made adaptive, resulting in a network that can be made to behave like both the token ring and the slotted ring, or anything in between, i.e. it performs optimally for any given message length. The paper presents first simulation results that show the performance gain that is achieved by using this principle. Further, it introduces a new priority mechanism in which an upper bound for the access delay of high priority messages is guaranteed
    Original languageEnglish
    Title of host publication16th Annual Conference on Local Computer Networks 1991
    Place of PublicationPiscataway, NJ
    PublisherIEEE
    Pages106-113
    Number of pages8
    ISBN (Print)0-8186-2370-5
    DOIs
    Publication statusPublished - 14 Oct 1991
    Event16th Annual Conference on Local Computer Networks, LCN 1991 - Minneapolis, United States
    Duration: 14 Oct 199117 Oct 1991
    Conference number: 16

    Conference

    Conference16th Annual Conference on Local Computer Networks, LCN 1991
    Abbreviated titleLCN
    Country/TerritoryUnited States
    CityMinneapolis
    Period14/10/9117/10/91

    Keywords

    • METIS-119467
    • IR-18945

    Fingerprint

    Dive into the research topics of 'A simulation study on a high-speed slotted ring access mechanism with dynamically adaptive slot sizes'. Together they form a unique fingerprint.

    Cite this