CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishWe 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.
| Titolo: | Multi-constrained path computation algorithms for Traffic Engineering over Wireless Mesh Networks |
| Autori interni: | |
| Anno del prodotto: | 2009 |
| 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. |
| Handle: | http://hdl.handle.net/11568/200736 |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
http://hdl.handle.net/11568/200736
Copyright © 2020