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

Skip Graph-based Credential Chain Discovery on P2P Overlay Network

作　　者：徐浩[1,2,3] 阎保平[1] 

机构地区：[1]中国科学院计算机网络信息中心,北京100080 [2]中国科学院计算技术研究所,北京100080 [3]中国科学院研究生院,北京100039

出　　处：《计算机工程》2009年第1期1-3,共3页Computer Engineering

基　　金：国家“863”计划基金资助项目(2002AA104240,2004AA104240,2006AA01A106,2006AA01A120);国家自然科学基金资助项目(90412011);国家科技部基金资助项目(2003DKA5G015)

摘　　要：提出一种基于Skip图P2P覆盖网模型的分布式信任证存储和发现机制。为保证索引和发现效率,采用RT1T语言作为信任证描述语言,其语义属性作为Skip图中的索引关键字,构造了基于关键字前缀相似和支持范围查询的P2P覆盖网。通过试验评测和分析,该机制具有较高的查询效率和负载均衡机制。This paper proposes a peer-to-peer framework, which adopts Skip graph named Credentiallndex as the overlay network for credential storage and credential chain discovery. To guarantee discovery efficiency, Credentiallndex schemes RT1^r 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 Credentiallndex system performs considerable credential chain discovery efficiency and reasonable load balance.

关 键 词：Skip图 信任证 信任证链 点对点 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]