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

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

Parallel ADMM for robust quadratic optimal resource allocation problems

An alternating direction method of multipliers (ADMM) solver is described for optimal resource allocation problems with separable convex quadratic costs and constraints and linear coupling constraints. We describe a parallel implementation of the solver on a graphics processing unit (GPU) using a bespoke quartic function minimizer. An application to robust optimal energy management in hybrid electric vehicles is described, and the results of numerical simulations comparing the computation times of the parallel GPU implementation with those of an equivalent serial implementation are presented

Two-Stage Consensus-Based Distributed MPC for Interconnected Microgrids

In this paper, we propose a model predictive control based two-stage energy management system that aims at increasing the renewable infeed in interconnected microgrids (MGs). In particular, the proposed approach ensures that each MG in the network benefits from power exchange. In the first stage, the optimal islanded operational cost of each MG is obtained. In the second stage, the power exchange is determined such that the operational cost of each MG is below the optimal islanded cost from the first stage. In this stage, a distributed augmented Lagrangian method is used to solve the optimisation problem and determine the power flow of the network without requiring a central entity. This algorithm has faster convergence and same information exchange at each iteration as the dual decomposition algorithm. The properties of the algorithm are illustrated in a numerical case study