期刊文献+

A minimal-distance overlay for efficiently disseminating replicas in DHT-based P2P networks

A minimal-distance overlay for efficiently disseminating replicas in DHT-based P2P networks
在线阅读 下载PDF
导出
摘要 In this paper, the problems of redundant traffic and redundant replicas tor efficient object replication in P2P overlay are studies. Firstly, a hierarchical and topology-aware P2P overlay is developed with κ-Medoids partition algorithm to achieve the minimal physical distance of all super peer pairs. Secondly, a new idea of placing at most one replica in a cluster of physically adjacent nodes is introduced to achieve scattered distribution of replicas. Lastly, an efficient replicas-query algorithm based on multiple hash functions is proposed. Theoretical analysis and simulation experiment on several performance metrics are given, and it is verified that the method in this paper can efficiently disseminate replicas across the network, increase query-hit ratio, and decrease redundant messages and storage spaces required.
出处 《High Technology Letters》 EI CAS 2011年第2期126-133,共8页 高技术通讯(英文版)
基金 Supported by the National Natural Science Foundation of China ( No. 60903195 ) and the Key Technological Problems Tackling Project of Wuhan ( No. 200750499172).
关键词 PEER-TO-PEER REPLICATION OVERLAY redundancy CHORD k-Medoids clustering P2P网络 最小距离 副本 覆盖 传播 DHT 查询算法 冗余信息
作者简介 To whom correspondence should be addressed. E-mail: liwx2001 @ yahoo.com.cn Li Wenxiang, born in 1979. He received the his Ph. D and M.S. degrees of Communication and Information System at Wuhan University in 2010 and 2004 respectively. His research interests include designing next generation network and wireless network.
  • 相关文献

参考文献1

二级参考文献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

共引文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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