Edge disjoint paths with minimum delay subject to reliability constraint

Authors:
Ruen Chze Loh;Sieteng Soh;Mihai Lazarescu
Affiliations:
Department of Computing, Curtin University of Technology, Perth, Australia;Department of Computing, Curtin University of Technology, Perth, Australia;Department of Computing, Curtin University of Technology, Perth, Australia
Venue:
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Year:
2009

Citing 8
Cited 0

Path set selection in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Journal of Computer and System Sciences
A New Approximation Algorithm for Computing 2-Restricted Disjoint Paths*This research is supported by "Fostering Talent in Emergent Research Fields" program in Special Coordination Funds for promoting Science and Technology by Ministry of Education, Culture, Sports, Science and Technology.

IEICE - Transactions on Information and Systems
Multiconstrained QoS multipath routing in wireless sensor networks

Wireless Networks
Polynomial time approximation algorithms for multi-constrained QoS routing

IEEE/ACM Transactions on Networking (TON)
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem

Journal of Global Optimization
A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network

PRDC '08 Proceedings of the 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing
An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints

AINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, multipaths solutions have been proposed to improve the quality-of-service (QoS) in communication networks (CN). This paper describes a problem, λDP/RD, to obtain the λ-edge-disjoint-path-set such that its reliability is at least R and its delay is minimal, for λ≥1. λDP/RD is useful for applications that require noncompromised reliability while demanding minimum delay. In this paper we propose an approximate algorithm based on the Lagrange-relaxation to solve the problem. Our solution produces λDP that meets the reliability constraint R with delay≤(1+k)Dmin, for k≥1, and Dmin is the minimum path delay of any λDP in the CN. Simulations on forty randomly generated CNs show that our polynomial time algorithm produced λDP with delay and reliability comparable to those obtained using the exponential time brute-force approach.