Using taxonomies for content-based routing with ants

被引:22
作者
Michlmayr, Elke [1 ]
Pany, Arno
Kappel, Gerti
机构
[1] Vienna Univ Technol, Womens Postgrad Coll Internet Technol, Inst Software Technol & Interact Syst, Vienna, Austria
[2] Vienna Univ Technol, Business Informat Grp, Inst Software Technol & Interact Syst, Vienna, Austria
关键词
peer-to-peer search; ant algorithms; taxonomies;
D O I
10.1016/j.comnet.2007.06.015
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:4514 / 4528
页数:15
相关论文
共 36 条
[1]  
Aberer K., 2003, P 12 INT WORLD WID W
[2]  
ABERER K, 2004, P 9 INT C DAT SYST A
[3]  
[Anonymous], 1997, P 10 RES COMP LING I
[4]  
[Anonymous], FDN GENETIC ALGORITH
[5]  
[Anonymous], PHYS REV E
[6]  
Association for Computing Machinery, 1998, ACM COMP CLASS SYST
[7]  
BABAOGLU O, 2005, P EUR C COMPL SYST
[8]  
BABAOGLU O, 2002, MODERN INFORM RETRIE
[9]   Looking up data in P2P systems [J].
Balakrishnan, I ;
Kaashoek, MF ;
Karger, D ;
Morris, R ;
Stoica, I .
COMMUNICATIONS OF THE ACM, 2003, 46 (02) :43-48
[10]   Efficient search in unstructured peer-to-peer networks [J].
Cholvi, V ;
Felber, P ;
Biersack, E .
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2004, 15 (06) :535-548