Speeding-up information retrieval with the employment of a multi-agent system

Authors:
Irene Sygkouna;Miltiades E. Anagnostou
Affiliations:
Computer Networks Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, 9, Heroon Polytechneiou Str., 15773, Zografou, Athens, Greece.;Computer Networks Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, 9, Heroon Polytechneiou Str., 15773, Zografou, Athens, Greece
Venue:
International Journal of Wireless and Mobile Computing
Year:
2010

Citing 7
Cited 1

Multiagent systems: an emerging subdiscipline of AI

ACM Computing Surveys (CSUR)
A Brokerage Framework for Internet Commerce

Distributed and Parallel Databases - Special issue on electronic commerce
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
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 Manifesto for Agent Technology: Towards Next Generation Computing

Autonomous Agents and Multi-Agent Systems
Mobile agents for network management

IEEE Communications Surveys & Tutorials

Optimal order of truncation and aliasing errors for multi-dimensional Whittaker-Shannon sampling expansion

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on Mobile Agents (MAs) and their use for information retrieval. A multi-agent system is considered; a number of agents are involved in a cooperative effort to retrieve distributed data from network nodes. Our objective is to find the routes of the agents so that the total completion time is minimised. The system design goal of producing an 'optimal' answer with minimal use of communication and processing resources is the driving reason for testing three heuristic algorithms. Our endmost goal is to achieve an 'acceptable' answer using a 'reasonable' amount of communication resources.