Font Size: a A A

A MA Sub-Optimal Migration Arithmetic Based On Probability

Posted on:2005-11-12Degree:MasterType:Thesis
Country:ChinaCandidate:Y W FengFull Text:PDF
GTID:2168360125965982Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Mobile Agent (MA) is software that is independent to the environment. MA can migrate independent from one node to another in the heterogeneous network according some rules to find resources. When MA found the resources and finished its migration, the MA would have the advantage of staying with the resources it needed on the same machine. So it can finish the given job behalf the user by the advantage. The unique characters decide MA will be widely used in coming network that will be mainly composed of wireless networks and full of mobile equipment. So MA has splendid future. But now, the researches on MA theory are just on initiatory stage and some applications used MA are just for the aim of experiment and in small scope. The theories of network are mainly developed for the network nowadays which changes less frequently and full of static services. So it doesn't adapt to being used in MA. For this reason, we have to do a large amount of basic research job in future days in order to satisfy the needs of putting MA into future practically and widely used.This paper analyses the technical characters, developed process, future and main problems of MA. We focus on the kernel of MA theory: routing theory and analyses several different routing theories. On the basis of their merits and disadvantages, we put forward a new routing theory simulating ant algorithmic routine. For the new routing theory's better performance, a new services register system is proposed to adapt to it. On the basis of new routing theory, the paper put forward a new MA migration arithmetic: Base on Probability P. It can MA migrate along not only the best road but also all the possible roads. In order to update the routing table, the new arithmetic make MA feed back the time of finishing the task and change the routing information according some rules. It is proved by the simulation result that the new arithmetic has better performance than traditional arithmetic when the network's load is heavy. And it can reduce the time delay of MA's migration.
Keywords/Search Tags:Mobile Agent, Agent Register System, Ant Arithmetic, Probability, Feedback, Sub-optimal Arithmetic
PDF Full Text Request
Related items