Ant Algorithms for Search in Unstructured Peer-to-Peer Networks

Authors:
Elke Michlmayr
Affiliations:
Vienna University of Technology, Austria
Venue:
ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Year:
2006

Citing 0
Cited 12

Using taxonomies for content-based routing with ants

Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-organization for search in peer-to-peer networks: the exploitation-exploration dilemma

Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems
A path-traceable query routing mechanism for search in unstructured peer-to-peer networks

Journal of Network and Computer Applications
Elephants journey towards successful resource discovery in unstructured P2P networks

IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
LESSON: A system for lecture notes searching and sharing over Internet

Journal of Systems and Software
SoFA: An expert-driven, self-organization peer-to-peer semantic communities for network resource management

Expert Systems with Applications: An International Journal
Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents

Journal of Network and Systems Management
A deniable and efficient question and answer service over ad hoc social networks

Information Retrieval
MaGate: An Interoperable, Decentralized and Modular High-Level Grid Scheduler

International Journal of Distributed Systems and Technologies
Performance evaluation of an ant colony based routing algorithm in the presence of a misbehaving node

Proceedings of the First International Conference on Security of Internet of Things
On the performance of ACO-based methods in p2p resource discovery

Applied Soft Computing
Enhancing decentralized service discovery in open service-oriented multi-agent systems

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of query routing in peer-to-peer environments. This work presents SemAnt, an algorithm for distributed query routing based on the Ant Colony Optimization meta-heuristic. The experimental results show that the algorithm produces robust results and converges fast. Based on the results gained so far, the goal for the Ph.D. thesis is to extend the algorithm to include strategies for self-adaptation to volatile networks where nodes may leave or join at any time.