SciELO - Scientific Electronic Library Online

vol.13 issue4New Algorithm Transgenic with Homology to solve the problem of OneMaxPrototype Selection Methods author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Computación y Sistemas

Print version ISSN 1405-5546


GOMEZ SANTILLAN, Claudia et al. A Self-Adaptive Ant Colony System for Semantic Query Routing Problem in P2P Networks. Comp. y Sist. [online]. 2010, vol.13, n.4, pp.433-448. ISSN 1405-5546.

In this paper, we present a new algorithm to route text queries within a P2P network, called Neighboring-Ant Search (NAS) algorithm. The algorithm is based on the Ant Colony System metaheuristic and the SemAnt algorithm. More so, NAS is hybridized with local environment strategies of learning, characterization, and exploration. Two Learning Rules (LR) are used to learn from past performance, these rules are modified by three new Learning Functions (LF). A Degree-Dispersion-Coefficient (DDC) as a local topological metric is used for the structural characterization. A variant of the well-known one-step Lookahead exploration is used to search the nearby environment. These local strategies make NAS self-adaptive and improve the performance of the distributed search. Our results show the contribution of each proposed strategy to the performance of the NAS algorithm. The results reveal that NAS algorithm outperforms methods proposed in the literature, such as Random-Walk and SemAnt.

Keywords : Search Process; Internet; Complex Network; Ant Colony System; Local Environment; Neighbor.

        · abstract in Spanish     · text in English     · English ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License