Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints
作者机构：Department of Systems Engineering and Engineering ManagementCUHKHong Kong 999077China Theory Lab2012 Labs.Huawei Technologies Co.LtdHong Kong 999077China School of Mathematical SciencePeking UniversityBeijing 100871China Beijing International Center for Mathematical ResearchPeking UniversityBeijing 100871China
出 版 物：《Journal of Communications and Information Networks》 (通信与信息网络学报（英文）)
年 卷 期：2021年第6卷第3期
页 面：237-250页
核心收录：
学科分类：08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：supported by the National Natural Science Foundation of China under Grant 11831002
主 题：bandwidth allocation unsplittable flows cardinality constraints network utility maximization LADMM
摘 要：In this paper,we study the joint bandwidth allocation and path selection problem,which is an extension of the well-known network utility maximization(NUM)problem,via solving a multi-objective minimization problem under path cardinality ***,such a problem formulation captures various types of objectives including proportional fairness,average delay,as well as load *** addition,in order to handle theunsplittable flows,path cardinality constraints are added,making the resulting optimization problem quite challenging to solve due to intrinsic nonsmoothness and *** all existing works deal with such a problem using relaxation techniques to transform it into a convex optimization ***,we provide a novel solution framework based on the linearized alternating direction method of multipliers(LADMM)to split the original problem with coupling terms into several *** then derive that these subproblems,albeit nonconvex nonsmooth,are actually simple to solve and easy to implement,which can be of independent *** some mild assumptions,we prove that any limiting point of the generated sequence of the proposed algorithm is a stationary *** simulations are performed to demonstrate the advantages of our proposed algorithm compared with various baselines.
维普期刊数据库