Ant-based load balancing in telecommunications networks
Adaptive Behavior
The ant colony optimization meta-heuristic
New ideas in optimization
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Distributed Systems: Principles and Paradigms
Distributed Systems: Principles and Paradigms
A Taxonomy of Hybrid Metaheuristics
Journal of Heuristics
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Using taxonomies for content-based routing with ants
Computer Networks: The International Journal of Computer and Telecommunications Networking
Research on Peer Selection in Peer-to-Peer Networks using Ant Colony Optimization
ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 07
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Digital ants as the best cicerones for museum visitors
Applied Soft Computing
Expert Systems with Applications: An International Journal
Development of a peer-to-peer information sharing system using ontologies
Expert Systems with Applications: An International Journal
A multicriteria ant colony algorithm for generating music playlists
Expert Systems with Applications: An International Journal
A unified view on hybrid metaheuristics
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
The hyper-cube framework for ant colony optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
Over the recent years peer-to-peer (p2p) systems have become increasingly popular. As of today most of the internet IP traffic is already transmitted in this format and still it is said to double in volume till 2014. Most p2p systems, however, are not pure serverless solutions, nor is the searching in those networks highly efficient, usually achieved by simple flooding. In order to confront with the growing traffic we must consider more elaborate search mechanisms and far less centralized environments. An effective proposal to this problem is to solve it in the domain of ant colony optimization metaheuristics. In this paper we present an overview of ACO algorithms that offer the best potential in this field, under the strict requirements and limitations of a pure p2p network. We design several experiments to serve as an evaluation platform for the mentioned algorithms to conclude the features of a high quality approach. Finally, we consider two hybrid extensions to the classical algorithms, in order to examine their contribution to the overall quality robustness.