{"title":"Multi-interface Communication: Interface Selection Under Statistical Performance Constraints","authors":"Sounak Kar, Amr Rizk, M. Fidler","doi":"10.1109/ITC30.2018.10054","DOIUrl":null,"url":null,"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.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"604 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 30th International Teletraffic Congress (ITC 30)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITC30.2018.10054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.