2003 · 205 citations · 10 references
Cluster ComputingAvailabilityEngineeringDistributed AlgorithmsNetwork AnalysisData ScienceDistributed DatabaseManagementDynamic Model-driven ReplicationData IntegrationEfficient DataData ManagementAvailability IssueInformation ManagementData ReplicationLarge Peer-to-peer CommunitiesNetwork ScienceThreshold LevelEdge ComputingCloud ComputingPeer-to-peer DatabaseErratic Node FailureTrusted P2pDistributed Data StoreData Availability
Efficient data sharing in global peer‑to‑peer systems is challenged by node failures, unreliable connectivity, and limited bandwidth, making it hard to decide when and where to replicate data to meet performance goals in large‑scale, dynamic environments. The framework aims to maintain a constant availability threshold by automatically creating replicas in a decentralized manner. The authors develop a model that identifies factors limiting availability and determines when additional replicas are needed, and evaluate its accuracy and performance via simulations. Preliminary results demonstrate that the model accurately predicts the number of replicas needed to meet availability targets.
Efficient data sharing in global peer-to-peer systems is complicated by erratic node failure, unreliable network connectivity and limited bandwidth. Replicating data on multiple nodes can improve availability and response time. Yet determining when and where to replicate data in order to meet performance goals in large-scale systems with many users and files, dynamic network characteristics, and changing user behavior is difficult. We propose an approach in which peers create replicas automatically in a decentralized fashion, as required to meet availability goals. The aim of our framework is to maintain a threshold level of availability at all times. We identify a set of factors that hinder data availability and propose a model that decides when more replication is necessary. We evaluate the accuracy and performance of the proposed model using simulations. Our preliminary results show that the model is effective in predicting the required number of replicas in the system.
10
Ion Stoica, Robert Morris, David R. Karger et al. · 2001 · 9.6K citations
A scalable content-addressable network
Sylvia Ratnasamy, Paul Francis, Mark Handley et al. · 2001 · 6.4K citations · Full text
John Kubiatowicz, David Bindel, Yan Chen et al. · ACM SIGPLAN Notices · 2000 · 2K citations · Full text
John Kubiatowicz, David Bindel, Yan Chen et al. · 2000 · 866 citations