k -不相交QoS路由问题的启发式算法

2011 Fourth International Joint Conference on Computational Sciences and Optimization Pub Date : 2011-04-15 DOI:10.1109/CSO.2011.145

Zhanke Yu, Mingfang Ni, Zeyan Wang, Huajun Huang

{"title":"k -不相交QoS路由问题的启发式算法","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":"{\"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}","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

摘要

k -不相交QoS路由强调寻找k条从源到目的满足QoS要求的不相交路径。众所周知，这个问题是np完全的。本文将k-不相交QoS路由问题表述为二进制整数线性规划(BILP)，提出了一种基于整数线性规划和罚函数的启发式算法。初步数值结果表明，该算法是可行的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Heuristic Algorithm for K-disjoint QoS Routing Problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 Fourth International Joint Conference on Computational Sciences and Optimization

自引率

0.00%

发文量