Centralized Network Utility Maximization over Aggregate Flows
Networking and Internet Architecture
2017-03-03 v1 Optimization and Control
Abstract
We study a network utility maximization (NUM) decomposition in which the set of flow rates is grouped by source-destination pairs. We develop theorems for both single-path and multipath cases, which relate an arbitrary NUM problem involving all flow rates to a simpler problem involving only the aggregate rates for each source-destination pair. The optimal aggregate flows are then apportioned among the constituent flows of each pair. This apportionment is simple for the case of -fair utility functions. We also show how the decomposition can be implemented with the alternating direction method of multipliers (ADMM) algorithm.
Keywords
Cite
@article{arxiv.1703.00525,
title = {Centralized Network Utility Maximization over Aggregate Flows},
author = {Riten Gupta and Lieven Vandenberghe and Mario Gerla},
journal= {arXiv preprint arXiv:1703.00525},
year = {2017}
}