期刊文献+

兴趣域信任相似度敏感的P2P拓扑构建模型 被引量:1

A P2P Topology Construction Model Sensitive to Interest Domain Trust Similarity
原文传递
导出
摘要 为了提高对等(P2P)网络系统中资源定位效率,保证资源下载质量,基于P2P网络中节点偏好的兴趣域划分机制,给出了兴趣域信任相似度的概念和计算方法,并在此基础上设计实现了一种基于兴趣域信任相似度的对等网络拓扑(ITAPT)模型.ITAPT模型通过引入节点间的兴趣域信任相似度,使具有相近兴趣偏好且兴趣域可信度向量相似的节点互为邻居,提高了节点资源查询效率,同时又能激励节点提供更多贡献.仿真结果表明,该模型在拓扑有效性和安全性等方面比现有典型机制均有较大提高. To improve the resource location efficiency and guarantee resource download quality of peer to peer (P2P) system, a new concept of interest domain trust similarity as well as its computation method is given based on Interest domain partition mechanism using node Interest bias in P2P Networks. Thereupon, a P2P network topology construction model named interest domain trust similarity sensitive P2P topology (ITAPT) is implemented. In ITAPT, by computing interest domain trust similarity of each other, the nodes with similar interest and trust value are connected as neighbors. Thus the ITAPT will improve node resource query efficiency, and provide an incentive mechanism to encourage node to offer more contribution so as to get better service. Simulations show that the ITAPT improves the efficiency and security of P2P topology effectively.
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2011年第2期94-98,共5页 Journal of Beijing University of Posts and Telecommunications
基金 国家高技术研究发展计划项目(2007AA01Z418) 江苏省自然科学基金项目(BK2010133)
关键词 对等网络 拓扑模型 兴趣域 信任度 兴趣域信任相似度 peer to peer network topology model interest domain trust interest domain trust similarity
  • 相关文献

参考文献9

  • 1Srip K, Maggs B, Zhang Hui. Efficient content location using interest based locality in peer-to-peer systems [ C ] //IEEE INFOCOM 2003. San Francisco: IEEE Press, 2003 : 2166-2176.
  • 2Cohen E, Fiat A, Kaplan H. Associative search in peer- to-peer networks : harnessing latent semantics [ J ]. Computer Networks, 2007, 51 (8) : 1861-1881.
  • 3Giancarlo R, Rossano S. A peer-to-peer recommender system based on spontaneous affinities [ J]. ACM Transactions on Internet Technology, 2009, 9 ( 1 ) : 1-34.
  • 4Sardar K, Ashraf K, Laurissa N T. Interest-based self organization in group-structured P2P networks [ C ] //IEEE CCNC 2009. Las Vegas: IEEE Press, 2009: 1237-1241.
  • 5周晓波,周健,卢汉成,洪佩琳.一种基于层次化兴趣的非结构化P2P拓扑形成模型[J].软件学报,2007,18(12):3131-3138. 被引量:18
  • 6Condie T, Kamvar S, Garcia-Molina H. Adaptive peer- to-peer topologies [ C ] //IEEE P2P 2004. New York : IEEE Press, 2004: 53-62.
  • 7张骞,张霞,刘积仁.一种有效的Peer-to-Peer自适应拓扑进化协议[J].软件学报,2007,18(2):400-411. 被引量:2
  • 8代战锋,温巧燕,李小标.P2P网络环境下的推荐信任模型方案[J].北京邮电大学学报,2009,32(3):69-72. 被引量:14
  • 9Condie T. Query cycle simulator [ EB/OL ]. (2004-09- 16) [2010-06-01]. http://p2p, stanford, edu/www/ download, htm.

二级参考文献14

共引文献31

同被引文献13

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部