By Topic

Applying Ant-based Multi-Agent Systems to Query Routing in Distributed Environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Elke Michlmayr ; Women's Postgraduate College for Internet Technologies (WIT), Institute for Software Technology and Interactive Systems, Vienna University of Technology, Favoritenstrasse 9-11/E188, 1040 Vienna, Austria. telephone: 0043 1 58801 18816, email: ; Arno Pany ; Sabine Graf

This paper presents SemAnt, a novel ant-based multi-agent system designed for distributed query routing. While the ant metaphor has been successfully applied to network routing both in wireless and fixed networks, little is yet known about its applicability to the task of query routing in distributed environments. We point out the similarities and dissimilarities between routing of data packets and routing of queries, and we present the design of SemAnt, which is based on the ant colony optimization meta-heuristic. For experimental evaluation, we deploy the algorithm in a peer-to-peer environment with a real-world application scenario and compare its performance against the well-known k-random walker approach. As we show, the benefits of SemAnt are that the routes for queries are optimized according to their popularity, and that the algorithm is highly suitable for volatile environments

Published in:

2006 3rd International IEEE Conference Intelligent Systems

Date of Conference:

Sept. 2006