A Scalable Algorithm for Link-state QoS-based Routing with Three Metrics - Archive ouverte HAL Access content directly
Conference Papers Year :

A Scalable Algorithm for Link-state QoS-based Routing with Three Metrics

Luís Henrique Maciel Kosmalski Costa
  • Function : Author
  • PersonId : 1037287
Serge Fdida

Abstract

Quality of service (QoS) based routing provides QoS guarantees to multimedia applications and an efficient utilization of the network resources. Nevertheless, QoS routing is likely to be a costly process that does not scale when the number of nodes increases. Thus, the routing algorithm must be simple. This paper proposes and analyses the performance of a link-state QoS routing algorithm that takes into account three metrics: propagation delay, available bandwidth, and loss probability. A heuristic based on the residual loss probability and metric-combination is used to turn the algorithm scalable and solvable in polynomial time. The simulation results show that our algorithm is a promising solution to construct paths constrained on three metrics.
No file

Dates and versions

hal-01571670 , version 1 (03-08-2017)

Identifiers

Cite

Luís Henrique Maciel Kosmalski Costa, Serge Fdida, Otto Carlos Muniz Bandeira Duarte. A Scalable Algorithm for Link-state QoS-based Routing with Three Metrics. IEEE International Conference on Communications, Jun 2001, Helsinki, Finland. pp.2603-2607, ⟨10.1109/ICC.2001.936620⟩. ⟨hal-01571670⟩
40 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More