The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems

Authors:
Giwon On;Jens Schmitt;Ralf Steinmetz
Affiliations:
-;-;-
Venue:
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Year:
2003

Citing 0
Cited 7

Dependability in Peer-to-Peer Systems

IEEE Internet Computing
Survey of research towards robust peer-to-peer networks: search methods

Computer Networks: The International Journal of Computer and Telecommunications Networking
Allocation of partitioned data by using a neural network based approach

Neurocomputing
Robust clustering analysis for the management of self-monitoring distributed systems

Cluster Computing
Research of replication mechanism in P2P network

WSEAS Transactions on Computers
Differentiated replication strategy in data centers

NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Probabilistic replication based on access frequencies in unstructured peer-to-peer networks

DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we take an availability-centric view on quality of service (QoS) and propose a model and mechanisms for studying the effectiveness of realistic replication schemes on availability QoS for peer-to-peer (P2P) systems. We especially tackle the dynamic replica placement (RP) problem where our focus is on choosing dynamically the number and location of replicas while (1) meeting different availability QoS requirements for all individual peers and (2) taking the intermittent connectivity of peers explicitly into account. We model P2P systems as a dynamic stochastic graph in which the nodes go up and down depending on their assigned up probability. We develop some simple heuristic algorithms for solving the RP problem, which are fully distributed and adaptive. Through an event-driven simulation study we compare and evaluate the achieved availability QoS of the proposed RP algorithms. Simulation results show that (1) even simple heuristics can achieve reasonably high availability QoS, and (2) satisfying availability QoS requires more replicas than for only increasing the hit rate.