This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints. We propose an optimal algorithm in two ...

With the rapid development of the cloud computing and big data, many data center network are growing more large scale, and the number of servers is increasing at an exponential rate. In this paper, VCG (Vickrey-Clarke-Groves) mechanism was introduced into replica placement. Mapping from replica placement model to VCG mechanism was established and suitable payment function was designed. Data sto...

Recently, several studies have looked into the problem of replicated server placement on the Internet. Some of those studies have demonstrated that there exists a replica placement algorithm that can perform within a factor of 1.1{1.5 of the optimal solution. However, this particular greedy algorithm requires detailed knowledge about network topology, and knowledge about expected client locatio...

Replication of the most popular objects is often used in distributed data provision systems to reduce access time and improve availability. In fact, a given replica placement scheme may have to be redefined as object popularity changes. Given two replica placement schemes X and X, the Replica Migration Problem (RMP) is to compute a schedule of replica transfers and deletions that lead from X to...

Data replication is a technique used in mobile grid environments to enhance system reliability by increasing data availability and reducing access latency and network utilization. Due to the dynamic nature of mobile grids, replica placement becomes one of the most important challenges. It has a great impact on the performance of the whole system. Efficient placement strategies should consider b...

Content Delivery Networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica ser...

This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints. We propose an optimal algorithm in two ...

In data grids, data replication on variant nodes can change some problems such as response time and availability. Also, in data replication, there are some challenges to finding the best replica efficiently in relation to performance and location of physical storage systems. In this paper, various replica placement strategies are discussed. These replica placement strategies are available in th...

An effective replica management method can save bandwidth, reduce latency, balance load, and improve system reliability. A comprehensive scheme is introduced to manage replica for the grid environment. The schemes of replica creation and placement based on the frequency of visits and storage space, replica replacement based on the replica value, and replica selection based on comprehensive perf...

data grids support access to widely distributed storage for large numbers of users accessing potentially many files. to enhance access time, replication at nearby sites may be used. data replication, a technique much investigated bydata grid researchers in past years creates multiple replicas offile and places them in conventional locations to shorten fileaccess times. one of the problems in da...