@inproceedings {Davik.2005.4,
	title = {Performance Evaluation and Improvement of Non-Stable Resilent Packet Ring Behavior},
	journal = {Proceedings of the 4th International Conference on Networking (ICN{\textquoteright}05), Reunion, France, April 17-21 2005},
	year = {2005},
	note = {ISSN 0302-9743, ISBN 3-540-25339-4},
	month = {April},
	pages = {551-563},
	publisher = {Springer-Verlag GmbH},
	type = {1},
	abstract = {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.},
	author = {Davik, Fredrik and Kvalbein, Amund and Gjessing, Stein},
	editor = {Lorenz, Pascal and Dini, Petre}
}
