期刊文献+

RAP2P:一种基于资源广告的非结构化P2P系统

RAP2P: a resource advertising-based unstructured P2P system
下载PDF
导出
摘要 研究了非结构化P2P系统的数据管理和相应的资源查询算法。提出了基于资源广告的非结构化P2P系统,即RAP2P。设计了一种类似谣言传播机制的资源信息广告算法AdGossip来传播共享资源广告,并且通过共享资源广告缓存限制机制来保证局部区域缓存空间对共享资源节点的最大覆盖率。分析和模拟结果表明,在获得100%查询命中率的条件下,RAP2P的资源定位消息开销约为泛洪查询的25%,查询的时延为泛洪查询的30%~50%,并且远远低于k-random walks。 The data management and resource locating algorithms of unstructured P2P system were studied. The proposed system was called RAP2P. The system simulated the marketing behavior, and shared the resource of advertised information to improve the resource locating performance. A gossiping-based resource advertising algorithm was proposed to propagate the resource information. By constraining the caching of resource information, the 2-hop search space stored the largest percent of all information. To exploit such resource layout, a dynamic shadow flooding search algorithm was presented. The analysis and simulation show that RAP2P requires about 25% message overhead of flooding algorithm and 30% to 50% query delay of flooding algorithm with 100% query hit rate, and its query delay is also far below that of k-random walks.
出处 《计算机应用》 CSCD 北大核心 2006年第11期2578-2582,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(60473090 60573129)
关键词 非结构化P2P 资源定位 资源广告 谣言传播 BLOOM过滤器 unstructured P2P resource locating resource advertising gossip propagation Bloom filter
  • 相关文献

参考文献15

  • 1COHEN E , SHENKER S , Replication strategies in unstructured peer-to-peer networks[A]. ACM SIGCOMM[C]. New York: ACMPress, 2002. 177 - 190
  • 2LV Q, CAO P, COHEN E, et al, Search and replication in unstructured peer-to-peer networks [ A], Proceedings of the 16th international conference on Supercomputing (ICS'02) [ C]. New York:ACM Press, 2002. 84-95.
  • 3GKANTSIDIS C, MIHAIL M, SABERI A. Hybrid search schemes for unstructured peer-to-peer Networks[ A]. Proceedings of the INFOCOM[ C]. New York: IEEE Computer and Communications Societies, 2005. 1526 - 1537.
  • 4LIANG J, KUMAR R, XI Y, et al. Pollution in P2P file sharing systems[A].Proceedings of the INFOCOM[C]. New York, USA: IEEE Computer and Communications Societies, 2005. 1174 - 1185.
  • 5BLOOM BH. Space/time trade-offs in hash coding with allowable errors[J]. Communications of the ACM, 1970, 13(7): 422 -426.
  • 6BYERS JW, CONSIDINE J, MITZENMACHER M, et al.Informed content delivery across adaptive overlay networks[J]. IEEE/ACM Transactions on Network Parallel Distributed Systems, 2004, 12(5): 767 -780.
  • 7BRODER A, MITZENMACHER M. Network applications of bloom filters: A survey[J]. Internet Mathematics, 2005, 1(4): 485-509.
  • 8AGRAWAL D, ABBADI AE, STEINKE RS. Epidemic algorithms in replicated databases (extended abstract) [ A]. Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems[C]. New York, USA: ACM Press, 1997. 161-172.
  • 9MOSK-AOYAMA D, SHAH D. Information dissemination via gossip: applications to averaging and coding[ EB/OL]. http://arxiv.org/abs/cs. NI/0504029, 2005.
  • 10KERMARREC A - M, MASSOULIEL, GANESH AJ. Probabilistic reliable dissemination in large-scale systems[J]. IEEE Transactions on Parallel Distributed Systems, 2003, 14(3) : 248 -258.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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