基于蚁群系统的多约束QoS路由算法CGEA

2015 2nd International Conference on Information Science and Control Engineering Pub Date : 2015-04-24 DOI:10.1109/ICISCE.2015.193

Ben-Lai Liang, J. Yu

{"title":"基于蚁群系统的多约束QoS路由算法CGEA","authors":"Ben-Lai Liang, J. Yu","doi":"10.1109/ICISCE.2015.193","DOIUrl":null,"url":null,"abstract":"CGEA (Convergence Gradients Expectation Ant algorithm) is proposed in this paper, which can get the optimal path quickly by precomputing the Convergence grads expectation of improved ant algorithm. QoS metrics of link can be measured by expectation function and the optimal path can be got efficiently by comparing the convergence grads.","PeriodicalId":356250,"journal":{"name":"2015 2nd International Conference on Information Science and Control Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"One Multi-constraint QoS Routing Algorithm CGEA Based on Ant Colony System\",\"authors\":\"Ben-Lai Liang, J. Yu\",\"doi\":\"10.1109/ICISCE.2015.193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"CGEA (Convergence Gradients Expectation Ant algorithm) is proposed in this paper, which can get the optimal path quickly by precomputing the Convergence grads expectation of improved ant algorithm. QoS metrics of link can be measured by expectation function and the optimal path can be got efficiently by comparing the convergence grads.\",\"PeriodicalId\":356250,\"journal\":{\"name\":\"2015 2nd International Conference on Information Science and Control Engineering\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 2nd International Conference on Information Science and Control Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISCE.2015.193\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 2nd International Conference on Information Science and Control Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISCE.2015.193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

本文提出了收敛梯度期望蚁群算法(CGEA)，该算法通过预先计算改进蚁群算法的收敛梯度期望，可以快速得到最优路径。通过期望函数度量链路的QoS指标，并通过比较收敛梯度有效地得到链路的最优路径。

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

查看原文本刊更多论文

One Multi-constraint QoS Routing Algorithm CGEA Based on Ant Colony System

CGEA (Convergence Gradients Expectation Ant algorithm) is proposed in this paper, which can get the optimal path quickly by precomputing the Convergence grads expectation of improved ant algorithm. QoS metrics of link can be measured by expectation function and the optimal path can be got efficiently by comparing the convergence grads.

求助全文

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

来源期刊

2015 2nd International Conference on Information Science and Control Engineering

自引率

0.00%

发文量