A Novel Control Theoretic Model for Resilient Packet Ring (RPR) Fairness

Resilient Packet Ring (RPR) is a new Data Link Layer ring protocol. In RPR, the ring is a shared medium for multiple nodes compete to get a portion of shared bandwidth. Fairness algorithm is responsible for allocating fair bandwidth among competing nodes. In our research, we address the stability problems of the current RPR Fairness and introduce a new solution. The present work is the first control theoretic approach to RPR Fairness and Congestion Control that rigorously models the dynamics of RPR Fairness algorithm by using control theory. The key idea is to involve the active nodes in the Fairness and Queue Congestion Control process which means developing a decentralized control system. In RPR, when the number of nodes or the distance between the RPR nodes is high, the delay plays an important role in the behavior of the fairness which may lead to oscillation, instability and packet loss. We propose the implementation of Smith predictor as a valuable technique to overcome the effects of this delay and achieve higher throughput. Our new theoretical insights allow us to design fairness and congestion control algorithms that achieve fair bandwidth allocation and high throughput with small buffer requirement even in presence of large delay and large number of active nodes in the ring.

A Novel Control Theoretic Model for Resilient Packet Ring (RPR) Fairness

Resilient Packet Ring (RPR) is a new Data Link Layer ring protocol. In RPR, the ring is a shared medium for multiple nodes compete to get a portion of shared bandwidth. Fairness algorithm is responsible for allocating fair bandwidth among competing nodes. In our research, we address the stability problems of the current RPR Fairness and introduce a new solution. The present work is the first control theoretic approach to RPR Fairness and Congestion Control that rigorously models the dynamics of RPR Fairness algorithm by using control theory. The key idea is to involve the active nodes in the Fairness and Queue Congestion Control process which means developing a decentralized control system. In RPR, when the number of nodes or the distance between the RPR nodes is high, the delay plays an important role in the behavior of the fairness which may lead to oscillation, instability and packet loss. We propose the implementation of Smith predictor as a valuable technique to overcome the effects of this delay and achieve higher throughput. Our new theoretical insights allow us to design fairness and congestion control algorithms that achieve fair bandwidth allocation and high throughput with small buffer requirement even in presence of large delay and large number of active nodes in the ring.

Study Of Resilient Packet Ring Based On OPNET

Resilient Packet Ring (RPR) is the next generation layer-2 protocol optimized for transporting data traffic rather than circuit-based traffic. In this thesis, we design and evaluate our own RPR simulation model that is fully compliant with the latest proposal promoted by IEEE 802.17 Work Group. By using this model, we investigate the limitations of the fairness control algorithms proposed by IEEE 802.17 WG. An alternative design, namely, Fuzzy Logic Control, is considered to overcome the shortcomings. Real world scenarious are simulated using this new approach. The simulation results justify the application of this new RPR model, and support its validity. Furthermore, by using this model we also derived an equation to calculate Fairness Round Trip Time (FRTT), which is a key parameter in designing an appropriated size for Secondary Transit Queue (STQ) in RPR. This equation overcomes the limitations proposed by IEEE 802.17 Work Group.

Study Of Resilient Packet Ring Based On OPNET

Resilient Packet Ring (RPR) is the next generation layer-2 protocol optimized for transporting data traffic rather than circuit-based traffic. In this thesis, we design and evaluate our own RPR simulation model that is fully compliant with the latest proposal promoted by IEEE 802.17 Work Group. By using this model, we investigate the limitations of the fairness control algorithms proposed by IEEE 802.17 WG. An alternative design, namely, Fuzzy Logic Control, is considered to overcome the shortcomings. Real world scenarious are simulated using this new approach. The simulation results justify the application of this new RPR model, and support its validity. Furthermore, by using this model we also derived an equation to calculate Fairness Round Trip Time (FRTT), which is a key parameter in designing an appropriated size for Secondary Transit Queue (STQ) in RPR. This equation overcomes the limitations proposed by IEEE 802.17 Work Group.