Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks - Archive ouverte HAL Access content directly
Journal Articles IEEE Journal on Selected Areas in Communications Year : 2018

Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks

(1, 2) , (1) , (2) , (2, 3)
1
2
3

Abstract

The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve over time. To address this issue, bandwidth sharing techniques that quickly react to the traffic fluctuations are of interest, especially in large scale settings with hundreds of nodes and thousands of flows. In this context, we propose a distributed algorithm based on the Alternating Direction Method of Multipliers (ADMM) that tackles the multi-path fair resource allocation problem in a distributed SDN control architecture. Our ADMM-based algorithm continuously generates a sequence of resource allocation solutions converging to the fair allocation while always remaining feasible, a property that standard primal-dual decomposition methods often lack. Thanks to the distribution of all computer intensive operations, we demonstrate that we can handle large instances at scale.
Fichier principal
Vignette du fichier
Fair_Article.pdf (2.63 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01960329 , version 1 (19-12-2018)

Identifiers

  • HAL Id : hal-01960329 , version 1

Cite

Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi. Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks. IEEE Journal on Selected Areas in Communications, 2018, 36 (12), pp.2655-2666. ⟨hal-01960329⟩
62 View
101 Download

Share

Gmail Facebook Twitter LinkedIn More