Abstract
For high-speed networks, a new ring protocal is proposed in this paper. A ring network combined with destination removal can achieve much higher network throughput than the channel transmission rate. However, such a network exhibits fairness problems. Over a past few years, global fairness algorithms such as ATMR and Metaring have been proposed to solve such problems. But the ring access time delay and fairness in such networks are sensitive to the network parameters such as network size and traffic distribution. In addition to guaranteeing fair ring access to all nodes, there are several other important performance aspects in such networks. The one is that fairness is enforced while node throughputs are kept as high as possible. And another performance measure is access delay and more specifically Head-Of-Line(HOL) delay, i.e., the amount of time the first cell in the transmission buffer of a node has to wait before it accesses the ring. HOL delay is a mijor component in the transmission jitter of the synchronous traffic transmission. A key idea of the proposed ring protocol is to find the nodes that have much more chances to access the ring than any other nodes in the independently distributed node architecture. Since destined by many cells need to share a part of the bandwidths with the next node for the fairness in as much as performance degradation does not become critical. To investigate the performance behavior of the proposed ring protocol for various network condition,s several performance parameters wuch as ring access time delay, and throughput are compared with those of the ATMR and Metaring protocols using simulation package, SIMAN.