Edge disjoint paths with minimum delay subject to reliability constraint
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
| Hi-index | 0.00 |
Recently, multipaths solutions have been proposed to improve the quality-of-service (QoS) in communication networks (CN). Peng and Shen algorithm (PSA) was proposed to generate lamdaDP/DC – the maximum edge-disjoint-path-set with minimal cost subject to a delay constraint, for lamda≤2. This paper introduces a different and equally important problem, lamdaDP/DR, to obtain the maximal edge-disjoint-path-set with maximum reliability subject to a given delay constraint, for lambda≤1. lamdaDP/DR is applicable to time critical applications that require non-compromised time delay while demanding maximum system reliability. In this paper we show how lamdaDP/DR is different from lamdaDP/DC, and propose an approximate algorithm similar to the Lagrange-relaxation based PSA to solve the problem. Our simulations on three randomly generated CNs show that our polynomial time algorithm produced lamdaDP/DR with comparable optimality to that obtained using the NP-hard brute-force approach.