期刊文献+

实现一个基于元数据的P2P系统

BUILDING A METADATA-BASED P2P SYSTEM
下载PDF
导出
摘要 分布式散列表(DHT)是现有结构化P2P系统普遍采用的一种方法,它能将资源的唯一标识映射到资源位置,Tapestry就是一个基于DHT的基础平台。资源共享是P2P技术应用较广的一个领域。本文以一类典型的带有元数据的资源MP3音乐文件为例,介绍了在Tapestry基础上实现一个基于元数据的P2P资源共享系统MPIS的详细过程,它能够根据资源的多个属性来定位所需资源。 The method of DHT is widely adopted in existing structured P2P system,in which any resource can be located by its unique identification, and Tapestry is an overlay based DHT. P2P technology is widely used in the resources-sharing field. Using a kind of file containing metadata in the file format, MP3, as an example, the implementation of a metadata-based P2P resources-sharing system on the basis of Tapestry is introduced in detail in this article, the required resources can be located using several properties of the resource in MPIS.
出处 《计算机应用与软件》 CSCD 北大核心 2007年第4期189-191,共3页 Computer Applications and Software
关键词 对等 元数据 资源共享 P2P系统 Peer-to-Peer(P2P) Metadata Resources sharing
  • 相关文献

参考文献6

  • 1B.Zhao,J.D.Kubiatowicz,A.D.Joseph.Tapestry:An infrastructure for fault-tolerant wid-area location and routing[R].Technical report,UCB/CSD-01-1141.UC Berkeley,April 2001.
  • 2I.Stoica,R.Morris,D.Karger,M.Kaashoek,and H.Balakr-ishnan.Chord:A scalable peer-to-peer lookup service for Internet applications[A].Proceedings of the ACM SIGCOMM'01[C],2001,pp.149~160.
  • 3Tylvia Ratnasamy,Paul Francis,Mark Handley,Richard Karp,and Scott Shenker.A scalable content-addressable network[A].Proceedings of ACM SIGCOMM'01[C],2001,pp.161~172.
  • 4A.Rowstron,P.Druschel.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer systems[A].Proceedings of IFIP/ACM International Conference on Distributed sSystems Platforms(Middleware)2001[C],2001,pp.329~350.
  • 5B.Zhao.Programmer's Guide[OL].http://www.cs.berkeley.edu/~ravenben/tapestry/html/guide.html.
  • 6O.D.Gnawali.A Keyword Set Search System for Peer-to-Peer Nerworks[D].Master's Thesis,Massachusetts Institute of Technology,June 2002.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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