This paper presents a performance analysis of slotted rings.The analysis is carried out under the same assumptions as those given for token rings, register insertion rings and RIS rings which we analyzed before. In particular, we assume that each node has a finite buffer space in order to calculate the probability of buffer overflow. This uniform set of assumptions makes it possible to compare the analytical results to each other. The analytical results are shown to be accurate by comparing them with simulation results. We also compare the performance of those protocols to determine which is the most suitable protocol for a high--speed LAN environment.