Controlling an ant colony optimization based search in distributed datasets

Authors:
Boštjan Slivnik;Uroš Jovanovič
Affiliations:
Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia;XLAB Research, Ljubljana, Slovenia
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 6
Cited 0

Jini Specification

Jini Specification
Ant Colony Optimization

Ant Colony Optimization
Agent-Based Load Balancing on Homogeneous Minigrids: Macroscopic Modeling and Characterization

IEEE Transactions on Parallel and Distributed Systems
Ant-Based Clustering and Topographic Mapping

Artificial Life
The complexity of static data replication in data grids

Parallel Computing
Toward nature-inspired computing

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

An ant colony optimization method for searching in (possibly dynamic and/or unstructured) distributed datasets, as introduced by Jovanovič et. al [1], is considered. This paper provides two new results. Firstly, it describes how this method can easily be controlled by using different kinds of ants for aggregation of data found: "classic" pheromone aggregation ants should be used if network load caused by a distributed search should be strictly kept within given limits, while one-time aggregation ants should be used if the search process should react quickly due to changes in a dynamic distributed dataset. Secondly, it demonstrates that one-time aggregation ants are more effective than pheromone aggregation ants.