Abstract
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.
| Original language | English (US) |
|---|---|
| Article number | 7964730 |
| Pages (from-to) | 436-450 |
| Number of pages | 15 |
| Journal | IEEE Transactions on Signal and Information Processing over Networks |
| Volume | 4 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 2018 |
Keywords
- ADMM
- cloud traffic management
- distributed asynchronous optimization
- traffic engineering
Fingerprint Dive into the research topics of 'A Distributed Semiasynchronous Algorithm for Network Traffic Engineering'. Together they form a unique fingerprint.
Cite this
Liao, W. C., Hong, M., Farmanbar, H., & Luo, Z. Q. (2018). A Distributed Semiasynchronous Algorithm for Network Traffic Engineering. IEEE Transactions on Signal and Information Processing over Networks, 4(3), 436-450. [7964730]. https://doi.org/10.1109/TSIPN.2017.2721298