检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:方群[1,2,3] 吴国新[1,2] 吴鹏[1,2] 钱宁[1,2] 赵生慧[1,2]
机构地区:[1]东南大学计算机科学与工程学院,南京210096 [2]东南大学计算机网络和信息集成教育部重点实验室,南京210096 [3]安徽师范大学数学计算机科学学院,芜湖241000
出 处:《计算机科学》2008年第11期23-27,共5页Computer Science
基 金:国家863计划(2007AA01Z422);安徽省高校教师青年基金(2007jq1061);安徽省教育厅自然科学研究项目(2005kj088)
摘 要:P2P网络以其在动态、自组织、伸缩性、鲁棒性、资源利用率等方面的优势,已经发展成为当前互联网络的重要分支并获得广泛应用。但由于P2P支持用户匿名访问,其中包含大量恶意节点,因而存在安全隐患,故须依赖信任机制保证对等节点间的协作,其中信任数据存储成为一个关键问题。首先介绍P2P信任模型的基本构成,进而对目前P2P信任模型中常用的信任数据存储技术作了深入研究,同时通过分析对比总结各自的优缺点,最后提出理想的信任数据存储方案应具备的特征。Because of many good features, such as dynamic, auto organized, scalability, robust and resource utility, peer-to-peer (P2P) network becomes to an important branch of Internet and has been widely applied. But because P2P network permits anonymous access including many malicious peers, which bring many security problems to P2P network, cooperation between peer and peer must be supported by trust relation established between peer and peer. This paper focused on the issue of trust data storage. Firstly the components of general trust model were introduced. Next several typical trust data storage models of P2P were discussed. After careful analyzed, these models display their advantages and disadvantages. Finally this paper puts forward the essential features of the ideal trust data storage model.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222