一种基于指向路径分次删剪的移动Agent通信算法  

A Highly Adaptive and Reliable Algorithm for Mobile Agent Communication

作　　者：贾志勇[1,2] 罗杰[1,2] 王德强[1,2] 谢立 

机构地区：[1]南京大学计算机系软件新技术国家重点实验室,南京210093 [2]南京大学计算机科学与技术系,南京210093

出　　处：《计算机科学》2004年第1期20-24,共5页Computer Science

基　　金：国家863项目基金(No.2001AA113050)

摘　　要：在移动agent环境下,agent的移动为应用程序的开发提供了更灵活的通信处理方式,但也同时对通信算法的设计提出了许多挑战,其中最突出的就是由于消息传输和agent移动之间的异步性而造成的通信不可靠问题。针对目前解决该问题的各种机制和算法的不足之处,该文提出了一种新的agent通信算法—S_COMP,它综合采用了Home寻址、途经节点转发、指向路径分次删剪和集中同步等手段,能够适应具有不同移动和通信特点的agent的通信需要,在确保消息传输可靠性的同时兼顾了效率和适应性。In mobile agent environment, the migration of agent provides a more flexible way to deal with communication in application development, while it also provides many challenges to the design of the communication algorithm. Among them, the most obvious one is the loss of messages caused by the asynchronous nature of message passing and agent migration. With the drawbacks of current mechanisms and algorithms to solve this problem considered, this article provides a new agent communication algorithm-S_COMP. The algorithm uses such methods as home registration, migration path forwarding, path shortening by stages and central synchronization, and can meet requirements of agents with different migration and communication properties. In addition to ensuring the reliability, it also gives considerations to efficiency and adaptivity.

关 键 词：移动Agent通信算法 应用程序 异步性 可靠性 适应性 

分 类 号：TN911[电子电信—通信与信息系统]