A Distributed Semiasynchronous Algorithm for Network Traffic Engineering

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.