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

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.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01960329
Contributor : Konstantin Avrachenkov <>
Submitted on : Wednesday, December 19, 2018 - 12:49:15 PM
Last modification on : Thursday, December 20, 2018 - 1:28:07 AM
Long-term archiving on : Wednesday, March 20, 2019 - 7:17:43 PM

File

Fair_Article.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01960329, version 1

Collections

Citation

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, Institute of Electrical and Electronics Engineers, 2018, 36 (12), pp.2655-2666. ⟨hal-01960329⟩

Share

Metrics

Record views

51

Files downloads

88