본문 바로가기
  • Home

Optimal Path Searching for Efficient Migration of Mobile Agent

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2006, 11(3), pp.117-124
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

김광종 1 Young-Ja Kim 1 Yonsik Lee 1 Ko, Hyeon 1

1군산대학교

Candidate

ABSTRACT

In this paper, we propose the optimal migration path searching method including path adjustment and reassignment techniques for an efficient migration of mobile agent which has an autonomous ability for some task processing. In traditional agent system, if the various and large quantity of task processing were required from the users, it could be derive excessive network traffic and overload due to increasing the size of agent. And also, if an agent migrates from node to node according to routing schedules specified by the user at which the most of network traffic occurs, it could not actively cope with particular situations such as communication loss and node obstacles and required much cost for node traversal. Therefore, this paper presents the migration method of agent which can try to adjust and reassign path tothe destination automatically through the optimal path search using by network traffic perception in stead of the passive routing schedule by the user. An optimal migration path searching and adjustment methods ensure the migration reliability on distributed nodes and reduce the traversal task processing time of mobile agent by avoiding network traffic paths and node obstacles.

Citation status

* References for papers published after 2023 are currently being built.