一种解决多约束QoS多路由问题的新方法

Ling Qin, Yixin Chen, Jianli Luo, Jing Guo, Ling Chen
{"title":"一种解决多约束QoS多路由问题的新方法","authors":"Ling Qin, Yixin Chen, Jianli Luo, Jing Guo, Ling Chen","doi":"10.1109/IMSCCS.2006.18","DOIUrl":null,"url":null,"abstract":"A new way of solving the bandwidth, delay, delay jitter and packet loss constrained least-cost quality of service (QoS) multi-routing problem is presented. It harmonizes the intrinsic attributes of each constraint of QoS and in different stage, the algorithm updates pheromone according to different constraints, optimizes its control parameters to simplify the parameter selection process and to speed up the convergent process. In one iteration, crossover and mutation operations are implemented on the solutions constructed, and the mutation probability was determined by the solution distribution. Experimental results show that our algorithm can obtain high quality solutions, get high convergence speed, and meet the quality of service requirement in real network","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New Way of Solving Multiple Constrained QoS Multi-routing Problems\",\"authors\":\"Ling Qin, Yixin Chen, Jianli Luo, Jing Guo, Ling Chen\",\"doi\":\"10.1109/IMSCCS.2006.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new way of solving the bandwidth, delay, delay jitter and packet loss constrained least-cost quality of service (QoS) multi-routing problem is presented. It harmonizes the intrinsic attributes of each constraint of QoS and in different stage, the algorithm updates pheromone according to different constraints, optimizes its control parameters to simplify the parameter selection process and to speed up the convergent process. In one iteration, crossover and mutation operations are implemented on the solutions constructed, and the mutation probability was determined by the solution distribution. Experimental results show that our algorithm can obtain high quality solutions, get high convergence speed, and meet the quality of service requirement in real network\",\"PeriodicalId\":202629,\"journal\":{\"name\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"volume\":\"189 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSCCS.2006.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2006.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种解决带宽、时延、时延抖动和丢包受限的最小服务质量(QoS)多路由问题的新方法。该算法协调QoS各约束的内在属性,并在不同阶段根据不同约束更新信息素,优化控制参数,简化参数选择过程,加快收敛过程。在一次迭代中,对构造的解进行交叉和变异操作,变异概率由解的分布决定。实验结果表明,该算法能获得高质量的解,收敛速度快,满足实际网络对服务质量的要求
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Way of Solving Multiple Constrained QoS Multi-routing Problems
A new way of solving the bandwidth, delay, delay jitter and packet loss constrained least-cost quality of service (QoS) multi-routing problem is presented. It harmonizes the intrinsic attributes of each constraint of QoS and in different stage, the algorithm updates pheromone according to different constraints, optimizes its control parameters to simplify the parameter selection process and to speed up the convergent process. In one iteration, crossover and mutation operations are implemented on the solutions constructed, and the mutation probability was determined by the solution distribution. Experimental results show that our algorithm can obtain high quality solutions, get high convergence speed, and meet the quality of service requirement in real network
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信