Skip to main content
Journal ArticleOPEN ACCESS

Efficient migration algorithm for mobile agents in wired/wireless internets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2660 626-634
DOI: 10.1007/3-540-44864-0_65
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Mobile agents are active objects that automatically migrate from one node to other node in wired/wireless Internets. Due on failures of clients, mobile agents may be blocked or crashed even if there are available service. To solve this situation, we propose efficient migration algorithm with reordering and backward recovery of the paths to guarantee the migration of mobile agents. The proposed algorithm not only affords to avoid any faults of nodes or clients of mobile agents on Internet but also affects to agents' life span. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Han, S., Kim, K. J., & Kim, Y. S. (2003). Efficient migration algorithm for mobile agents in wired/wireless internets. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2660, 626–634. https://doi.org/10.1007/3-540-44864-0_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free