loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd International Conference on Data Engineering Workshops (ICDEW'06)
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Atlanta, Georgia
April 03-April 07
ISBN: 0-7695-2571-7
Elke Michlmayr, Vienna University of Technology, Austria
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.
Citation:
Elke Michlmayr, "Ant Algorithms for Search in Unstructured Peer-to-Peer Networks," icdew, pp.x142, 22nd International Conference on Data Engineering Workshops (ICDEW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.