Edge disjoint paths with minimum delay subject to reliability constraint

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 app...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 15th Asia-Pacific Conference on Communications s. 643 - 647
Hlavní autoři: Ruen Chze Loh, Sieteng Soh, Lazarescu, M.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2009
Témata:
approximate algorithm
Approximation algorithms
Communication networks
Computer networks
Costs
Delay effects
Lagrange relaxation
Lagrangian functions
multi-constrained edge disjoint paths
network delay
network reliability
Optimized production technology
Polynomials
Quality of service
Telecommunication network reliability
ISBN:9781424447848, 1424447844
ISSN:2163-0771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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)D min , for k¿1, and D min 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.
ISBN:9781424447848
1424447844
ISSN:2163-0771
DOI:10.1109/APCC.2009.5375519