Route planning for agent-based information retrieval

Authors:
Irene Sygkouna;Marios-Polychronis Drakos;Miltiades Anagnostou
Affiliations:
Computer Networks Laboratory, School of Electrical & Computer Engineering, National Technical University of Athens (NTUA), Athens, Greece;Computer Networks Laboratory, School of Electrical & Computer Engineering, National Technical University of Athens (NTUA), Athens, Greece;Computer Networks Laboratory, School of Electrical & Computer Engineering, National Technical University of Athens (NTUA), Athens, Greece
Venue:
Computational Optimization and Applications
Year:
2010

Citing 7
Cited 0

A performance evaluation of the mobile agent paradigm

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Agent-oriented technology in support of e-business

Communications of the ACM
Introduction to algorithms

Introduction to algorithms
Performance analysis of mobile agents for filtering data streams on wireless networks

Mobile Networks and Applications - Analysis and Design of Multi-Service Wireless Networks
A Framework for Network Management Using Mobile Agents

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Mobile agent planning problems

Mobile agent planning problems
Mobile agents for network management

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article focuses on Mobile Agents and their use for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve distributed data from network nodes. Increasing the number of agents may speed-up information retrieval but is burdensome to performance. Initiating with a given number of agents, our objective is to determine the routes of the agents so that the task completion time is minimized. Two known and one new polynomial-time algorithms are tested that produce near-optimal solutions. Simulation results show the cases for which each one is most effective. Additionally, we study the influence of various parameters on the solution. By parametrically varying the number of agents, our method can be used to determine the minimum number that satisfies the desired trade-off between time and performance.