Generalised analysis of a QoS-aware routing algorithm

Modern communications services have strict quality of service (QoS) requirements, with separate constraints on bandwidth, delay and error tolerance. The task of finding a route through a network satisfying multiple QoS constraints is intractable, but increasingly important for modern communications applications. This paper investigates an approximate algorithm, which has previously been analysed for the case of two constraints, and presents a generalisation of this analysis to the case of an arbitrary number of constraints. The blocking rate of this algorithm is then empirically compared to several other techniques.