Enhancing Mobile Agents Performance in Distributed Systems Environment
Yasser Kamal Ali Abo Mandour;
Abstract
Mobile agents are groups of executing objects that can migrate from node to node in a heterogeneous network. Mobile agent systems offer advantages such as better performance, lower usage of network bandwidth, and asynchronous processing. The migration of agents comprises the transport of data, code, and execution state from one node to another. In large scale communication, agents have to be generated frequently and dispatched to the network, thus they will certainly consume a certain amount of bandwidth of each link in the network. If there are a lot of agents' migrations through one or several links at the same time, they will introduce much transferring overheads to the links. Eventually, these links will be busy and indirectly block the network traffic. Therefore, there is a need to develop routing algorithms in order to control the traffic load
In this thesis, first we proposed mobile agent-based routing algorithm (MARA), we investigated how agents should behave if they have to set their decisions on possibly known traffic information. We presented agents migration processes based on decision tree on known traffic information. We compared performance evaluation of proposed mobile agent based routing algorithm (MARA) with existing solution (e.g. Open Shortest Path First (OSPF) routing algorithm). Experimental results were applied based on three cases, case one, when all nodes send a fixed numbers of agents to a certain node in a network. Case two, when running a fixed numbers of agents on a varying numbers of nodes, and Case three when running a varying numbers of agents
on a fixed numbers of nodes.
The simulation results showed that our purposed solution (MARA) achieve
performance in dynamic network better than existing solution (OSPF).
'
The second contribution in this thesis was presented to solve the problem of individual
agents working in isolation. The contribution is done by finding the optimization of
mobile agent collaboration effect. We used Reinforcement learning algorithm to change
In this thesis, first we proposed mobile agent-based routing algorithm (MARA), we investigated how agents should behave if they have to set their decisions on possibly known traffic information. We presented agents migration processes based on decision tree on known traffic information. We compared performance evaluation of proposed mobile agent based routing algorithm (MARA) with existing solution (e.g. Open Shortest Path First (OSPF) routing algorithm). Experimental results were applied based on three cases, case one, when all nodes send a fixed numbers of agents to a certain node in a network. Case two, when running a fixed numbers of agents on a varying numbers of nodes, and Case three when running a varying numbers of agents
on a fixed numbers of nodes.
The simulation results showed that our purposed solution (MARA) achieve
performance in dynamic network better than existing solution (OSPF).
'
The second contribution in this thesis was presented to solve the problem of individual
agents working in isolation. The contribution is done by finding the optimization of
mobile agent collaboration effect. We used Reinforcement learning algorithm to change
Other data
| Title | Enhancing Mobile Agents Performance in Distributed Systems Environment | Other Titles | تحسين اداء الوكيل الجوال في بيئة النظم الموزعة | Authors | Yasser Kamal Ali Abo Mandour | Issue Date | 2008 |
Attached Files
| File | Size | Format | |
|---|---|---|---|
| Yasser Kamal Ali Abo Mandour.pdf | 1.55 MB | Adobe PDF | View/Open |
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.