作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (1): 1-3. doi: 10.3969/j.issn.1000-3428.2009.01.001

• 博士论文 •    下一篇

基于Skip Graph的P2P覆盖网信任证链发现

徐 浩1,2,3,阎保平1   

  1. (1. 中国科学院计算机网络信息中心,北京 100080;2. 中国科学院计算技术研究所,北京 100080;3. 中国科学院研究生院,北京 100039)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-01-05 发布日期:2009-01-05

Skip Graph-based Credential Chain Discovery on P2P Overlay Network

XU Hao1,2,3, YAN Bao-ping1   

  1. (1. Computer Network Information Center, Chinese Academy of Sciences, Beijing 100080; 2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080; 3. Graduate University of Chinese Academy of Sciences, Beijing 100039)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-01-05 Published:2009-01-05

摘要: 提出一种基于Skip图 P2P覆盖网模型的分布式信任证存储和发现机制。为保证索引和发现效率,采用 语言作为信任证描述语言,其语义属性作为Skip图中的索引关键字,构造了基于关键字前缀相似和支持范围查询的P2P覆盖网。通过试验评测和分析,该机制具有较高的查询效率和负载均衡机制。

关键词: Skip图, 信任证, 信任证链, 点对点

Abstract: This paper proposes a peer-to-peer framework, which adopts Skip graph named CredentialIndex as the overlay network for credential storage and credential chain discovery. To guarantee discovery efficiency, CredentialIndex schemes policy language and extracts its semantic attributes as indexing keys in Skip graph. The P2P overlay network is constructed to aggregate prefix similar keys to support range query and keep load balance on peer nodes. Evaluation shows that the CredentialIndex system performs considerable credential chain discovery efficiency and reasonable load balance.

Key words: Skip graph, credential, credential chain, peer-to-peer

中图分类号: