Spiral Walk on Triangular Meshes : Adaptive Replication in Data P2P Networks

Details Spiral Walk on Triangular Meshes : Adaptive Replication in Data P2P Networks Spiral Walk on Triangular Meshes : Adaptive Replication in Data P2P Networks

2008-05-27

arxiv.org/abs/0805.4107v1

Computer Science

Networking and Internet Architecture

Scientific paper

We introduce a decentralized replication strategy for peer-to-peer file exchange based on exhaustive exploration of the neighborhood of any node in the network. The replication scheme lets the replicas evenly populate the network mesh, while regulating the total number of replicas at the same time. This is achieved by self adaptation to entering or leaving of nodes. Exhaustive exploration is achieved by a spiral walk algorithm that generates a number of messages linearly proportional to the number of visited nodes. It requires a dedicated topology (a triangular mesh on a closed surface). We introduce protocols for node connection and departure that maintain the triangular mesh at low computational and bandwidth cost. Search efficiency is increased using a mechanism based on dynamically allocated super peers. We conclude with a discussion on experimental validation results.

Affiliated with

Also associated with

No associations

Rating

Spiral Walk on Triangular Meshes : Adaptive Replication in Data P2P Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spiral Walk on Triangular Meshes : Adaptive Replication in Data P2P Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spiral Walk on Triangular Meshes : Adaptive Replication in Data P2P Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273536