Proactive Uniform Data Replication by Density Estimation in Apollonian P2P Networks

Authors:
Nicolas Bonnel;Gildas Ménier;Pierre-François Marteau
Affiliations:
Valoria, European University of Brittany, Vannes, France 56000;Valoria, European University of Brittany, Vannes, France 56000;Valoria, European University of Brittany, Vannes, France 56000
Venue:
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
Year:
2009

Citing 5
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
XQuery: An XML query language

IBM Systems Journal
BATON: a balanced tree structure for peer-to-peer networks

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a data replication scheme on a random apollonian P2P overlay that benefits from the small world and scale free properties. The proposed algorithm features a replica density estimation and a space filling mechanism designed to avoid redundant messages. Not only it provides uniform replication of the data stored into the network but it also improves on classical flooding approaches by removing any redundancy. This last property is obtained at the cost of maintaining a random apollonian overlay. Thanks to the small world and scale free properties of the random apollonian P2P overlay, the search efficiency of the space filling tree algorithm we propose has comparable performances with the classical flooding algorithm on a random network.