in this paper by combining caching and replication techniques proposed a hybrid heuristic method based on the greedy algorithm to use the benefit of each other techniques. the algorithm in each interaction compares all the contents and one that made the best benefit value is selected for replication. the hybrid approach tested in a simulation environment and the results show that hybrid algorit...

In a structured peer-to-peer (p2p) network, Distributed Hash Tables (DHT) are maintained by nodes to store information and to route the packets. But sometimes a node can be attacked and so it may deny the DHT key access or misroute the packets. Replica Placement is a key mechanism to overcome these problems by placing replica for nodes in p2p network. MAXDISJOINT replica placement strategy crea...

Numerous replica placement algorithms have been proposed in the literature for use in content delivery networks. However, little has been done to compare the various placement algorithms against each other and against caching. This paper debates whether we need replica placement algorithms in content delivery networks or not. The paper uses extensive evaluation of algorithms, systems and web wo...

Data replica placement is an important issue in the cloud storage system, which includes two key points: how to determine the replica factor and how to select optimal Datanode to store replica. With the provision of file store service and file access service for large scale users, the Datanode in cloud storage system is regarded as services site. According to the basic principle of queuing theo...

Cloud data storage platforms have attracted increasing attention in data management. Data replication is a well-known technique that reduces access latency, thus improving cloud data storage availability and performance. Nonetheless, replica placement algorithms are among the significant issues in data replication, which affect data availability and access performance considerably. Replica plac...

Content distribution networks (CDNs) are a recent development to improve the performance of networked applications. The design of replica placement algorithms is one of the foremost problems in CDNs. Current replica placement methods do not guarantee a bound on the maximum latency to any client. In this paper, we propose several algorithms for replica placement with latency constraints. The alg...

--------------------------------------------------------------Abstract-----------------------------------------------------------The replica algorithms are built based on the topology of the data grid. The real representation of grid is general graph. So we propose an algorithm called Replica Placement in Graph Topology Grid (RPGTG) to place replicas on graph based data grids. In this paper, we...