@inproceedings {Davik.2005.1,
	title = {An Analytical Bound for Convergence of the Resilient Packet Ring Aggressive Mode Fairness Algorithm},
	journal = {Proceedings of the 40th annual IEEE International Conference on Communications, Seoul, Korea, May 16-20},
	year = {2005},
	note = {ISBN 0-7803-8938-7},
	month = {May},
	publisher = {IEEE},
	type = {1},
	abstract = {Resilient Packet Ring (RPR) is a new standard, designated IEEE standard number 802.17, for MAN and WAN dual ring topologies. RPR uses the buffer insertion principle as a basis for its medium access control protocol. In this paper, we analyze parts of the aggressive mode of the RPR fairness protocol. We look at a congested node, and utilize control systems theory to analyze the stability of the associated fairness algorithm. In particular, we discuss how the settings of the two important parameters ageCoef and lpCoef influence the stability of an RPR-network. At the end of the paper we present simulated scenarios in order to illustrate our results.},
	author = {Davik, Fredrik and Kvalbein, Amund and Gjessing, Stein}
}
@inproceedings {Davik.2005.2,
	title = {Applying the DiffServ Model to a Resilient Packet Ring Network},
	journal = {Proceedings of Networking 2005, Waterloo, Ontario, Canada May 2-6},
	year = {2005},
	note = {ISSN 0302-9743, ISBN 3-540-25809-4},
	month = {May},
	pages = {1461-1464},
	publisher = {Springer},
	type = {1},
	abstract = {In this paper we introduce a formal specification of parts of the service differentiation mechanisms of the recent IEEE 802.17 Resilient Packet Ring (RPR) standard, and assess RPR{\textquoteright}s suitability for use in a DiffServ environment. We propose a simple mapping between RPR{\textquoteright}s traffic classes and three standardized DiffServ Per Hop Behavior groups. When using this mapping, we discuss, by use of an analytical example and simulation results, the behavior of the traffic assigned to each PHB group in terms of its throughput (all PHBs) and delay properties (for the EF PHB only). For the simulation part, we use our OPNET implementation of the RPR standard.},
	author = {Davik, Fredrik and Gjessing, Stein},
	editor = {Boutaba, R.}
}
@techreport {Davik.2005.9,
	title = {Applying the DiffServ Model to a Resilient Packet Ring Network},
	number = {2005-01},
	year = {2005},
	month = {February 2005},
	publisher = {Simula Research Laboratory},
	abstract = {In June 2004, the IEEE approved a new standard called Resilient Packet Ring (RPR), that is maintained in the 802 LAN/MAN Committee and designated standard number IEEE 802.17-2004. Among the features provided by the RPR technology are built-in QoS capabilities for traffic class differentiation, bidirectional transfer of data with destination stripping and spatial reuse and fast protection against node and link failure(s). In this paper, we introduce a framework used to specify the throughput of RPR, and propose a simple mapping between RPR\&$\#$39;s service classes and DiffServ Per Hop Behavior groups. We evaluate this mapping analytically, using a simple generic example, and by simulation using some selected scenarios. All our findings support that our proposed mapping between RPR\&$\#$39;s traffic classes and the PHB groups is indeed a viable one.},
	author = {Davik, Fredrik and Gjessing, Stein}
}
@techreport {Davik.2005.5,
	title = {Congestion Domain Boundaries in Resilient Packet Rings},
	number = {2005-03},
	year = {2005},
	month = {February 2005},
	publisher = {Simula Research Laboratory},
	abstract = {In June 2004, the IEEE approved a new standard for Resilient Packet Rings (RPR). The standard is maintained in the 802 LAN/MAN Standards Committee, and is designated the standard number 802.17. In this paper, we analyze and discuss performance aspects of the Resilient Packet Ring fairness mechanism. We explain that, if the ring is not configured correctly, the fairness mechanism fails to stabilize at a fair division of bandwidth between the active nodes. We present a novel addition to the fairness algorithm, and show that with this modification, RPR reaches a stable state with more optimal parameter settings. We also show that our proposed modification gives shorter convergence time for the Resilient Packet Ring fairness algorithm.},
	author = {Davik, Fredrik and Kvalbein, Amund and Gjessing, Stein}
}
@techreport {Davik.2005.6,
	title = {Improvement of Resilient Packet Ring Fairness},
	number = {2005-02},
	year = {2005},
	month = {February},
	publisher = {Simula Research Laboratory},
	abstract = {Resilient Packet Ring (RPR) is a recent 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. The fairness algorithm has two modes of operation, called respectively the aggressive and the conservative fairness modes. For some scenarios, the aggressive mode fairness suffers from severe performance deficiencies. In this paper, we propose two novel contributions. The first is a measurement method which enables a node to determine its operating context. The second contribution is a fair rate calculation method, termed the moderate fairness mode, which solves the aggressive mode performance deficiencies while retaining several other properties provided by the aggressive mode fairness. We compare the performance of the moderate fairness mode to that of the aggressive and the conservative modes by simulations, and find that for some scenarios the moderate mode outperforms the aggressive and the conservative modes. For some other scenarios, the convergence time of the moderate mode is somewhat longer than that of the aggressive mode.},
	author = {Davik, Fredrik and Gjessing, Stein}
}
@inproceedings {Davik.2005.7,
	title = {Improvement of Resilient Packet Ring Fairness},
	journal = {Proceedings of the 48th annual IEEE Global Telecommunications Conference (GLOBECOM 2005), St. Lous, Missouri, USA, November 28-December 2},
	year = {2005},
	note = {ISBN 0-7803-9414-3},
	month = {November},
	publisher = {IEEE},
	type = {1},
	abstract = {Resilient Packet Ring (RPR, IEEE std. 802.17- 2004) is a recent 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 control a set of nodes sending behavior over a congested link, the RPR fairness algorithm suffers from two severe performance deficiencies. The first concerns how the node closest to a congested link calculates a fair rate estimate, the second deficiency relates to the method used to distribute this fair rate estimate to nodes upstream from the congested node. In this paper, we analyze these deficiencies and propose improvements to resolve them.},
	author = {Davik, Fredrik and Kvalbein, Amund and Gjessing, Stein}
}
@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}
}
@inproceedings {Davik.2005.3,
	title = {Resilent Packet Ring Low Priority Traffic Latency},
	journal = {Proceedings of the 2005 International Conference on Communications in Computing: CIC 2005, Los Angeles CA, USA, February 2-4},
	year = {2005},
	note = {ISBN-1-932415-48-3},
	month = {June},
	publisher = {CSREA Press},
	type = {1},
	abstract = {Resilient Packet Ring (RPR - IEEE 802.17) is an insertion buffer, dual ring technology, utilizing a back pressure based fairness algorithm to distribute bandwidth when congestion occurs. The fairness algorithm may oscillate and under some conditions the oscillations continue indefinitely even under stable load conditions. In this paper, we evaluate the latency experienced by packets sent during such oscillations. We analyze transient behavior and how the oscillations of the fairness algorithm influence the jitter caused by unfair access to the ring, as well as jitter caused by the insertion buffers around the ring. We conclude that, in most cases, latency and jitter are within acceptable bounds. A modification to the RPR fairness algorithm has previously been proposed by the authors, but its implications on latency has never before been demonstrated. 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 with respect to latency and jitter. 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}
}
@techreport {Davik.2004.1,
	title = {Applying the DiffServ Model to a Resilient Packet Ring Network},
	number = {2004-14},
	year = {2004},
	publisher = {Simula Research Laboratory},
	author = {Davik, Fredrik and Gjessing, Stein}
}
