Token Ring

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 258 Experts worldwide ranked by ideXlab platform

S. Stidham - One of the best experts on this subject based on the ideXlab platform.

  • A queueing model for optimal segmentation of a Token-Ring local area network
    Proceedings of 35th IEEE Conference on Decision and Control, 1996
    Co-Authors: S. Stidham
    Abstract:

    As nodes are added to a Token-Ring LAN and compete for the Token, the system may experience intolerable congestion or even become unstable. Following Husselbaugh (1995), we use a simple M/GI/1 queueing model to analyse whether a LAN with symmetric traffic should be segmented into subnetworks connected by a bridge. Our model accurately represents traffic as a function of the number of nodes in each segment and explicitly considers the trade off between reduced congestion and the cost of a bridge. We compare our model to the multi-class polling models in the literature on Token-Ring LANS.

Jesper Nilausen - One of the best experts on this subject based on the ideXlab platform.

T. Toher - One of the best experts on this subject based on the ideXlab platform.

W Zhao - One of the best experts on this subject based on the ideXlab platform.

  • a comparative study of three Token Ring protocols for real time communications
    International Conference on Distributed Computing Systems, 1991
    Co-Authors: W Zhao
    Abstract:

    When developing distributed scheduling algorithms such as communication protocols, issues in achieving optimal policy and minimizing overhead must be addressed. This problem is examined in the context of a specific distributed system-the Token Ring communication network. Three Token Ring protocols are considered which are representative of many existing ones in the sense that they incorporate message time constraints at different levels and implement the earliest deadline first transmission (scheduling) policy at different degrees with different overheads. Through a worst-case analysis, the performance of these three Token Ring protocols is compared. It is concluded that to evaluate a distributed scheduling algorithm such as a communication protocol, it is necessary to not only consider the scheduling policy employed but also to take into account the overhead incurred due to the implementation of the scheduling policy. >

  • ICDCS - A comparative study of three Token Ring protocols for real-time communications
    [1991] Proceedings. 11th International Conference on Distributed Computing Systems, 1991
    Co-Authors: W Zhao
    Abstract:

    When developing distributed scheduling algorithms such as communication protocols, issues in achieving optimal policy and minimizing overhead must be addressed. This problem is examined in the context of a specific distributed system-the Token Ring communication network. Three Token Ring protocols are considered which are representative of many existing ones in the sense that they incorporate message time constraints at different levels and implement the earliest deadline first transmission (scheduling) policy at different degrees with different overheads. Through a worst-case analysis, the performance of these three Token Ring protocols is compared. It is concluded that to evaluate a distributed scheduling algorithm such as a communication protocol, it is necessary to not only consider the scheduling policy employed but also to take into account the overhead incurred due to the implementation of the scheduling policy. >

M. Velauthapillai - One of the best experts on this subject based on the ideXlab platform.

  • ICNP - Dynamics of Token Ring protocols
    Proceedings of ICNP - 1994 International Conference on Network Protocols, 1994
    Co-Authors: J.g. Waclawsky, M. Velauthapillai
    Abstract:

    We present a new approach for analyzing Token Ring LANs. The Token Ring model presented supports the behavior obtained from actual Ring measurements. Using this model, employing deterministic bounds analysis techniques, we prove several theorems which lead to some interesting conclusions that support observed Ring performance. The results obtained give insight into practical behavior of a Token Ring environments. >

  • Dynamics of Token Ring protocols
    Proceedings of ICNP - 1994 International Conference on Network Protocols, 1994
    Co-Authors: J.g. Waclawsky, M. Velauthapillai
    Abstract:

    We present a new approach for analyzing Token Ring LANs. The Token Ring model presented supports the behavior obtained from actual Ring measurements. Using this model, employing deterministic bounds analysis techniques, we prove several theorems which lead to some interesting conclusions that support observed Ring performance. The results obtained give insight into practical behavior of a Token Ring environments.