Heterogeneity of connection technologies and nodes mobility open new challenges in home networks control strategies. Moreover, user's needs are changing towards applications requiring high transmission speeds such as 3D gaming, enhanced interactivity and high definition video. Each of those applications puts several constraints on the network capabilities to guarantee requirements on the Quality of Service. In this paper we introduce an innovative concept based on fast load balancing algorithm operating on top of a convergence layer, in order to rapidly react to network changes and contemporaneously to satisfy strict application demands. We formulated the load balancing problem as a Multi-Commodity Flow and resolved it with a column generation approach using Lagrangian Relaxation and Dijkstra algorithm. The load balancing problem computational complexity is decreased with respect to state of the art load balancing solutions based on linear programming techniques. Proof of concept simulation results are reported.

A dynamic load balancing algorithm for Quality of Service and mobility management in next generation home networks

MACONE, DONATO;ODDI, GUIDO;PALO, ANDI;SURACI, VINCENZO
2013-01-01

Abstract

Heterogeneity of connection technologies and nodes mobility open new challenges in home networks control strategies. Moreover, user's needs are changing towards applications requiring high transmission speeds such as 3D gaming, enhanced interactivity and high definition video. Each of those applications puts several constraints on the network capabilities to guarantee requirements on the Quality of Service. In this paper we introduce an innovative concept based on fast load balancing algorithm operating on top of a convergence layer, in order to rapidly react to network changes and contemporaneously to satisfy strict application demands. We formulated the load balancing problem as a Multi-Commodity Flow and resolved it with a column generation approach using Lagrangian Relaxation and Dijkstra algorithm. The load balancing problem computational complexity is decreased with respect to state of the art load balancing solutions based on linear programming techniques. Proof of concept simulation results are reported.
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/11389/2958
 Attenzione

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

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