Star Local Area Networks: A Performance Study
IEEE Transactions on Computers
Approximate Analysis of Single and Multiple Ring Networks
IEEE Transactions on Computers
Utilizing Bandwidth Sharing in the Slotted Ring
IEEE Transactions on Computers
A Performance Modeling and Evaluation of the Cambridge Fast Ring
IEEE Transactions on Computers
Comparative Modeling and Evaluation of CC-NUMA and COMA on Hierarchical Ring Architectures
IEEE Transactions on Parallel and Distributed Systems
Hierarchical Ring Network Configuration and Performance Modeling
IEEE Transactions on Computers
An Algorithm for the Efficient Utilization of Bandwidth in the Slotted Ring
IEEE Transactions on Computers
A Multiclass Priority-Based Slotted-Ring LAN and its Analysis
IEEE Transactions on Computers
Performance and Configuration of Hierarchical Ring Networks for Multiprocessors
ICPP '97 Proceedings of the international Conference on Parallel Processing
A slot swapping protocol for time-critical internetworking
Journal of Systems Architecture: the EUROMICRO Journal
Research: Performance evaluation of the register insertion protocol for voice-data integration
Computer Communications
| Hi-index | 15.00 |
The performance of various access control protocols for bit-serial local area computer network (LACN) rings is studied. Applications in which mnessage packets are of fixed length and shorter than the total inherent propagation delay around the ring are the focus of attention. Token, slotted, and static and dynamic insertion rings are included in the study. In all cases, the transmitting station is responsible for removing its transmitted packet from the ring. Under this type of removal rule, it is possible for the stations of all types of ring structures to execute their access control algorithms with only a short fixed in-line delay in each station. The insertion rings dynamically switch longer delays (insertion registers) into the ring when they are transmitting a packet. The transmitter-remove rule operates in such a way that hogging of the ring transmission facility by a subset of stations cannot occur. Expressions that approximate average transfer time as a function of utilization are derived for all ring types and are checked by simulation. The expressions are found to be quite accurate at low ring utilization levels, which is the case of most importance for LACN's; but some of them exhibit significant errors at high utilization levels. For the assumed, short-packet environment, it is found that token rings exhibit the slowest transfer times, while dynamic insertion rings are fastest.