一种基于蚂蚁算法的QoS路由算法

Zhang Subing, Liu Zemin
{"title":"一种基于蚂蚁算法的QoS路由算法","authors":"Zhang Subing, Liu Zemin","doi":"10.1109/LCN.2000.891102","DOIUrl":null,"url":null,"abstract":"The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A QoS routing algorithm based on ant algorithm\",\"authors\":\"Zhang Subing, Liu Zemin\",\"doi\":\"10.1109/LCN.2000.891102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.\",\"PeriodicalId\":369604,\"journal\":{\"name\":\"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2000.891102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2000.891102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

讨论了多媒体应用对路由的要求。为了有效且高效地解决QoS约束路由问题,我们构建了一种全局优化蚂蚁算法,该算法基于蚂蚁在觅食过程中寻找巢穴到食物源之间最短路径的能力。仿真结果表明,该方法能够有效地实现QoS路由。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A QoS routing algorithm based on ant algorithm
The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信