ACB-R: an adaptive clustering-based data replication algorithm on a p2p data-store

Authors:
Junhu Zhang;Dongqing Yang;Shiwei Tang
Affiliations:
Department of Computer Science, Peking University, Beijing, China;Department of Computer Science, Peking University, Beijing, China;Department of Computer Science, Peking University, Beijing, China
Venue:
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Year:
2005

Citing 15
Cited 0

Shoring up persistent applications

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The dangers of replication and a solution

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An adaptive data replication algorithm

ACM Transactions on Database Systems (TODS)
Freenet: a distributed anonymous information storage and retrieval system

International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Concurrency Control in Database Systems

IEEE Transactions on Knowledge and Data Engineering
Replication strategies in unstructured peer-to-peer networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Demand-based document dissemination to reduce traffic and balance load in distributed information systems

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
BRITE: Universal Topology Generation from a User''s Perspective

BRITE: Universal Topology Generation from a User''s Perspective
An Efficient Scheme for Dynamic Data Replication

An Efficient Scheme for Dynamic Data Replication
Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
[15] Peer-to-Peer Architecture Case Study: Gnutella Network

P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Replication on geographically distributed, unreliable, P2P interconnecting nodes can offer high data availability and low network latency for replica access. The challenge is how to take good control of the number of replicas and their distribution over well-chosen nodes to get a good replica access performance. We observe that, there exists such a logical node cluster overlay over any P2P data-store's underlying network topology that the replica transmission delay of inter-cluster is much greater than that of intra-cluster because of geographical distance or bandwidth sharing between nodes in different clusters. Based on nodes-clustering, we propose a decentralized algorithm ACB-R to direct the data replication, which can adapt dynamically to the changing replica access patterns or network topologies. The experiment shows that ACB-R can benefit much of the access requests at the price of negligible intra-cluster replica transmission and consequently achieves a good average replica access performance.