An algorithm for the efficient utilization of bandwidth in the slotted ring

The author presents an algorithm, in the form of a medium-access protocol, that allows for the efficient utilization of the bandwidth of the slotted ring local area network (LAN) with minimally added overhead. This algorithm results in an improved performance over the entire workload range and under most workload conditions, therefore illustrating how far the performance of the slotted ring can go. Stations may use any of a large number of short slots in order to transmit their messages. Instead of the identity of the transmitter and the intended recipient being included in every slot, they are only included in the first slot. Since the protocol is based on the release of slots by the destination stations, stations need to keep track of the users of the different slots in a distributed manner