We propose a Traffic Engineering (TE) architecture to supply Wireless Mesh Networks (WMNs) with an efficient support of diverse applications with different Quality of Service (QoS) requirements. The proposed TE-WMN architecture is based on the MPLS technology. Its main goal is to provide TE capabilities so that a heterogeneous infrastructure, made of wired networks and WMNs, can be built and managed in a seamless manner lit the TE-WMN architecture, the Path Computation Element (PCE) is in charge of finding a path that satisfies the QoS requirements. This operation often requires solving a multi-constrained problem, which is known to be NP-complete. So far many approximated and heuristic solutions have been developed for and applied to wired networks. However the different features of WMNs make it impractical to reuse those solutions. Hence we have devised two heuristic path computation algorithms (PCAs) with the goal of keeping the complexity very low and yet improving the performance of simple existing algorithms. An extensive set of tests has proved the good performance of the proposed PCAs.

Multi-constrained path computation algorithms for Traffic Engineering over Wireless Mesh Networks

ADAMI, DAVIDE;GARROPPO, ROSARIO GIUSEPPE;GIORDANO, STEFANO;TAVANTI, LUCA
2009-01-01

Abstract

We propose a Traffic Engineering (TE) architecture to supply Wireless Mesh Networks (WMNs) with an efficient support of diverse applications with different Quality of Service (QoS) requirements. The proposed TE-WMN architecture is based on the MPLS technology. Its main goal is to provide TE capabilities so that a heterogeneous infrastructure, made of wired networks and WMNs, can be built and managed in a seamless manner lit the TE-WMN architecture, the Path Computation Element (PCE) is in charge of finding a path that satisfies the QoS requirements. This operation often requires solving a multi-constrained problem, which is known to be NP-complete. So far many approximated and heuristic solutions have been developed for and applied to wired networks. However the different features of WMNs make it impractical to reuse those solutions. Hence we have devised two heuristic path computation algorithms (PCAs) with the goal of keeping the complexity very low and yet improving the performance of simple existing algorithms. An extensive set of tests has proved the good performance of the proposed PCAs.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/200736
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 0
social impact