کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
451494 | 694310 | 2007 | 15 صفحه PDF | دانلود رایگان |
This paper presents the SemAnt algorithm, a distributed content-based routing algorithm for peer-to-peer networks based on the Ant Colony Optimization meta-heuristic. Under the assumption that the shared content in the network is annotated according to a taxonomy, it is possible to determine the hierarchical relationships between queries, and to exploit this information to improve the routing process. The experimental results presented in this paper show that the performance of content-based peer-to-peer search is highly dependent on the content distribution in the network and on the network’s topology. It can be improved by exploiting the information provided by the underlying taxonomy. The degree of improvement is proportional to the degree of coherence in the content distribution.
Journal: Computer Networks - Volume 51, Issue 16, 14 November 2007, Pages 4514–4528