A probabilistic scheme for hierarchical QoS routing

Quality of service (QoS) routing consists of two parts: (a) collecting network QoS resource availability information using topology aggregation schemes and (b) computing-feasible paths using this information. This paper firstly proposes a probabilistic scheme for topology aggregation in large networks which are QoS sensitive. Our goal is to account for the inherent dynamic nature of the QoS resources by using probabilistic measures as opposed to the existing deterministic ones. Additionally, this paper also proposes a modification to an existing probabilistic QoS routing algorithm for concave QoS parameters. The proposed heuristic algorithm increases the global network resource utilization.