In this paper we investigate the performance issues of data replication in a loosely coupled distributed database system, where a set of database servers are connected via a network. A database repli-cation scheme, Replication with Divergence, which allows some degree of divergence between the primary and the secondary copies of the same data object, is compared to other two schemes that, respe...

right Replication of data can lead to better performance due to increased availability of data. This paper explores the use of data replication for large, static data sets organized in a tree structure. In static environments, data replication does not have to deal with problems arising from maintaining consistency among copies [1,10,12]. Static data sets arise, for example, when updates on the...

MANET, VANET, CLOUD and IoT are some of the recent computing models or network architecture that has evolved in the recent times. The characteristics of devices and communication links of these types of models vary largely leading to high degree of heterogeneity. The applications designed for such a heterogeneous type of network faces challenges such as frequent network partition, communication...

Most replication methods either monitor the popularity of files or use complicated functions to calculate the overall cost of whether or not a replication decision or a deletion decision should be issued. However, once the replication decision is issued, the popularity of the files is changed and may have already impacted access latency and resource usage. This article proposes a decision-tree-...

The management of replicated data in a distributed system is a diicult task. In order to ease the pain, we developed an architecture for data replication whose key concept is the separation of policy and mechanism. One of the major advantages of such an architecture is the fact, that { once the mechanism is implemented { new data replication strategies can be introduced into the network just by...

Given the lower bound of (n(d 1)=d) for range query time complexity on n d-dimensional point data, we investigate whether little replication can improve the query and update times significantly. We propose linear-space index structures that minimize the query and update times; the query time we achieve is O(n ) for any > 0, and, the update time is O(logn).

Due to the diierent characteristics of replicated data objects and networks, highly adjustable replica-tion schemes are required. Such a replication scheme must be general enough to cover a wide range of scenarios and it has to support an easy tailoring. This paper presents a new proposal for the management of replicated data objects which has these properties. It is based on a hierarchical str...

To provide performant access to data from high energy physics experiments such as the Large Hadron Collider (LHC), controlled replication of files among grid sites is required. Dynamic replication in response to jobs may also be useful, and has been investigated using the grid simulator OptorSim. In this paper, results from simulation of the LHC Computing Grid in 2008, in a physics analysis sce...

Many wide-area distributed applications use replicated data to improve the availability of the data, and to improve access latency by locating copies of the data near to their use. This paper presents a new family of communication protocols, called quorum multicasts, that provide efficient communication services for widely replicated data. Quorum multicasts are similar to ordinary multicasts. w...