This paper proposes an improved dynamic bandwidth allocation algorithm for dual Quality of Service (QoS) classes to maximize the utilization rate of the Resilient Packet Ring (RPR). To achieve dynamic bandwidth allocation for the two QoS classes in the RPR, each node measures the high priority traffic flow and assigns the appropriate bandwidth; the remaining bandwidth is used for low priority traffic. It passes a control frame containing the measured bandwidth of the high priority traffic to the other nodes. Based on the advertised high priority traffic bandwidth, any node that is congested transmits, to the other nodes, a fairness message to fairly allocate the remaining low priority bandwidth. Simulations demonstrate that the proposed algorithm enhances the utilization rate and reduces the delay of high priority frames.

Metro networks are based on SONET/SDH which uses the circuit switching technology. Circuit switching is inappropriate for the Internet traffic which is very bursty nature. Therefore, metro networks can become a bottleneck. In order to resolve this problem, the IEEE 802.17 working group has proposed the Resilient Packet Ring (RPR) technology. In order to provide fairness among stations in the RPR network, two types of RPR fairness mechanisms have been defined. However, the IEEE 802.17 RPR fairness mechanisms have the problem of inefficient use of the available bandwidth after the congestion at a node has been resolved. In this paper, we propose an improved bandwidth allocation in which, after the congestion resolution at a node, the node estimates the number of effective nodes transmitting traffic, measures the remaining bandwidth and fairly allocates the available bandwidth to effective nodes. To show the performance of our proposed mechanism, we have performed simulation and show that the proposed mechanism gives higher bandwidth utilization than the existing RPR fairness mechanisms.

Resilient Packet Ring (RPR) is a new technology currently being standardized in the IEEE 802.17 working group. The existed bandwidth allocation algorithms for RPR networks are not able to provide satisfactory solutions to meet the performance requirements. In this paper we propose one fair bandwidth allocation algorithm, termed PID-RPR, which satisfies the performance goals of RPR networks, such as fairness, high utilization and maximal spatial reuse. The algorithm is operated at each RPR node in a distributive way; the proportional, integral and differential (PID) controller is used to allocate bandwidth on the outgoing link of the node for the flows over the link in a weighted manner. To achieve the global coordination, one control packet containing every node's message runs around the ring in order to update the relevant message for all nodes on the ring. When the packet reaches one node, this node adjusts its own rate according to its own message in the control packet; in the meantime it updates other nodes' control message in the control packet. As the control packet propagates around the ring, each node can eventually adjust its sending rate to reach its fair share according to the fairness criterion, and the buffer occupancy at each node is kept within the target value. Our algorithm is of distributed nature in the sense that upstream ring nodes inject traffic at a rate according to congestion and fairness criteria downstream. The simulation results demonstrate that satisfactory performance of RPR networks can be achieved under the proposed bandwidth allocation scheme.

The fairness algorithm of the Resilient Packet Ring IEEE 802.17 standard suffers from throughput degradation under an unbalanced overload. This letter proposes an enhanced fairness algorithm using a valuable piece of information, represented by the transit buffer length, about congestion alleviation on a congested node, under which the throughput degradation can be completely improved.