TY - JOUR
T1 - Multi-layer decomposition of network utility maximization problems
AU - Karakoç, Nurullah
AU - Scaglione, Anna
AU - Nedić, Angelia
AU - Reisslein, Martin
N1 - Funding Information: Manuscript received November 12, 2018; revised September 27, 2019 and April 1, 2020; accepted June 10, 2020; approved by IEEE/ACM TRANSAC-TIONS ON NETWORKING Editor J. Shin. Date of publication July 13, 2020; date of current version October 15, 2020. This work was supported in part by the NSF under Grant CCF-1717391 and Grant NeTS-1716121 and in part by the ONR under Grant N000141612245. This article appears in part in the proceedings of the IEEE Conference on Decision and Control, Miami Beach, FL, USA, Dec. 2018. (Corresponding author: Nurullah Karakoç.) The authors are with the School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85287 USA (e-mail: [email protected]; [email protected]; [email protected]; [email protected]). Digital Object Identifier 10.1109/TNET.2020.3003925 Publisher Copyright: © 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
PY - 2020/10
Y1 - 2020/10
N2 - We describe a distributed framework for resource sharing problems that arise in communications, micro-economics, and various networking applications. In particular, we consider a hierarchical multi-layer decomposition for network utility maximization (ML-NUM), where functionalities are assigned to different layers. The proposed methodology creates solutions with central management and distributed computations to the resource allocation problems. In non-stationary environments, the technique aims to respond quickly to the dynamics of the network by decreasing delay by partially shifting the communication and computational burden to the network edges. Our main contribution is a detailed analysis under the assumption that the network changes are on the same time-scale as the convergence time of the algorithms used for local computations. Moreover, assuming strong concavity and smoothness of the users' objective functions, and under some stability conditions for each layer, we present convergence rates and optimality bounds for the ML-NUM framework. In addition, the main benefits of the proposed method are demonstrated with numerical examples.
AB - We describe a distributed framework for resource sharing problems that arise in communications, micro-economics, and various networking applications. In particular, we consider a hierarchical multi-layer decomposition for network utility maximization (ML-NUM), where functionalities are assigned to different layers. The proposed methodology creates solutions with central management and distributed computations to the resource allocation problems. In non-stationary environments, the technique aims to respond quickly to the dynamics of the network by decreasing delay by partially shifting the communication and computational burden to the network edges. Our main contribution is a detailed analysis under the assumption that the network changes are on the same time-scale as the convergence time of the algorithms used for local computations. Moreover, assuming strong concavity and smoothness of the users' objective functions, and under some stability conditions for each layer, we present convergence rates and optimality bounds for the ML-NUM framework. In addition, the main benefits of the proposed method are demonstrated with numerical examples.
KW - Distributed computation
KW - Network resource allocation
UR - http://www.scopus.com/inward/record.url?scp=85105811164&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85105811164&partnerID=8YFLogxK
U2 - 10.1109/TNET.2020.3003925
DO - 10.1109/TNET.2020.3003925
M3 - Article
SN - 1063-6692
VL - 28
SP - 2077
EP - 2091
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 5
M1 - 9139398
ER -