| 基于蚁群算法的P2P网络资源发现算法 |
| |
| 引用本文： | 朱骏,潘理,李建华.基于蚁群算法的P2P网络资源发现算法[J].信息安全与通信保密,2007(2):166-168. |
| |
| 作者姓名： | 朱骏 潘理 李建华 |
| |
| 作者单位： | 上海交通大学电子信息与电气工程学院,上海,200240 |
| |
| 摘 要： | Gossip协议是P2P网络的一种流行的资源发现算法,但它没有考虑寻找最低成本的资源。论文提出了基于蚁群算法的新的资源发现算法,在查找资源的同时,综合考虑路径载荷、延时等因素,找到综合费用最低的路径。仿真实验表明,该算法比Dijkstra算法解集的平均综合费用低10%左右,从而能更有效地利用网络资源。
|
| 关 键 词： | 蚁群算法 资源发现 Gossip协议 P2P网络 |
| 文章编号： | 1009-8054(2007)02-0166-03 |
| 修稿时间： | 2006年8月21日 |
An ant colony algorithm based P2P network resource detection algorithm |
| |
| ZHU Jun,PAN Li,LI Jianhua.An ant colony algorithm based P2P network resource detection algorithm[J].China Information Security,2007(2):166-168. |
| |
| Authors: | ZHU Jun PAN Li LI Jianhua |
| |
| Abstract: | Gossip protocol is a popular P2P network resources detection algorithm, which doesn't consider finding lowest cost resources. In this paper we bring forward a new resource detection algorithm based on ant colony algorithm. It takes account of certain factors such as path load, delay and finds lowest cost resources. Experimental results demonstrate that the cost of this algorithm's solution is averagely 10 percent lower than Dijkstra's, so this algorithm could optimize network resource and converge to a satisfaction solution. |
| |
| Keywords: | ant colony algorithm resource detection Gossip protocol P2P network |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
