Packet transfer delay analysis of the RPR rings in the store-and-forward architecture

Abstract

RRP has two means to transmit data: store-and-forward and cut-through. In this paper, the high and low priority packet transfer delay of the N nodes Resilient Packet Rings (RPR) in store-and-forward architecture is analyzed based on the queuing theory. According to queuing theory, we set up the nodes model and analyzed the factors that influenced the packet transfer delay in a constrained condition. By calculation and simulation, the result indicates that both high priority and low priority packets’ delay increase with the node number N of the RPR rings. The high priority traffic has less packet delay than the low priority traffic at the same node number N. The increase of the low priority transfer delay is much larger than the high priority traffic with the increase of the node number.