343 research outputs found
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
Improved Convergence Rates for Distributed Resource Allocation
In this paper, we develop a class of decentralized algorithms for solving a
convex resource allocation problem in a network of agents, where the agent
objectives are decoupled while the resource constraints are coupled. The agents
communicate over a connected undirected graph, and they want to collaboratively
determine a solution to the overall network problem, while each agent only
communicates with its neighbors. We first study the connection between the
decentralized resource allocation problem and the decentralized consensus
optimization problem. Then, using a class of algorithms for solving consensus
optimization problems, we propose a novel class of decentralized schemes for
solving resource allocation problems in a distributed manner. Specifically, we
first propose an algorithm for solving the resource allocation problem with an
convergence rate guarantee when the agents' objective functions are
generally convex (could be nondifferentiable) and per agent local convex
constraints are allowed; We then propose a gradient-based algorithm for solving
the resource allocation problem when per agent local constraints are absent and
show that such scheme can achieve geometric rate when the objective functions
are strongly convex and have Lipschitz continuous gradients. We have also
provided scalability/network dependency analysis. Based on these two
algorithms, we have further proposed a gradient projection-based algorithm
which can handle smooth objective and simple constraints more efficiently.
Numerical experiments demonstrates the viability and performance of all the
proposed algorithms
Inter-micro-operator interference protection in dynamic TDD system
Abstract. This thesis considers the problem of weighted sum-rate maximization (WSRM) for a system of micro-operators subject to inter-micro-operator interference constraints with dynamic time division duplexing. The WSRM problem is non-convex and non-deterministic polynomial hard. Furthermore, micro-operators require minimum coordination among themselves making the inter-micro-operator interference management very challenging. In this regard, we propose two decentralized precoder design algorithm based on over-the-air bi-directional signalling strategy. We first propose a precoder design algorithm by considering the equivalent weighted minimum mean-squared error minimization reformulation of the WSRM problem. Later we propose precoder design algorithm by considering the weighted sum mean-squared error reformulation. In both approaches, to reduce the huge signalling requirements in centralized design, we use alternating direction method of multipliers technique, wherein each downlink-operator base station and uplink-operator user determines only the relevant set of transmit precoders by exchanging minimal information among the coordinating base stations and user equipments. To minimize the coordination between the uplink-opeator users, we propose interference budget allocation scheme based on reference signal measurements from downlink-operator users. Numerical simulations are provided to compare the performance of proposed algorithms with and without the inter-micro-operator interference constraints
- …