This paper presents an original discrete-time, distributed, noncooperative load-balancing algorithm, based on mean field game theory, which does not require explicit communications. The algorithm is proven to converge to an arbitrarily small neighborhood of a specific equilibrium among the loads of the providers, known as Wardrop equilibrium. Thanks to its characteristics, the algorithm is suitable for the software-defined networking (SDN) scenario, where service requests coming from the network nodes, i.e., the switches, are managed by the so-called SDN controllers, playing the role of providers. The proposed approach is aimed at dynamically balancing the requests of the switches among the SDN controllers to avoid congestion. This paper also suggests the adoption of SDN Proxies to improve the scalability of the overall SDN paradigm and presents an implementation of the algorithm in a proof-of-concept SDN scenario, which shows the effectiveness of the proposed solution with respect to the current approaches.
Lyapunov-based design of a distributed wardrop load-balancing algorithm with application to software-defined networking / Pietrabissa, Antonio; Ricciardi Celsi, Lorenzo; Cimorelli, Federico; Suraci, Vincenzo; Delli Priscoli, Francesco; Di Giorgio, Alessandro; Giuseppi, Alessandro; Monaco, Salvatore. - ELETTRONICO. - 25:7(2019), pp. 1924-1936. [10.1109/TCST.2018.2842044]
Lyapunov-based design of a distributed wardrop load-balancing algorithm with application to software-defined networking
Pietrabissa, Antonio
;Ricciardi Celsi, Lorenzo;Cimorelli, Federico;Suraci, Vincenzo;Delli Priscoli, Francesco;Di Giorgio, Alessandro;GIUSEPPI, ALESSANDRO;Monaco, Salvatore
2019
Abstract
This paper presents an original discrete-time, distributed, noncooperative load-balancing algorithm, based on mean field game theory, which does not require explicit communications. The algorithm is proven to converge to an arbitrarily small neighborhood of a specific equilibrium among the loads of the providers, known as Wardrop equilibrium. Thanks to its characteristics, the algorithm is suitable for the software-defined networking (SDN) scenario, where service requests coming from the network nodes, i.e., the switches, are managed by the so-called SDN controllers, playing the role of providers. The proposed approach is aimed at dynamically balancing the requests of the switches among the SDN controllers to avoid congestion. This paper also suggests the adoption of SDN Proxies to improve the scalability of the overall SDN paradigm and presents an implementation of the algorithm in a proof-of-concept SDN scenario, which shows the effectiveness of the proposed solution with respect to the current approaches.File | Dimensione | Formato | |
---|---|---|---|
Pietrabissa_Lyapunov-based_2019.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.96 MB
Formato
Adobe PDF
|
1.96 MB | Adobe PDF | Contatta l'autore |
Pietrabissa_postprint_Lyapunov-based_2019.pdf
accesso aperto
Note: DOI: 10.1109/TCST.2018.2842044
Tipologia:
Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
747.04 kB
Formato
Adobe PDF
|
747.04 kB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.