Cost-effective multiple QoS path provisioning

This paper presents a cost-effective quality-of-service (QoS) routing scheme which deploys a heuristic algorithm to provision multiple QoS paths. Multiple QoS path provisioning is mainly aimed to provide reliable QoS guarantees for mission-critical applications. The proposed algorithm relaxes the strict disjoint path requirement and searches for more paths possibly less overlapped with each other and still satisfying given multiple QoS constraints. When multiple QoS paths are provisioned for the same destination, link/node failures become significantly less detrimental to ongoing QoS application traffic. The routing algorithm presented in this paper can be claimed to be cost-effective since a single iteration of the algorithm finds multiple QoS paths while previous research works require as many algorithm iterations as the number of searched QoS paths. This paper discusses the beneficial properties of the proposed algorithm, and simulation experiments present the reduced algorithm time complexity.