Analysis of Queuing Delay in RPR Networks

Abstract

Resilient packet ring (RPR) that has been standardized as IEEE 802.17 is a MAC layer protocol designed for data centric metropolitan area network applications. A well-designed RPR network would be able to offer QoS guarantee for throughput and delay sensitive data classes in addition to providing other types of low cost best effort services. Careful network planning would be required to allow successful provisioning of classA services with strict delay and jitter requirements over RPR networks. This would require the knowledge of the dependency of delay and jitter for classA traffic on the load that is added to the ring. In this article, we propose an algorithm to estimate the dependency of delay and jitter for classA traffic in RPR networks on the total traffic added to the ring by nodes. We will follow an analytical approach based on queuing theory to find the probability density function of the delay for classA packets and try to find a closed-form solution to the problem using some simplifying assumptions. Simulations are used to verify the results of analytical derivations.