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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
IEEE Computer Society: IEEE Std 802.17-2004 (2004)
Davik, F., Yilmaz, M., Gjessing, S., Uzun, N.: IEEE 802.17 Resilient Packet Ring Tutorial. IEEE Commun. Mag. 42, 112–118 (2004)
Hafner, E., Nendal, Z., Tschanz, M.: A Digital Loop Communication System. IEEE Trans. Commun. 22, 877–881 (1974)
Reames, C.C., Liu, M.T.: A Loop Network for Simultaneous Transmission of Variable-length Messages. In: Proceedings of the 2nd Annual Symposium on Computer Architecture, vol. 3 (1974)
Van-As, H., Lemppenau, W., Schindler, H., Zafiropulo, P.: CRMA-II a MAC protocol for ring-based Gb/s LANs and MANs. Computer-Networks-and-ISDN-Systems 26, 831–40 (1994)
Cidon, I., Ofek, Y.: MetaRing - A Full Duplex Ring with Fairness and Spatial Reuse. IEEE Trans. Commun. 41, 110–120 (1993)
Davik, F., Gjessing, S.: The Stability of the Resilient Packet Ring Aggressive Fairness Algorithm. In: Proceedings of The 13th IEEE Workshop on Local and Metropolitan Area Networks, pp. 17–22 (2004)
Gambiroza, V., Yuan, P., Balzano, L., Liu, Y., Sheafor, S., Knightly, E.: Design, analysis, and implementation of DVSR: a fair high-performance protocol for packet rings. IEEE/ACM Trans. Networking 12, 85–102 (2004)
Alharbi, F., Ansari, N.: Low complexity distributed bandwidth allocation for resilient packet ring networks. In: Proceedings of 2004 Workshop on High Performance Switching and Routing, 2004. HPSR, pp. 277–281 (2004)
Zhou, X., Shi, G., Fang, H., Zeng, L.: Fairness algorithm analysis in resilient packet ring. In: In Proceedings of the 2003 International Conference on Communication Technology (ICCT 2003), vol. 1, pp. 622–624 (2003)
(OPNET Modeler. ), http://www.opnet.com
Tyan, H.: Design, Realization and Evaluation of a Component-Based Compositional Software Architecture for Network Simulation. PhD thesis, Ohio State University (2002)
Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V.: On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Trans. Networking 2, 1–15 (1994)
Paxson, V., Floyd, S.: Wide area traffic: the failure of Poisson modeling. IEEE/ACM Trans. Networking 3, 226–244 (1995)
Davik, F., Kvalbein, A., Gjessing, S.: Congestion Domain Boundaries in Resilient Packet Rings. Submitted to ICC 2005 (2004)
Knightly, E., Balzano, L., Gambiroza, V., Liu, Y., Yuan, P., Sheafor, S., Zhang, H.: Achieving High Performance with Darwin’s Fairness Algorithm. Presentation at IEEE 802.17 Meeting (2002), http://grouper.ieee.org/groups/802/17/documents/presentations/mar2002
Yue, P., Liu, Z., Liu, J.: High performance fair bandwidth allocation algorithm for resilient packet ring. In: Proceedings of the 17th International Conference on Advanced Information Networking and Applications, pp. 415–420 (2003)
Cidon, I., Georgiadis, L., Guerin, R., Shavitt, Y.: Improved fairness algorithms for rings with spatial reuse. IEEE/ACM Trans. Networking 5, 190–204 (1997)
Kessler, I., Krishna, A.: On the cost of fairness in ring networks. IEEE/ACM Trans. Networking 1, 306–313 (1993)
Picker, D., Fellman, R.: Enhancing SCI’s fairness protocol for increased throughput. In: IEEE Int. Conf. On Network Protocols (1993)
Schuringa, J., Remsak, G., van As, H.R.: Cyclic Queuing Multiple Access (CQMA) for RPR Networks. In: Proceedings of the 7th European Conference on Networks & Optical Communications (NOC2002), Darmstadt, Germany, pp. 285–292 (2002)
Kirstadter, A., Hof, A., Meyer, W., Wolf, E.: Bandwidth-efficient resilience in metro networks - a fast network-processor-based RPR implementation. In: Proceedings of the 2004 Workshop on High Performance Switching and Routing, 2004 (HPSR), pp. 355–359. HPSR (2004)
Huang, C., Peng, H., Yuan, F., Hawkins, J.: A steady state bound for resilient packet rings. In: Global Telecommunications Conference (GLOBECOM 2003), vol. 7, pp. 4054–4058. IEEE, Los Alamitos (2003)
Robichaud, Y., Huang, C., Yang, J., Peng, H.: Access delay performance of resilient packet ring under bursty periodic class B traffic load. In: Proceedings of the 2004 IEEE International Conference on Communications, vol. 2, pp. 1217–1221 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davik, F., Kvalbein, A., Gjessing, S. (2005). Performance Evaluation and Improvement of Non-stable Resilient Packet Ring Behavior. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)