分布式检索系统中基于蚁群的移动agent动态迁移算法  

Mobile agent dynamitic migration algorithm in distributed information retrieval system based on ant colony algorithm

作　　者：党辰[1] 王嘉祯[1] 刘爱珍[1] 赵新青[1] 

机构地区：[1]军械工程学院计算机工程系网络与通信教研室,石家庄050003

出　　处：《计算机应用研究》2010年第3期868-870,878,共4页Application Research of Computers

基　　金：国家"863"计划资助项目(2004AA1Z2450);河北省科技攻关计划资助项目(052435179D)

摘　　要：以真实蚁群算法为基础,提出了一种分布式信息检索下的移动agent动态迁移算法。该算法有如下特点:a)Agent能根据当前主机的状态,自主选择下一个负载轻的主机移动;b)Agent能找到一条开销最小的路径移动。仿真结果表明,该算法与固定路由算法相比,性能提高80%以上,并且算法无须依赖集中的迁移模块。蚁群算法分布在各节点中,提高了系统的容错性,具有分布、并行的特点。This paper distributed a mobile agent dynamitic migration algorithm in information retrieve system founded on real ant colony algorithm had two features： a）According to current hosts＇ status, agent could independently choice the next host of small load factor to move; b）Agent could find a lowest overheadroute to move. The experiments show that agents migration spending can be improved 80% than changeless routing algorithm. And the algorithm dispense with central migration program. The system fault tolerance has been enhanced because＇ of ant colony algorithm being built in each host.

关 键 词：移动AGENT 蚁群算法 迁移策略 分布式系统 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP18[自动化与计算机技术—计算机科学与技术]