By Topic

TreeP: A Tree Based P2P Network Architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Benoit Hudzia ; Department of computer science, University College Dublin, Belfield, Dublin 4, Ireland. benoit.hudzia@ucd.ie ; M-Tahar Kechadi ; Adrian Ottewill

In this paper we proposed a hierarchical P2P network based on a dynamic partitioning on a 1-D space. This hierarchy is created and maintained dynamically and provides a grid middleware (like DGET) a P2P basic functionality for resource discovery and load-balancing. This network architecture is called TreeP (Tree based P2P network architecture) and is based on a tessellation of a 1-D space. We show that this topology exploits in an efficient way the heterogeneity feature of the network while limiting the overhead introduced by the overlay maintenance. Experimental results show that this topology is highly resilient to a large number of network failures

Published in:

2005 IEEE International Conference on Cluster Computing

Date of Conference:

Sept. 2005