Concurrent multipath transfer（CMT） using stream control transmission protocol（SCTP） multihoming has become an appealing option to increase the throughput and improve the performance of increasingly bandwidth-hungr...Concurrent multipath transfer（CMT） using stream control transmission protocol（SCTP） multihoming has become an appealing option to increase the throughput and improve the performance of increasingly bandwidth-hungry applications.To investigate the rate allocation for applications in CMT,this paper analyzes the capacities of paths shared by competing sources,then proposes the rate allocation model for elastic flows based on the framework of network utility maximization（NUM）.In order to obtain the global optimum of the model,a distributed algorithm is presented which depends only on local available information.Simulation results confirm that the proposed algorithm can achieve the global optimum within reasonable convergence times.展开更多
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 unde...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 constraints.Specifically,such a problem formulation captures various types of objectives including proportional fairness,average delay,as well as load balancing.In addition,in order to handle the"unsplittable flows",path cardinality constraints are added,making the resulting optimization problem quite challenging to solve due to intrinsic nonsmoothness and nonconvexity.Almost all existing works deal with such a problem using relaxation techniques to transform it into a convex optimization problem.However,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 subproblems.We then derive that these subproblems,albeit nonconvex nonsmooth,are actually simple to solve and easy to implement,which can be of independent interest.Under some mild assumptions,we prove that any limiting point of the generated sequence of the proposed algorithm is a stationary point.Numerical simulations are performed to demonstrate the advantages of our proposed algorithm compared with various baselines.展开更多
基金supported by the National Natural Science Foundation of China (60833002)the National Basic Research Program of China (973 Program) (2007CB307100)+2 种基金the National High Technology Research and Development Program of China (863 Program) (2007AA01Z202)the Program for Changjiang Scholars and Innovative Research Team in University (IRT0707)the Program of Introducing Talents of Discipline to Universities (111 Project) (B08002)
文摘Concurrent multipath transfer（CMT） using stream control transmission protocol（SCTP） multihoming has become an appealing option to increase the throughput and improve the performance of increasingly bandwidth-hungry applications.To investigate the rate allocation for applications in CMT,this paper analyzes the capacities of paths shared by competing sources,then proposes the rate allocation model for elastic flows based on the framework of network utility maximization（NUM）.In order to obtain the global optimum of the model,a distributed algorithm is presented which depends only on local available information.Simulation results confirm that the proposed algorithm can achieve the global optimum within reasonable convergence times.
基金supported by the National Natural Science Foundation of China under Grant 11831002。
文摘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 constraints.Specifically,such a problem formulation captures various types of objectives including proportional fairness,average delay,as well as load balancing.In addition,in order to handle the"unsplittable flows",path cardinality constraints are added,making the resulting optimization problem quite challenging to solve due to intrinsic nonsmoothness and nonconvexity.Almost all existing works deal with such a problem using relaxation techniques to transform it into a convex optimization problem.However,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 subproblems.We then derive that these subproblems,albeit nonconvex nonsmooth,are actually simple to solve and easy to implement,which can be of independent interest.Under some mild assumptions,we prove that any limiting point of the generated sequence of the proposed algorithm is a stationary point.Numerical simulations are performed to demonstrate the advantages of our proposed algorithm compared with various baselines.
