A deterministic bound for the access delay of resilient packet rings

Abstract

Resilient packet ring (RPR) is a new technology being standardized by the IEEE 802.17 working group. This work presents a ring access delay bound under steady state. The bound is then proved analytically. Furthermore we show that the bound is tight by constructing a worst-case traffic scenario. It is shown that straight overloading scenarios are not the worst case.