Journal of South China University of Technology (Natural Science Edition) ›› 2011, Vol. 39 ›› Issue (10): 84-89.doi: 10.3969/j.issn.1000-565X.2011.10.015

• Computer Science & Technology • Previous Articles     Next Articles

Complex Search Algorithm for Structured Overlay Network CayDHT

Liang Huo-min1  Xiao Wen-jun2   Wei Wen-hong3   

  1. 1. School of Computer Science and Engineering,South China University of Technology,Guangzhou 510006,Guangdong,China; 2. School of Software Engineering,South China University of Technology,Guangzhou 510006,Guangdong,China; 3. School of Electronic and Information Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China
  • Received:2011-04-07 Revised:2011-04-15 Online:2011-10-25 Published:2011-09-01
  • Contact: 梁活民(1980-) ，男，博士生，主要从事网络虚拟化、并行与分布计算研究． E-mail:iosliang@126.com
  • About author:梁活民(1980-) ，男，博士生，主要从事网络虚拟化、并行与分布计算研究．
  • Supported by:

    国家自然科学基金资助项目( 61170313， 61103037) ; 博士后科学基金资助项目( 20110490883)

PDF

887

Abstract:

CayDHT is a constant-degree structured peer-to-peer overlay network based on Cayley graph,and it is very efficient in accurate single keyword search but does not support complex searches with unrestricted form. In this paper,by analyzing the topological properties of CayDHT,a virtual tree-based complex search ( VTCS) algorithm is proposed,which needs no maintenance of the extra tree structure and can obtain the address of the next hop only according to the parameters inside the messages. Theoretical analyses indicate that the proposed algorithm can complete the search without redundant messages within O( logN) hops. Simulation results show that VTCS is more reasonable than Flooding and RW.

Key words: overlay networks, CayDHT, Cayley graph, complex search