改进蚁网路由

B. Barán
{"title":"改进蚁网路由","authors":"B. Barán","doi":"10.1145/371626.371736","DOIUrl":null,"url":null,"abstract":"Abstract-AntNet is a new algorithm for packet routing in communication networks. In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing tables.\n This work, based in a previous work of the author [3], analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to the original AntNet and other commericial algorithms. Simulation results indicate a better throughput of the improved proposals. So, AntNet and its variant here proposed are promising options for routing in large public networks such as Interet.","PeriodicalId":215877,"journal":{"name":"Workshop on Data Communication in Latin America and the Caribbean","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Improved AntNet routing\",\"authors\":\"B. Barán\",\"doi\":\"10.1145/371626.371736\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract-AntNet is a new algorithm for packet routing in communication networks. In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing tables.\\n This work, based in a previous work of the author [3], analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to the original AntNet and other commericial algorithms. Simulation results indicate a better throughput of the improved proposals. So, AntNet and its variant here proposed are promising options for routing in large public networks such as Interet.\",\"PeriodicalId\":215877,\"journal\":{\"name\":\"Workshop on Data Communication in Latin America and the Caribbean\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Data Communication in Latin America and the Caribbean\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/371626.371736\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Data Communication in Latin America and the Caribbean","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/371626.371736","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

摘要

摘要:antnet是通信网络中一种新的分组路由算法。在蚁网中,一组移动代理(人工蚂蚁)在对节点之间建立路径,并发地探索网络并交换数据以更新路由表。本工作基于作者先前的工作[3],分析了AntNet算法并提出了改进建议,将其性能与原始AntNet和其他商业算法进行了比较。仿真结果表明,改进后的方案具有更好的吞吐量。因此,本文提出的AntNet及其变体是在internet等大型公共网络中路由的有前途的选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved AntNet routing
Abstract-AntNet is a new algorithm for packet routing in communication networks. In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing tables. This work, based in a previous work of the author [3], analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to the original AntNet and other commericial algorithms. Simulation results indicate a better throughput of the improved proposals. So, AntNet and its variant here proposed are promising options for routing in large public networks such as Interet.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信