This paper focuses on the problem of optimal QoS Traffic Engineering (TE) in Co-Channel Interference (CCI)-affected power-limited wireless access networks that support connectionless services. By exploiting the analytical tool offered by nonlinear optimization and following the emerging "Decomposition as Optimization" paradigm [1], the approach pursued in this paper allows to develop a resource allocation algorithm that is distributed, asynchronous, scalable and self-adaptive. Interestingly, the proposed algorithm enables each node of the network to distribute its outgoing traffic among all feasible next-hops in an optimal way, as measured by an assigned global cost function of general form. This optimal traffic distribution complies with several subjective as well as objective QoS requirements advanced by the supported media flows and involves only minimum information exchange between neighboring nodes. Furthermore, it allows for load-balanced multiple forwarding paths and it is able to self-perform optimal traffic re-distribution (i.e., re-routing) in the case of failure of the underlying wireless links. Finally, actual effectiveness of the overall proposed algorithm is numerically tested via performance comparisons against both DSDV-based single-path routing algorithms and interference-aware multipath routing algorithms. © 2011 Elsevier B.V. All rights reserved.

Traffic Engineering for wireless connectionless access networks supporting QoS-demanding media applications

Cordeschi N.;
2012

Abstract

This paper focuses on the problem of optimal QoS Traffic Engineering (TE) in Co-Channel Interference (CCI)-affected power-limited wireless access networks that support connectionless services. By exploiting the analytical tool offered by nonlinear optimization and following the emerging "Decomposition as Optimization" paradigm [1], the approach pursued in this paper allows to develop a resource allocation algorithm that is distributed, asynchronous, scalable and self-adaptive. Interestingly, the proposed algorithm enables each node of the network to distribute its outgoing traffic among all feasible next-hops in an optimal way, as measured by an assigned global cost function of general form. This optimal traffic distribution complies with several subjective as well as objective QoS requirements advanced by the supported media flows and involves only minimum information exchange between neighboring nodes. Furthermore, it allows for load-balanced multiple forwarding paths and it is able to self-perform optimal traffic re-distribution (i.e., re-routing) in the case of failure of the underlying wireless links. Finally, actual effectiveness of the overall proposed algorithm is numerically tested via performance comparisons against both DSDV-based single-path routing algorithms and interference-aware multipath routing algorithms. © 2011 Elsevier B.V. All rights reserved.
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: http://hdl.handle.net/11589/240881
 Attenzione

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

Citazioni
  • Scopus 4
  • ???jsp.display-item.citation.isi??? ND
social impact