TreeP: A tree based P2P network architecture
Benoit Hudzia, M-Tahar Kechadi, Adrian Ottewill
IEEE International Conference on Cluster
Computing (Cluster 2005) Boston, Massachusetts, USA, September 27 -
30, 2005
Abstract
This paper proposes a hierarchical p2p network based on a dynamic partitioning of the ID space. This hierarchy is created and maintained dynamically and provides the DGET grid middleware a p2p basic functionality for discovery and load-balancing. In this architecture each peer is associated with a layer determining its rank and place in the system.
The hierarchy system is based on a tessellation of 1-D space at each level and it exhibits a large similarity with B+tree. We show that the topology use efficiently the heterogeneous aspect of the network while limiting the overhead introduced by the overlay maintenance. Experimental results show that the topology is highly resilient in case of large failure of the network.