Hybrid Scale-Based Approximation Algorithm for QoS Routing - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès The 11th International Conference on Telecommunications Année : 2011

Hybrid Scale-Based Approximation Algorithm for QoS Routing

Résumé

With the widespread use %and the increase of the number of network applications (VoIP, IPTV, etc.) which are sensitive to multiple QoS parameters (delay, jitter, error rate, financial cost, etc.), multi-constrained QoS routing becomes increasingly desired. Such routing is proved to be NP-hard when the number of additive metrics to be optimized is equal or greater than two. Thus, multiple fully polynomial approximation algorithms have emerged. These algorithms are essentially based on two scales: linear and logarithmic. In this paper, we prove that both the two scales could be inefficient for QoS path pre-computations and then propose a new algorithm that employs a hybrid scale to enhance path computations. As we proved it formally and by simulations, our algorithm guarantees reduced time responses for the pre-computed QoS paths without deteriorating their approximation quality.
Fichier non déposé

Dates et versions

hal-00725064 , version 1 (23-08-2012)

Identifiants

  • HAL Id : hal-00725064 , version 1

Citer

Mohand Yazid Saidi, Géraldine Texier. Hybrid Scale-Based Approximation Algorithm for QoS Routing. The 11th International Conference on Telecommunications, Jul 2011, Graz, Austria. pp.367-374. ⟨hal-00725064⟩
42 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More