基于Agent及蚁群算法的分布式服务发现.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.8, August 2010, pp.1795− 1809 doi: 10.3724/SP.J.1001.2010.03669 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 基于 Agent 和蚁群算法的分布式服务发现 1,2+ 1 1 郑 啸 , 罗军舟 , 宋爱波 1(东南大学 计算机科学与工程学院,江苏 南京 210096) 2(安徽工业大学 计算机学院,安徽 马鞍山 243002) Distributed Service Discovery Based on Agent and Ant Colony Algorithm 1,2+ 1 1 ZHENG Xiao , LUO Jun-Zhou , SONG Ai-Bo 1(School of Computer Science and Engineering, Southeast University, Nanjing 210096, China) 2(School of Computer, Anhui University of Technology, Maanshan 243002, China) + Corresponding author: E-mail: xzheng@ Zheng X, Luo JZ, Song AB. Distributed service discovery based on agent and ant colony algorithm. Journal of Software, 2010,21(8):1795−1809. /1000-9825/3669.htm Abstract : This paper suggests an ant-like agent service discovery mechanism. There are two types of agents cooperating to search target services: Search Agent and Guide Agent. Search Agent simulates the behavior of an ant that searches for services on the network. Guide Agent is responsible to manage a service route table that consists of pheromone and hop count, instructing Search Agent’s routing. Volatile pheromones make Search Agent sense the change of topology and service resource, and hop count makes them know the distance. Semantic similarity is also introduced in routing selection as a heuristic factor, which improves the recall. The life-span control policy makes query traffic controllable. With sy