.png){kind=icon}
.png){kind=icon}
Return
A Distributed Semiasynchronous Algorithm for Network Traffic Engineering
.png){kind=icon}
OA
AI
DOI：10.1109/TSIPN.2017.2721298.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider the traffic engineering problem in a large-scale hierarchical network arising in the next-generation cloud-based wireless networks. We propose a distributed semiasynchronous algorithm for this problem based on the so-called block successive upper bound minimization method of multipliers (BSUM-M). Theoretically, we show that the proposed algorithm converges to the global optimal solution under some assumptions on the degree of network asynchrony. We illustrate the effectiveness and efficiency of the proposed algorithm by comparing it with the state-of-the-art commercial solvers in a networked environment.
Keywords:
ADMM
cloud traffic management
distributed asynchronous optimization
traffic engineering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.9
Papers:
726
Citations:
1.9K