Abstract
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.
Highlights
One of the major challenges in a ring protocol like Resilient Packet Ring (RPR) is to allocate fair bandwidth for the nodes
Since RPR is proposed as a Metropolitan Area network (MAN) and WAN Protocol, it needs to overcome the problems of Wide Area Networks such as Fairness and Congestion control while the system has high link delay and large number of nodes
In our proposed solution all the active nodes are involved in achieving fair rate and congested queue control so the nearby active nodes help the congested node in avoiding the congestion, which prevents the congested node from shutting down its own traffic
Summary
By: Hossein Ghandehari-Alavijeh BSc. in Electrical and Computer Engineering, lUST, Iran, 1992. The quality of this reproduction is dependent upon the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. I hereby declare that I am the sole author of this thesis. I authorize Ryerson University to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize Ryerson University to reproduce this thesis by photocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
