2008 Fourth International Conference on Networked Computing and Advanced Information Management 2008
DOI: 10.1109/ncm.2008.73
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 4 publications
0
6
0
Order By: Relevance
“…Analysis. Before the assessment of Mpid-DMLA, we need to consider two problems [24,25]. The first is the effect of code The performance of the migration of mobile agent in Agilla system has been evaluated in [19].…”
Section: Multiple Mobile Agents Migration Algorithm Performancementioning
confidence: 99%
“…Analysis. Before the assessment of Mpid-DMLA, we need to consider two problems [24,25]. The first is the effect of code The performance of the migration of mobile agent in Agilla system has been evaluated in [19].…”
Section: Multiple Mobile Agents Migration Algorithm Performancementioning
confidence: 99%
“…In the existing mobile agent systems, the migration methods are directly related with the entire performance of the agent systems due to the increased time required for network and agent's size resulting from the successively accumulated results obtained from the previous tasks on the visited hosts. Thus, the agent structure for migration and migration policies are critical to solve these problems [4,5,12,16,17].…”
Section: The Structure Of Migrationmentioning
confidence: 99%
“…Regarding the migration strategy of the mobile agent, most of the existing systems either offer the migration policies guaranteeing the migration reliability depending only on the failure of host or does not provide any policy to guarantee the reliabilty [1,2,3]. Accordingly, the mobile agent becomes useless and faces the problems of infinite waiting or orphan status in case of the node losses, network obstacles or absence of database information services [16,17]. To solve these problems, JAMAS [7] proposed the path readjustment and backward recovery method.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Because mobile agents transfer not only data but also a runtime state and program codes. For this reason, many agent behaviour algorithms have been studied to reduce the amount of traffic behaviour (Chia and Kannapan, 1997;Jurasovic et al, 2006;Lee and Kim, 2008;Miyata and Ishida, 2008). However, these algorithms are complex.…”
Section: Introductionmentioning
confidence: 99%