Summary: 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.