摘要
为改善P2P网络中传统路由算法存在的不足,结合免疫克隆算法和模拟退火算法的优点,提出一种基于免疫克隆退火算法的P2P路由算法。该算法充分考虑节点间延迟、带宽和费用等差异。实验结果表明,该算法能有效提高路由效率,减少路由延迟,整体性能优于其他路由算法。
To improve the efficiency and effectiveness traditional algorithms which still have some shortcomings, this paper combines the advantages of immune clonal algorithm with simulated annealing, brings forward a routing algorithm based on Immune Clonal Annealing Algorithm(lCAA). The simulation results show that this algorithm achieves resource load balancing, and it overcomes the shortcomings of genetic algorithm, and can be applied to the optimization of task schedule successfully. Experimental result shows that it is concluded that ICAA is exploited to achieve the goal of improving the routing performance, and is superior to other algorithm.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第18期198-199,230,共3页
Computer Engineering
基金
南阳市科技攻关计划基金资助项目(2007G0804)
关键词
对等计算
路由算法
模拟退火算法
免疫克隆退火算法
Peer-to-Peer(P2P) computing
routing algorithm
simulated annealing algorithm
Immune Clonal Annealing Algorithm(ICAA)