Optimal Migration Path Searching Using Path Adjustment and Reassignment for Mobile Agent

In traditional agent systems, if various and large quantities of tasks are required from users, network traffic overload and extended processing time are resulted by continuous increase in the sizes of agents. Also, if an agent migrates to the destination node following user-specified passive routing schedules, it cannot actively cope with some accidental situations, such as communication loss or node obstacles, and requires high cost for node traversals. Therefore, more efficient migration techniques for mobile agents that can solve the excessive network traffic problems are required to guarantee the reliability of migration and reduce traversal task processing time.In this paper, we present the migration method of a mobile agent that uses network traffic perception instead of a user-specified passive routing scheduling system for an automatic migration. Also, we formulate a network traffic measurement model to guarantee the optimality of selected paths, and propose path adjustment and reassignment techniques to ensure the reliability of migrations on distributed nodes and reduce traversal task processing time. The proposed migration method aims at minimizing the required time for traversal processing to all destination nodes in the network by supporting active and automatic routing scheduling in optimal migration path searches. And the purpose of it, as well as path adjustment and reassignment techniques, is to guarantee reliable, stable and fast migration of mobile agents.