| 摘要: |
| 结构化P2P网络是构建于物理网络拓扑之上的一层Overlay网络,两层之间的唯一联系是Hash散列函数,这种Hash关系使得节点的逻辑ID号与物理位置之间不存在任何联系.从分析Hash散列函数的性质入手,归纳出目的节点、传统(chord)语义路由中继节点序列、聚类邻居节点集三者之间的逻辑关联特性,并将其应用于所提出的基于自组织聚类的语义路由改进算法SCSRAA(self-organizing clustering semantic routing advarced algorithm)中,从而达到提高语义路由效率的研究目的.针对自组织模式下聚类节点仅存在局部视图的特性,详细讨论了聚类算法及节点获取其他节点物理位置信息的各种规则,给出了SCSRAA路由算法详尽的描述及理论分析.仿真实验表明,该算法具有较强的语义路由效率提升能力. |
| 关键词: P2P 语义路由算法 物理拓扑 自组织 聚 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant No.60573133 (国家自然科学基金); the National Grand Fundamental Research 973 Program of China under Grant No.2003CB314801 (国家重点基础研究发展规划(973)) |
|
| An Advanced Algorithm to P2P Semantic Routing Based on the Topologically-Aware Clustering in Self-Organizing Mode |
|
LIU Ye,YANG Peng
|
| Abstract: |
| Structured P2P Networks create a virtual topology on top of the physical topology. The only relation between the two layers is the hashing algorithm, which makes the node’s logical ID independent of its physical location. By analyzing the Hash function, some novel logical connections among the destination node, the traditional semantic routing relay node sequence, and the ID of the clustering neighboring nodes are found. In this paper, the SCSRAA (self-organizing clustering semantic routing advanced algorithm) is resented to improve the efficiency of semantic routing. Since the clustering nodes only have local views in self-organizing mode, some rules are proposed for a node to learn other nodes’ physical location. The SCSRAA’s routing algorithm is described completely. Simulations have verified that the method can improve the semantic routing efficiently. |
| Key words: P2P semantic routing algorithm physical topology self-organizing clustering |
