Real-Time Fair Resource Allocation in Distributed Software Defined Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Real-Time Fair Resource Allocation in Distributed Software Defined Networks

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

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.
Fichier principal
Vignette du fichier
StatefulFairDistributedAuthorCopy.pdf (2.44 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01652533 , version 1 (30-11-2017)

Identifiers

Cite

Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi. Real-Time Fair Resource Allocation in Distributed Software Defined Networks. 29th Int Teletraffic Congress (ITC) / 1st International Conference on Networking Science and Practice / 1st International Workshop on Softwarized Infrastructures for 5G and Fog Computing (Soft5) / PhD Workshop on Modelling Communication Networks, Sep 2017, Genoa, Italy. pp.9. ⟨hal-01652533⟩
136 View
149 Download

Share

Gmail Facebook Twitter LinkedIn More