The Guarantee for Message Delivery of Mobile Agent

碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 92 === The information technologies that include the Internet, distributed system, wireless communication and mobile network have been rapid developing that leading to the network techniques and applications ideal. The novel mobile agent techniques always are applied i...

Full description

Bibliographic Details
Main Authors: Hou-Hsin Liu, 劉後欣
Other Authors: Fang-Chang Lin
Format: Others
Language:zh-TW
Published: 2004
Online Access:http://ndltd.ncl.edu.tw/handle/9t7895
Description
Summary:碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 92 === The information technologies that include the Internet, distributed system, wireless communication and mobile network have been rapid developing that leading to the network techniques and applications ideal. The novel mobile agent techniques always are applied in about-mentioned topics. In the distributed network environment, message must move along the traces of mobile agent migrated to track the mobile agent when manager sent out the message. In fact, the mobile agent always migrates along circle round near the manager. For this reason, the trace of mobile agent migrated is not a shortest path for the message movement. This paper proposed a message delivery mechanism that is the MASPG (Mobile Agent Shortest Path with Guarantee algorithm). The MASPG can actively search shortest communication path and substitute communication path for the communication of manager with mobile agent. The MASPG message delivery mechanism utilizes the Network Initialization and MASPG algorithm to create the hierarchical tree for all nodes then exploits the information about connection states of node-to-node to search shortest communication path. The MASPG message delivery mechanism can shorten the distance of message delivery and decrease the time of the communication. Not only that the MASPG also can provide the guarantee of the message delivery to reduce the communication costs between manager and mobile agent when any connection on the shortest communication path is disconnect.