基于改进蚁群算法的可信服务发现  

Trustworthy service discovery based on a modified ant colony algorithm

作　　者：盛国军[1,2] 温涛[1,2] 郭权[2] 宋晓莹[1,2] 

机构地区：[1]东北大学软件中心,辽宁沈阳110004 [2]大连东软信息学院辽宁省网络安全与计算技术重点实验室,辽宁大连116023

出　　处：《通信学报》2013年第10期37-48,共12页Journal on Communications

基　　金：国家自然科学基金资助项目(61170168,61170169)~~

摘　　要：针对非结构化P2P网络中的服务发现问题,提出了一种基于改进蚁群算法的可信服务发现方法。该方法在传统蚁群算法基础上应用若干新的策略控制蚁群的行为,如动态蚁群策略、子蚂蚁策略、服务节点的信誉评估策略以及蚂蚁的恶意节点惩罚策略等,高信誉服务节点在蚂蚁的推荐下进行邻居更换和自组织。这些策略和方法为蚁群算法在分布式环境下服务发现的应用研究提供了一种新思路。实验结果表明,本算法在各种常见复杂网络环境下仍可保证较高的可信服务查准率和更高的综合服务发现效率,通过对实验数据的分析和解释得到了若干有益的结论,为进一步的研究工作奠定了基础。Aiming at the problem of service discovery in unstructured P2P network, a trustworthy service discovery method based on a modified ant colony algorithm was proposed. Some novel policies were introduced to control the be havior of the ant colony, such as the dynamic ant colony policy, the subant policy, the reputation evaluation policy to service peers, and the punishment policy to malicious peers. Service peers with high reputation could change their neighbors and make selforganization under the recommendation of ants. These policies and methods provide new ideas for the application researches of ant colony algorithms in the field of, distributed service discovery. The results of experi ments show that the proposed algorithm can guarantee higher trustworthy service precision and better integrated service discovery performance in complex network environments, and some useful conclusions were obtained through the analy sis and explanation of the experimental data, laying a solid foundation for further researches.

关 键 词：服务发现 自组织网络 可信服务 动态蚁群策略 子蚂蚁策略 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]