A Novel Content Distribution Mechanism in DHT Networks

  • Authors:

  • Quanqing Xu;Heng Tao Shen;Bin Cui;Xiaoxiao Hou;Yafei Dai

  • Affiliations:

  • State Key Lab. for Adv. Opt. Commun. Syst. & Networks, Peking University, Beijing, China 100871;School of ITEE, The University of Queensland, Brisbane, Australia QLD 4072;State Key Lab. for Adv. Opt. Commun. Syst. & Networks, Peking University, Beijing, China 100871;Department of Computer Science and Technology, Stony Brook University, U.S.A.;State Key Lab. for Adv. Opt. Commun. Syst. & Networks, Peking University, Beijing, China 100871

  • Venue:
  • NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

DHT (Distributed Hash Table) is a structured overlay network that is widely utilized in P2P systems. Existing content distribution approaches do not completely exploit features of DHT and incur heavy network bandwidth consumption. This paper analyzes existing content distribution approaches including synchronous content distribution method in eMule based on DHT overlay networks and points out that their network loads are too heavy. We propose a novel content distribution algorithm: asynchronous distribution, in DHT networks. Compared with traditional distribution approaches, it is more effective and scalable with lower network load. We apply the techniques of vector space model and search frequency to the asynchronous distribution algorithm, which effectively improves search hit ratio and reduces network load. Simulation results based on real data from Maze system show that this approach has low network overhead and publishing cost, high search and download hit ratio.