Recently, (PDDRA) a Pre-fetching based dynamic data replication algorithm has been published. In our previous work, modifications to the algorithm have been suggested to minimize the delay in data replication. In this paper, a simulation framework is presented and results are obtained to estimate the throughput and average delay. The overall network is divided into two parts as local and global...

the motivation of this paper is to propose such equitable method for ranking all decision making units (dmus) in dynamic data envelopment analysis (ddea) framework. as far as we are aware there is not more studies in dynamic dea literature. what's more, in such cases the best operating unit is important to be sampled for the others in under evaluated time periods. however, in this special conce...

The actual gains achieved by replication are a complex function of the number of replicas, the placement of those replicas, the replication protocol, the nature of the transactions performed on the replicas, and the availability and performance characteristics of the machines and networks composing the system. This paper describes the design and implementation of the Replica Management System, ...

Cloud storage systems typically use three-way random replication to guard against data loss within the cluster, and utilize cluster geo-replication to protect against correlated failures. This paper presents a much lower cost alternative to full cluster geo-replication. We demonstrate that in practical settings, using two replicas is sufficient for protecting against independent node failures, ...

Mobile information systems integrating information from different sources and feed mobile clients represent a big challenge for todays DBMS technology. Due to the limited capabilities of the clients (available memory, usable bandwidth, temporary disconnections etc.) traditional replication approaches known from distributed databases fail. In this paper we present an approach for data replicatio...

Mobile ad hoc networks (MANETs) define a challenging computing scenario where access to resources is restrained by connectivity among hosts. Replication offers an opportunity to increase data availability beyond the span of transient connections. Unfortunately, standard replication techniques for wired environments mostly target improvements to fault-tolerance and access time, and in general ar...

In this chapter, we discuss a widely used fault-tolerant data replication model called virtual synchrony. The model responds to two kinds of needs. First, there is the practical question of how best to embed replication into distributed systems. Virtual synchrony defines dynamic process groups that have self-managed membership. Applications can join or leave groups at will: a process group is a...

The availability offered by current data replication and update algorithms varies with dynamically changing conditions which include the network configuration and system load. With dynamic adaptability, systems can switch to an appropriate mechanism to improve perFormance and availability, In this paper, we present an algorithm to estimate the overall availability of transaction processing in a...