DocumentCode
401741
Title
Strategically migrating agents in itinerary graph
Author
Yang, Bo ; Liu, Da-you ; Yang, Kun ; Wang, Shengsheng
Author_Institution
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
Volume
3
fYear
2003
fDate
2-5 Nov. 2003
Firstpage
1871
Abstract
Mobile agent need migrate to several hosts for accomplishing its task. Migration strategy is responsible for planning out an optimal migration path, which ensures mobile agent to complete its task correctly and efficiently at the minimum cost. The paper introduces the concept of itinerary graph and presents three migration strategies based on it. Itinerary graph not only describes the migration semantics of mobile agent but also reflects the changes of software and hardware environment where mobile agent lives. During its travel, mobile agent equipped with itinerary graph perceives these changes, react quickly, modify its migration path autonomously and accomplish its task according to certain specified criterions, which embody the reactivity and autonomy of agent. Besides improving the efficiency, these migration strategies enhances the performance of mobile agent system because they avoid migration failure resulted from network disconnection or node crashing.
Keywords
graphs; mobile agents; path planning; hardware environment; itinerary graph; migration strategy; mobile agent system; network disconnection; node crashing; optimal migration path; Computer science; Cost function; Distributed computing; Educational institutions; Educational technology; File servers; Knowledge engineering; Mobile agents; Path planning; Strategic planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN
0-7803-8131-9
Type
conf
DOI
10.1109/ICMLC.2003.1259802
Filename
1259802
Link To Document