Premium
Optimal resource allocation for heterogeneous traffic in multipath networks
Author(s) -
Li Shiyong,
Sun Wei,
Hua Changchun
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2800
Subject(s) - computer science , resource allocation , multipath propagation , mathematical optimization , network packet , optimization problem , convex optimization , computer network , bandwidth (computing) , throughput , convergence (economics) , distributed computing , regular polygon , algorithm , telecommunications , wireless , mathematics , channel (broadcasting) , geometry , economics , economic growth
Summary Multipath networks allow each source to send packets from it to its destination over multiple paths, which increases the available bandwidth and throughput for source‐destination pairs. Recently, a variety of flow control schemes have been presented for multipath networks to achieve optimal resource allocation. Unfortunately, much of the investigation focused on elastic traffic with controllable packet injection rates. Networks have witnessed an increase in real‐time traffic (voice and video), which are inelastic. We consider resource allocation for heterogeneous traffic in multipath networks and formulate an optimization problem, which is intrinsically difficult nonconvex. In order to address the aforementioned issue and obtain the optimum, we approximate an equivalent problem of the original optimization problem to a strictly convex problem and present a primal‐dual resource allocation algorithm for the approximation problem, which converges to an optimal solution satisfying the Karush‐Kuhn‐Tucker conditions of the original problem. We evaluate its convergence performance through theoretical analysis and illustrate it with numerical examples. Copyright © 2014 John Wiley & Sons, Ltd.