Oleksandr V Lemeshko, Oleksandra Yeremenko, M. Yevdokymenko, Batoul Sleiman
{"title":"最大带宽不相交路径集计算模型的改进","authors":"Oleksandr V Lemeshko, Oleksandra Yeremenko, M. Yevdokymenko, Batoul Sleiman","doi":"10.1109/UkrMiCo47782.2019.9165311","DOIUrl":null,"url":null,"abstract":"In this paper, the improvement of the calculation model the set of disjoint paths with maximum bandwidth during multipath routing in the infocommunication network is presented. The task stated was reduced to solving the optimization problem of integer linear programming with maximization of the number of paths and their bandwidth in the presence of linear constraints since the routing variables are Boolean, and variables that determine the number of routes used take only integer values.","PeriodicalId":6754,"journal":{"name":"2019 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo)","volume":"21 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Improvement of the Calculation Model the Set of Disjoint Paths with Maximum Bandwidth\",\"authors\":\"Oleksandr V Lemeshko, Oleksandra Yeremenko, M. Yevdokymenko, Batoul Sleiman\",\"doi\":\"10.1109/UkrMiCo47782.2019.9165311\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the improvement of the calculation model the set of disjoint paths with maximum bandwidth during multipath routing in the infocommunication network is presented. The task stated was reduced to solving the optimization problem of integer linear programming with maximization of the number of paths and their bandwidth in the presence of linear constraints since the routing variables are Boolean, and variables that determine the number of routes used take only integer values.\",\"PeriodicalId\":6754,\"journal\":{\"name\":\"2019 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo)\",\"volume\":\"21 1\",\"pages\":\"1-4\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UkrMiCo47782.2019.9165311\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UkrMiCo47782.2019.9165311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improvement of the Calculation Model the Set of Disjoint Paths with Maximum Bandwidth
In this paper, the improvement of the calculation model the set of disjoint paths with maximum bandwidth during multipath routing in the infocommunication network is presented. The task stated was reduced to solving the optimization problem of integer linear programming with maximization of the number of paths and their bandwidth in the presence of linear constraints since the routing variables are Boolean, and variables that determine the number of routes used take only integer values.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
