Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Convex Optimization
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
Rethinking internet traffic management: from multiple decompositions to a practical protocol
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Optimal and distributed protocols for cross-layer design of physical and transport layers in MANETs
IEEE/ACM Transactions on Networking (TON)
Joint rate and power control in wireless network: a novel successive approximations method
IEEE Communications Letters
Design, implementation and evaluation of congestion control for multipath TCP
Proceedings of the 8th USENIX conference on Networked systems design and implementation
On the resource utilization and traffic distribution of multipath transmission control
Performance Evaluation
Power Control By Geometric Programming
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
The canonical multi-path network utility maximization (NUM) model which is extended directly from the single-path NUM has been studied widely in the literature. Most of the previous approaches do not specify the case of subflows on paths with different characteristics. Moreover, the transport protocol derived from the canonical multi-path NUM exhibits flappiness in the subflows because of the non-strictly convexity of the optimization problem. This paper introduces a modified multi-path NUM model and proposes a novel approach to overcome the mentioned issues. Using Jensen's inequality, the multi-path NUM is approximated to a strictly convex and separable problem which can be solved efficiently by dual-based decomposition method. The algorithm successively solving a sequence of approximation problems is proven to converge at the global optimum of the original problem. Moreover, considering the separable form of the approximation utility and the dual-based nature of the proposed algorithm, the reverse engineering frameworks of the current TCPs are used to develop a series of multi-path TCPs that are compatible with corresponding regular single-path TCPs.