A Mobile Agent Sub-optimal Migration Algorithm Based on Probability

Author

Wei, Zhiqiang ; Feng, Yewei

Author_Institution

Comput. Sci. Dept., Ocean Univ. of China, Qingdao, China

fYear

2009

fDate

7-8 Nov. 2009

Firstpage

413

Lastpage

417

Abstract

In this paper, we present a new routing theory simulating ant algorithm routing and put forward a new mobile agent (MA) migration algorithm based on probability. According to the algorithm, MA will migrate not only along the best road but also along other possible roads. In order to update the routing table, the new algorithm makes MA feed back the time of finishing the task and change the routing information according to some certain rules. It is proved by the simulation result that the new algorithm has better performance than traditional ones when the network´s load is heavy. And it can reduce the time delay of MA´s migration.

Keywords

mobile agents; telecommunication network routing; ant algorithm routing; mobile agent suboptimal migration algorithm; routing theory; Algorithm design and analysis; Ant colony optimization; Clustering algorithms; Communication system traffic control; Computer science; Delay; Electronic mail; Mobile agents; Oceans; Routing; Ant Arithmetic; Feedback; Mobile Agent; Probability; Sub-optimal Arithmetic;

fLanguage

English

Publisher

ieee

Conference_Titel

Web Information Systems and Mining, 2009. WISM 2009. International Conference on

Conference_Location

Shanghai

Print_ISBN

978-0-7695-3817-4

Type

conf

DOI

10.1109/WISM.2009.90

Filename

5369398