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 that tackles the fair resource allocation problem in a distributed SDN control architecture. Our 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

https://hal.inria.fr/hal-01442918
Contributor : Konstantin Avrachenkov <>
Submitted on : Thursday, November 23, 2017 - 7:29:42 PM
Last modification on : Friday, December 14, 2018 - 2:23:37 PM

Identifiers

  • HAL Id : hal-01442918, version 3
  • ARXIV : 1711.09690

Collections

Citation

Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi. Real-Time Fair Resource Allocation in Distributed Software Defined Networks. [Research Report] RR-9015, Inria Sophia Antipolis. 2017. ⟨hal-01442918v3⟩

Share

Metrics

Record views

108

Files downloads

280