Real-Time Fair Resource Allocation 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 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 in real-time.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01652533
Contributor : Konstantin Avrachenkov <>
Submitted on : Thursday, November 30, 2017 - 1:45:03 PM
Last modification on : Thursday, January 11, 2018 - 4:45:55 PM

File

StatefulFairDistributedAuthorC...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01652533, version 1

Collections

Citation

Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi. Real-Time Fair Resource Allocation in Distributed Software Defined Networks. ITC 29 - 2017 29th International Teletraffic Congress , Sep 2017, Genoa, Italy. ⟨hal-01652533⟩

Share

Metrics

Record views

162

Files downloads

159