eduzhai > Applied Sciences > Engineering >

Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints

  • king
  • (0) Download
  • 20210506
  • Save

... pages left unread,continue reading

Document pages: 12 pages

Abstract: In this paper, we study a joint bandwidth allocation and path selectionproblem via solving a multi-objective minimization problem under the pathcardinality constraints, namely MOPC. Our problem formulation captures varioustypes of objectives including the proportional fairness, the total completiontime, as well as the worst-case link utilization ratio. Such an optimizationproblem is very challenging since it is highly non-convex. Almost all existingworks deal with such a problem using relaxation techniques to transform it tobe a convex optimization problem. However, we provide a novel solutionframework based on the classic alternating direction method of multipliers(ADMM) approach for solving this problem. Our proposed algorithm is simple andeasy to be implemented. Each step of our algorithm consists of either findingthe maximal root of a single-cubic equation which is guaranteed to have atleast one positive solution or solving a one-dimensional convex subproblem in afixed interval. Under some mild assumptions, we prove that any limiting pointof the generated sequence under our proposed algorithm is a stationary point.Extensive numerical simulations are performed to demonstrate the advantages ofour algorithm compared with various baselines.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×