期刊文献+

IS-P2P:一种基于索引的结构化P2P网络模型 被引量:39

IS-P2P:Index-Based Structured P2P Networks
下载PDF
导出
摘要 在分析无结构与有结构P2P网络结构的基础上,提出了一种新的基于索引的有结构P2P网络模型IS-P2P(Index-based Structured P2P Networks).IS-P2P网络采用两层混合结构,上层由比较稳定的索引节点组成有结构索引网络,使用文档路由搜索机制,提供资源的发布和查找功能.下层由普通节点组成分布式网络.IS-P2P模型充分利用P2P网络中节点的性能差异,具有高效的查找性能,且能适应P2P网络高度动态性.进一步计算IS-P2P模型中索引网络路由性能、查询处理速度、索引节点索引数据库大小以及索引节点转发查询消息代价表明,IS-P2P具有良好的性能. P2P (Peer-to-Peer) network is an overlay on the Internet. P2P traffic has become the major traffic over the Internet in recent years. P2P networks can be classified into unstructured and structured. Unstructured P2P networks use flooding mechanism or a central index server to search resources on the network. While structured P2P networks use a Distributed Hash Table (DHT) to locate resources. An unstructured P2P network is simpler but has high searching cost. But structured P2P networks may not be suitable for a highly dynamic environment. This paper presents a new P2P model, an index-based structured P2P network named IS-P2P. IS-P2P networks leverage the heterogeneity of peers and use hybrid two-layer architecture. The upper layer consists of indexing peers that form a structured P2P network, and it provides publishing and searching services for the other peers. The lower layer consists of common peers that can join and leave the P2P network freely. Performance analysis shows that IS-P2P can be applied to a highly dynamic environment with good searching performance. In addition, routing performance, searching speed, size of the indexing database and cost of transmitting query are also improved as well.
出处 《计算机学报》 EI CSCD 北大核心 2006年第4期602-610,共9页 Chinese Journal of Computers
基金 国家自然科学基金(60403031 90604015) 国家"八六三"高技术研究发展计划项目基金(2005AA121560)资助.
关键词 有结构P2P网络 资源索引 IS-P2P 性能分析 structured P2P networks resource indexing IS-P2P performance analysis
  • 相关文献

参考文献13

  • 1Milojicic Dejan S.et al.Peer-to-Peer Computing.Hewlett-Packard Company,2002
  • 2Tsoumakos D.et al.A comparison of Peer-to-Peer search methods.In:Proceedings of the WebDB,San Diego,CA,USA,2002,61~66
  • 3Ratnasamy S,Francis P,Handley M,Karp R..A scalable content-addressable network.In:Proceedings of the SIGCOMM 2001,San Diego,CA,USA,2001,161~172
  • 4Stoica I,Morris R,Karger D,Kaashoek M,Balakrishnan H..Chord:A scalable Peer-to-Peer lookup service for internet applications.In:Proceedings of the SIGCOMM 2001,San Deigo,CA,USA,2001,149~160
  • 5Castro M,Druschel P,Hu Y,Rowstron A..Exploiting network proximity in distributed hash tables.In:Proceedings of the FuDiCo 2002,Bertinoro,Italy,2002,52~55
  • 6Zhao B,Kubiatowicz J,Joseph A..Tapestry:An infrastructure for fault-tolerant wide-area location and routing.UCBerkeley:Technical Report UCB/CSD-0101141,2001
  • 7Schollmeier Rudiger.Why P2P (Peer-to-Peer) does scale:Analysis of P2P traffic patterns.In:Proceeding of the IEEE P2P Computing Conference,Link(o)ping,Sweden,2002,112~ 119
  • 8Saroiu S,Gummadi P.K,Gribble S.D..A measurement study of Peer-to-Peer file sharing systems.In:Proceedings of the Multimedia Computing and Networking Conference,San Jose,California,USA,2002
  • 9Sen Shubho,Wang Jia.Analyzing P2P traffic across large networks.In:Proceedings of the ACM SIGCOMM Internet Measurement Workshop (IMW),Marseilles,France,2002
  • 10Mizrak A.T,Cheng Yu-Chung et al.Structured superpeers:Leveraging heterogeneity to provide constant-time lookups.In:Proceedings of the 3rd IEEE Workshop on Internet Applications,San Jose,California,2003,104~111

同被引文献317

引证文献39

二级引证文献100

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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