Register-insertion: A protocol for the next generation of ring local-area networks

doi:10.1016/0169-7552(92)90084-4

Computer Networks and ISDN Systems

Volume 24, Issue 5, June 1992, Pages 349-366

Computer Networks an...

https://doi.org/10.1016/0169-7552(92)90084-4 Get rights and content

Abstract

The register-insertion ring is known for its high maximum throughput as well as its low average response time at medium and high loads. We develop a new analysis for the average response time of the register-insertion ring. The average waiting time (which is the most important component of the average response time estimate) is computed using a new queueing model. Also given is a partitioning scheme that can reduce the average response time by half and increase the maximum throughput by at least 60% of the media transmission rate. The partitioning scheme is analyzed, simulated, and compared with the performance of the regular register-insertion ring. Furthermore, the average response time of the register-insertion ring is compared with the lower bounds of the average response time for the token-passing and slotted rings. In particular, we derive an approximate formula for the throughput at which a register-insertion ring performs better than any token-passing ring. The formula shows that with a long average packet length the register-insertion ring can have a better average response time even at low loads.

References (17)

W Bux
Local-area subnetworks: a performance comparison
IEEE Trans. Comm.
(1981)
W Bux et al.
An approximate method for the performance analysis of buffer insertion rings
IEEE Trans. Comm.
(1983)
W Bux
Architecture and design of a reliable token-passing network
IEEE J. Selected Areas Comm.
(1983)
W Hilal et al.
Analysis and simulation of the register-insertion protocol
D Huber et al.
SILK: an implementation of a buffer insertion ring
IEEE J. Selected Areas Comm.
(1983)
IEEE Standard 802.5
Token Ring Access Methods and Physical Layer Specifications
L Kleinrock
M.T Liu et al.
Traffic analysis of the distributed loop computer network (DLCN)

There are more references available in the full text version of this article.

Cited by (8)

Performance evaluation of the register insertion protocol for voice-data integration
1997, Computer Communications
The performance of the register insertion protocol for mixed voice-data traffic is investigated by simulation. The simulation model incorporates a common insertion buffer for station and ring packets. Bandwidth allocation is achieved by imposing a queue limit at each node. A simple priority scheme is introduced by allowing the queue limit to vary from node to node. This enables voice traffic to be given priority over data. The effect on performance of various operational and design parameters such as ratio of voice to data traffic, queue limit and voice packet size is investigated. Comparisons are made where possible with related work on other protocols proposed for voice-data integration. The main conclusions are: (a) there is a general degradation of performance as the ratio of voice traffic to data traffic increases, (b) substantial improvement in performance can be achieved by restricting the queue length at data nodes and (c) for a given ring utilisation, smaller voice packets result in lower delays for both voice and data traffic.
Performance analysis of a register insertion ring with a variable size buffer
1997, Applied Mathematical Modelling
There has been a recent revival of interest in the register insertion (RI) protocol because of its high throughput and low delay characteristics. Several variants of the protocol have been investigated with a view to integrating voice and data applications on a single local area network (LAN). In this paper the performance of an RI ring with a variable size buffer is studied by modelling and simulation. The chief advantage of the proposed scheme is that an efficient but simple bandwidth allocation scheme is easily incorporated. Approximate formulas are derived for queue lengths, queueing times, and total end-to-end transfer delays. The results are compared with previous analyses and with simulation estimates. The effectiveness of the proposed protocol in ensuring fairness of access under conditions of heavy and unequal loading is investigated.
Study on a Broadband Fixed Wireless Access system based on Chordal Ring topology
2008, Proceedings - 2008 International Conference on Advanced Technologies for Communications, ATC 2008, Held in Conjunction with REV Meeting
The building, analyzing and simulating of a multimedia network based on CATV system
2000, IEEE Transactions on Broadcasting
Evaluation of real-time fiber communications for parallel collective operations
1999, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Performance of RCP-II
1997, Canadian Journal of Electrical and Computer Engineering

View all citing articles on Scopus

^☆: Research reported herein was supported in part by the U.S. Army Research Office under Contract No. DAAB07-88-K-A003. The views, opinions, and/or findings contained in this paper are those of the authors and should not be construed as an official Department of the Army position, policy or decision.

^∗∗: This study was performed when W.H. Bahaa-El-Din was with the University of Houston, University Park.

View full text

Register-insertion: A protocol for the next generation of ring local-area networks☆

Abstract

Local-area subnetworks: a performance comparison

IEEE Trans. Comm.

An approximate method for the performance analysis of buffer insertion rings

IEEE Trans. Comm.

Architecture and design of a reliable token-passing network

IEEE J. Selected Areas Comm.

Analysis and simulation of the register-insertion protocol

SILK: an implementation of a buffer insertion ring

IEEE J. Selected Areas Comm.

Token Ring Access Methods and Physical Layer Specifications

Traffic analysis of the distributed loop computer network (DLCN)