Quality of service routing with static priority state advertisement

Abstract

In this paper, we investigate the issues related to routing connections that request quality of service (QoS) guarantees in the form of end-to-end delay bounds. We assume that the connection scheduling, connection admissibility and state advertisement at every node is based on the rate-controlled static priority (RCSP) algorithm. We provide conditions that efficiently find a path that satisfies the QoS constraints and that also lead to efficient state updates.