On the cost of fairness in ring networks
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
CRMA-II: a MAC protocol for ring based Gb/s LANs and MANs
Computer Networks and ISDN Systems - Special issue: media-access techniques for high-speed LANs and MANs
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Improved fairness algorithms for rings with spatial reuse
IEEE/ACM Transactions on Networking (TON)
A loop network for simultaneous transmission of variable-length messages
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
High Performance Fair Bandwidth Allocation Algorithm for Resilient Packet Ring
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Design, realization and evaluation of a component-based compositional software architecture for network simulation
Design, analysis, and implementation of DVSR: a fair high-performance protocol for packet rings
IEEE/ACM Transactions on Networking (TON)
IEEE 802.17 resilient packet ring tutorial
IEEE Communications Magazine
Active queue management for MAC client implementation of resilient packet rings
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Resilient Packet Ring (RPR) is a new networking standard developed by the IEEE LAN/MAN working group. RPR is an insertion buffer, dual ring technology, utilizing a back pressure based fairness algorithm to distribute bandwidth when congestion occurs. In its attempt to distribute bandwidth fairly, the calculated fair rate in general oscillates and under some conditions the oscillations continue indefinitely even under stable load conditions. In this paper, we evaluate the performance of the RPR ring during oscillations. In particular, we analyze transient behavior and how the oscillations of the fairness algorithm influence the throughput, both on a per node basis and for the total throughput of the ring. For congestion-situations, we conclude that, in most cases, RPR allows for full link-utilization and fair bandwidth distribution of the congested link. A modification to the RPR fairness algorithm has previously been proposed by the authors. We compare the improved fairness algorithm to the original, and find that the modified algorithm, for all evaluated scenarios perform at least as well as the original. In some problem scenarios, we find that the modified algorithm performs significantly better than the original.