{"title":"多rat无线网络中的最优路径选择","authors":"S. Borst, A. O. Kaya, D. Calin, H. Viswanathan","doi":"10.1109/INFCOMW.2016.7562145","DOIUrl":null,"url":null,"abstract":"Optimal path selection is of critical importance in exploiting the collective transmission resources from heterogeneous Radio Access Technologies (RATs) in emerging 5G networks and delivering excellent user performance. In the present paper we propose the `best-rate' path selection algorithm for a multi-RAT scenario with various types of traffic flows. We demonstrate that the rates received by the various flows under the best-rate algorithm, in conjunction with local fair resource sharing at the individual access points, are close to globally Proportional Fair. Extensive simulations confirm that the proposed algorithm outperforms various baseline policies in terms of user-perceived throughput.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Optimal path selection in multi-RAT wireless networks\",\"authors\":\"S. Borst, A. O. Kaya, D. Calin, H. Viswanathan\",\"doi\":\"10.1109/INFCOMW.2016.7562145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimal path selection is of critical importance in exploiting the collective transmission resources from heterogeneous Radio Access Technologies (RATs) in emerging 5G networks and delivering excellent user performance. In the present paper we propose the `best-rate' path selection algorithm for a multi-RAT scenario with various types of traffic flows. We demonstrate that the rates received by the various flows under the best-rate algorithm, in conjunction with local fair resource sharing at the individual access points, are close to globally Proportional Fair. Extensive simulations confirm that the proposed algorithm outperforms various baseline policies in terms of user-perceived throughput.\",\"PeriodicalId\":348177,\"journal\":{\"name\":\"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2016.7562145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2016.7562145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal path selection in multi-RAT wireless networks
Optimal path selection is of critical importance in exploiting the collective transmission resources from heterogeneous Radio Access Technologies (RATs) in emerging 5G networks and delivering excellent user performance. In the present paper we propose the `best-rate' path selection algorithm for a multi-RAT scenario with various types of traffic flows. We demonstrate that the rates received by the various flows under the best-rate algorithm, in conjunction with local fair resource sharing at the individual access points, are close to globally Proportional Fair. Extensive simulations confirm that the proposed algorithm outperforms various baseline policies in terms of user-perceived throughput.