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

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

[1]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[2]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[3]  Mike Holcombe,et al.  Insect communication: ‘No entry’ signal in ant foraging , 2005, Nature.

[4]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Gerhard Weiss,et al.  Multiagent Systems , 1999 .

[6]  Luca Maria Gambardella,et al.  AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks , 2004, PPSN.

[7]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[8]  Brian F. Cooper.  Guiding Queries to Information Sources with InfoBeacons , 2004, Middleware.

[9]  Takashige Hoshiai,et al.  Decentralized Meta-Data Strategies: Effective Peer-to-Peer Search , 2003 .

[10]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[11]  Roberto Montemanni,et al.  Design patterns from biology for distributed computing , 2006, TAAS.

[12]  Manolis Koubarakis,et al.  Multi-agent Systems and Peer-to-Peer Computing: Methods, Systems, and Challenges , 2003, CIA.

[13]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[14]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[15]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[16]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[17]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[18]  Steffen Staab,et al.  Remindin': semantic query routing in peer-to-peer networks based on social metaphors , 2004, WWW '04.

[19]  K. Sycara,et al.  This Is a Publication of the American Association for Artificial Intelligence Multiagent Systems Multiagent System Issues and Challenges Individual Agent Reasoning Task Allocation Multiagent Planning Recognizing and Resolving Conflicts Managing Communication Modeling Other Agents Managing Resources , 2022 .

[20]  K. P. Sycara.  Multiagent systems : Special issue on agents , 1998 .

[21]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[22]  Hein Meling,et al.  Anthill: a framework for the development of agent-based peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[23]  Tim Moors,et al.  Survey of research towards robust peer-to-peer networks: Search methods , 2006, Comput. Networks.