Managing server load in global memory systems
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Mobile agents
Timed mobile agent planning for distributed information retrieval
Proceedings of the fifth international conference on Autonomous agents
Improving Distributed Workload Performance by Sharing Both CPU and Memory Resources
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Agent Chaining: An Approach to Dynamic Mobile Agent Planning
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Using cooperative mobile agents to monitor distributed and dynamic environments
Information Sciences: an International Journal
On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Self-Aggregation Techniques for Load Balancing in Distributed Systems
SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Decentralized Load Balancing for Improving Reliability in Heterogeneous Distributed Systems
ICPPW '09 Proceedings of the 2009 International Conference on Parallel Processing Workshops
A parameter-free load balancing mechanism for P2P networks
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Applications and design issues for mobile agents in wireless sensor networks
IEEE Wireless Communications
| Hi-index | 0.00 |
Recently, the distributed and mobile agent concept has become a new computing paradigm in the Internet distributed computing. Itinerary planning is one of the important requirements for mobile agents in completing the given task efficiently. The static itinerary planning may not be the best approach in real network environments as the status of network components are subject to change dynamically. Dynamic itinerary planning makes the agent to change the itinerary dynamically according to the current state of network. For an information retrieval application, the main issue is to find an optimal itinerary for the mobile agent in order to achieve the efficient and effective data collection. Further, for a host to accommodate a remote agent, it must be ensured that the work load of the host is manageable. This paper provides an environment that selects the next optimal host for the mobile agent to visit by requesting the available directory services on the fly. For a host, to accommodate the incoming agents and to maintain work load, this paper provides a mechanism that either destroys the agents for which the task is completed or transferred to secondary memory if the mobile agent is waiting for an event to occur. The presented work is tested in a web environment and the results obtained are more encouraging in claiming that this work provides an efficient dynamic itinerary plan for the migration and sufficient space at the host for the execution.