An Improved Node Scheduling Scheme for Resilient Packet Ring Network
AbstractPriority Queue (PQ) algorithm is used as the scheduling scheme for Resilient Packet Ring network (RPR). The scheduler handles a specific queue on the basis that all the higher priority queues have been served and emptied. This approach ensures low delay for higher priority classes of traffic. However, it often leads to the starvation of lower priority queues. For both single transit and double transit buffer architecture, traffic on the ring, which is a mixture of HP and LP transit traffic, has higher priority over the transmit HP traffic. This could cause the LP traffic on the ring to block the transmit HP traffic from gaining access onto the ring. To improve the quality of service for high priority traffic transmission, we propose using Bitwise Round-Robin (BRR) algorithm to alternately select packets from the transit buffer and the high priority transmit buffer. Simulation results show certain improvement on overall delay and delay jitter performance of RPR networks by using our scheme.
 Yilmaz, Mete, Ansari, Nirwan."Resilient packet rings with heterogeneous links", IEEE Symposium on Computers and Communications (ISCC), 2012.
 Kyusang Lee, Dujeong Lee, Hyang-Won Lee, No-Gil Myoung, Younghyun Kim, and June-Koo Kevin Rhee "Reliable Network Design for Ethernet Ring Mesh Networks",Journal of Lightwave Technology, Vol. 31, Issue 1, pp. 1-9 (2013)
 Nurujjaman, Mohammad, Sebbah, Samir; Assi, Chadi M.; Maier, Martin, "Optimal capacity provisioning for survivable next generation Ethernet transport networks", IEEE/OSA Journal of Optical Communications and Networking, Volume: 4 , Issue: 12, pp. 967 – 977, 2012.
 Alharbi, F.; Ansari, N., SSA: simple scheduling algorithm for resilient packet ring networks IEE Proceedings-Communications,153(2), 2006, pp.183-188
 Zhu, J., Matrawy, A., Lambadaris, I. and Ashourian, M. “A New Scheduling Scheme for Resilient Packet Ring Networks with Single Transit Buffer” Proceedings of IEEE GLOBECOM workshop, pp.276-280. 2004.
 D. Schupke, A. Riedl, “Packet transfer delay comparison of a store-and forward and a cut-through resilient packet ring,” International Zurich Seminar on Broadband Communications (IZS), Zurich, Switzerland, Februray, 2002.
 Kleinrock, L. Queuing Systems, New York: Wiley-Interscience. 1975.
 Shreedhar, M. Efficient fair queuing using deficit round-robin, IEEE/ACM Transactions on Networking, 4(3), 375 – 385 Jun 1996.
 Csallinan, P. A comparative evaluation of sorted priority algorithms and class based queuing using simulation, Proceedings Simulation Symposium, 2000. (SS 2000)., pp. 99 – 105
 Chuck S., ”Supporting Differentiated Service Classes: Queue Scheduling Disciplines”, white paper, Juniper Networks, January 2002.
 Guidance for IEEE 802.17 RPR Performance Simulations. http://standards.ieee.org/about/get/
 Liu, Xin ; Wang, Hongxiang ; Ji, Yue-feng , “Resilient burst ring: extend IEEE 802.17 to WDM networks”, IEEE Communications Magazine,Vol. 46 , Issue: 11, 2008 , pp. 74-81
 Yilmaz, Mete ; Ansari, Nirwan , “Weighted Fairness and Correct Sizing of the Secondary Transit Queue in Resilient Packet Rings “,Optical Communications and Networking, IEEE/OSA Journal of Vol.2, , Issue: 11,2010 , Page(s): 944 - 951