An efficient cluster-hierarchy architecture model ECHP2P for p2p networks

  • Authors:
  • Guangxue Yue;Renfa Li;Zude Zhou;Ronghui Wu

  • Affiliations:
  • College of computer and communication, Hunan University, Changsha, Hunan, P.R. China;College of computer and communication, Hunan University, Changsha, Hunan, P.R. China;Wuhan University of Technology, Wuhan, Hubei, P.R. China;College of computer and communication, Hunan University, Changsha, Hunan, P.R. China

  • Venue:
  • GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

P2P systems have emerged as a popular way to share huge volumes of data. It offers many attractive features, such as autonomy, load balancing, availability and anonymity. However, it also faces some serious challenges, such as poor scalability and low efficiency. This paper propose a new distributed P2P network model of ECHP2P withhierarchical structure based on cluster, with ECHP2P, peers are grouped into clusters according to proximity, and super peers are selected from regular peers to act as cluster leaders. These leaders are connected to each other, forming a backbone overlay network. To manage the routing and to limit duplicate messages on it, we propose an application level route strategy: Optimized-Flooding. Simulation results about ECHP2P system show that it could effectively solve the above problems, and larger the network size is, more efficient its comprehensive performance is, so the model is reasonable and effective.