Statistical Delay Budget Partitioning Algorithm

Abstract

Mapping the end to end QoS requirements into link QoS requirements is an important step for resource allocation of connection oriented services. The problem of the QoS partitioning has been addressed in literature and proved to be NP complete. Different algorithms are proposed to solve the problem of single end-to-end QoS metric. However, these algorithms are near optimal or heuristic algorithms and solve the QoS partitioning problem for single QoS metric. In this paper, we propose a novel optimal partitioning algorithm which is capable of partitioning the end to end QoS requirement for multiple QoS metrics, additive and multiplicative, simultaneously. Extensive simulation verified the effectiveness of the algorithm compared to two QoS partitioning algorithms. The results show that the proposed algorithm outperforms the other two algorithms for loose and stringent QoS requirements and over different path lengths.