| 结构化覆盖网络CayDHT的复杂搜索算法 |
| |
| 引用本文： | 梁活民,肖文俊,魏文红. 结构化覆盖网络CayDHT的复杂搜索算法[J]. 华南理工大学学报(自然科学版), 2011, 0(10): 84-89 |
| |
| 作者姓名： | 梁活民 肖文俊 魏文红 |
| |
| 作者单位： | 华南理工大学计算机科学与工程学院;华南理工大学软件学院;华南理工大学电子与信息学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(61170313,61103037); 博士后科学基金资助项目(20110490883) |
| |
| 摘 要： | CayDHT是一种基于Cayley图的常数度结构化对等覆盖网络,对于精确的单关键字搜索效率非常高,但不支持不限定搜索形式的复杂搜索.通过分析CayDHT的拓扑性质,提出了一种基于虚拟搜索树的复杂搜索算法VTCS.该算法无需维护额外的树结构,根据消息参数就可以获得下一跳节点的地址.理论分析表明该算法可以在O(logN)的...
|
| 关 键 词： | 覆盖网络 CayDHT Cayley图 复杂搜索 |
Complex Search Algorithm for Structured Overlay Network CayDHT |
| |
| Liang Huo-min Xiao Wen-jun Wei Wen-hong. Complex Search Algorithm for Structured Overlay Network CayDHT[J]. Journal of South China University of Technology(Natural Science Edition), 2011, 0(10): 84-89 |
| |
| Authors: | Liang Huo-min Xiao Wen-jun Wei Wen-hong |
| |
| Affiliation: | Liang Huo-min1 Xiao Wen-jun2 Wei Wen-hong3(1.School of Computer Science and Engineering,South China University of Technology,Guangzhou 510006,Guangdong,China,2.School of Software Engineering,3.School of Electronic and Information Engineering,Guangzhou 510640,China) |
| |
| 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 in... |
| |
| Keywords: | overlay networks CayDHT Cayley graph complex search |
| 本文献已被 CNKI 等数据库收录！ |
|
