{"title":"Heuristic Algorithm for K-disjoint QoS Routing Problem","authors":"Zhanke Yu, Mingfang Ni, Zeyan Wang, Huajun Huang","doi":"10.1109/CSO.2011.145","DOIUrl":null,"url":null,"abstract":"K-disjoint QoS Routing emphasizes to find k disjoint paths from source to destination satisfying the QoS requirements. It is well-known that this problem is NP-Complete. In this paper, we formulate the k-disjoint QoS routing problem as binary integer linear program (BILP) and propose a new heuristic algorithm based on integer linear programming and penalty function. Preliminary numerical results show that the proposed algorithm is viable.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2011.145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
K-disjoint QoS Routing emphasizes to find k disjoint paths from source to destination satisfying the QoS requirements. It is well-known that this problem is NP-Complete. In this paper, we formulate the k-disjoint QoS routing problem as binary integer linear program (BILP) and propose a new heuristic algorithm based on integer linear programming and penalty function. Preliminary numerical results show that the proposed algorithm is viable.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
