The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
|Author:||Sounak Kar, Amr Rizk, Markus Fidler|
|Kind:||Article - use for journal articles only|
|Journal:||International Workshop on Network Calculus and Applications of ITC (NetCal 2018)|
|Abstract:||Recent advancements of multipath communications have made a new dimension of resource management accessible focusing on balanced and efficient utilization of available communication alternatives. Dynamic strategies in this context leverage the most up to date information on available interfaces to outperform comparable static versions. In this work, we propose an adaptive strategy that seeks to improve the worst-case performance of a multipath communication system by periodically looking at waiting time bounds of respective subsystems. We compare the performance of the proposed adaptive assignment with established round-robin and join-the-shortest-queue strategies numerically where we observe that our strategy tends to be superior in heterogeneous environments.|
|Full paper (pdf)|