Packet transfer delay analysis of the N nodes RPT rings in the cut-through architecture

Abstract

We discuss an analytical approximation for high and low priority packet delay in the cut-through architecture of the N nodes resilient packet transport rings based on the queuing theory. It turns out that both low priority traffic packet delay and high priority one increase with the node number N of the RPT rings, and low priority traffic has larger packet delay than high priority traffic at the same node number N, and when N tending to infinity, the maximum transfer delay is the twice of average delay.