View Item 

Edge disjoint paths with minimum delay subject to reliability constraint

Access Status
Open access
Authors
Loh, Rue-chze
Soh, Sieteng
Lazarescu, Mihai
Date
2009
Type
Conference Paper

Metadata
Show full item record
Citation
Loh, Rue-chze and Soh, Sieteng and Lazarescu, Mihai. 2009. Edge disjoint paths with minimum delay subject to reliability constraint, APCC 2009, Oct 8 2009, pp. 643-647.Sanghai, China: IEEE.
Source Title
Proceeding of the 15th Asia-Pacific conference on communications APCC 2009
Source Conference
APCC 2009
ISBN
Faculty
School of Science and Computing
Department of Computing
Faculty of Science and Engineering
Remarks

Copyright © 2009 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI
Collection
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 non-compromised 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 k1, 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.