摘要
设计了一种算法RIOT(Return Immediately Out Time),该算法在个性化信息搜索系统中,当网络通讯出现异常时仍能保证移动Agent在可容忍时间内得到有关信息。其基本思想是:首先派出一个移动Agent按照预定规划路径搜集信息,当网络出现故障而致使移动Agent未能在预定时间返回时,另外一个移动Agent被派出并与原移动Agent通信,原移动Agent将继续完成剩余任务。与理论最优方法相比,该算法简单易用、网络带宽占用率低。
We present an algorithm, RIOT（ Return Immediately Out Time）, to insure a multi-agent system to get the relevant information within a tolerable time frame when abnormal communication happens. Its core idea is a first mobile agent searching information along a prearranged route, a second mobile agent being appointed to communicate with it if it can not return in a prearranged time slot, and then it continuing to perform the remaining duties. The algorithm is quite simple and practicable and its network bandwidth occupation is very less, as compared with the optimal approach in theory.
出处
《山东科学》
CAS
2009年第4期53-58,共6页
Shandong Science
基金
山东省高等学校优秀青年教师访问学者项目
关键词
移动AGENT
个性化信息搜索
超时即返
mobile agent
personalized information search
Return Immediately Out Time （RIOT）
