Popular files could exhaust the capacity of the file owner node, leading to low efficiency in P2P file sharing systems. File replication is an effective method to deal with this problem by distributing load over replica nodes. Recently, numerous file replication methods have been proposed for P2P content delivery networks on the Internet. However, due to mobility and resource constraints in the...

Data Grids provide geographically distributed resources for large-scale data-intensive applications that generate large data sets. However, ensuring efficient access to such huge and widely distributed data is hindered by the high latencies of the Internet. We address these challenges by employing intelligent replication and caching of objects at strategic locations. In our approach, replicatio...

An Efficient and Adaptive Decentralized (EAD) file replication algorithm achieves high query efficiency and high replica utilization. EAD enhances the utilization of file replicas by selecting query traffic hubs and frequent requesters as replica nodes, and dynamically adapting to non uniform and time-varying file popularity and node interest. EAD creates and deletes replicas in a decentralized...

One of the stylistic features of Hafez’s sonnets is the repetition of a part of the meaning of the first line in the second line. His knowledge of the rhetorical and semantic relations of vocabularies enabled him to repeat the meaning with the least verbal repetition. One of the ways that has helped him to achieve this goal is replicating the concepts in two parts of the couplet based on rhetor...

The data grid technology, which uses the scale of the Internet to solve storage limitation for the huge amount of data, has become one of the hot research topics. Recently, data replication strategies have been widely employed in distributed environment to copy frequently accessed data in suitable sites. The primary purposes are shortening distance of file transmission and achieving files from ...

Pure peer-to-peer (P2P) networks is widely used, however they broadcast query packets, and cause excessive network traffic in particular. Addressing this issue, we propose a new strategy for content replication which prioritizes popular and attracting contents. Our strategy is based on replication adjustment, being cooperated with index caching, as well as LRU-based content replacement, and a m...

Data replication is used extensively in wide-area distributed systems to achieve low dataaccess latency. Minimizing the cost of the resources used for replication is a key problem in these systems. The paper proposes a method to calculate lower bounds for the replication cost required to achieve certain QoS goals. We obtain bounds for the general case as well as for certain classes of replica p...

Loosely-coupled distributed systems have significant scale and cost advantages over more traditional architectures, but the availability of the nodes in these systems varies widely. Availability modeling is crucial for predicting per-machine resource burdens and understanding emergent, system-wide phenomena. We present new techniques for predicting availability and test them using traces taken ...

Ad hoc networks are characterized by high dynamics in particular with respect to the formation of network partitions. This behavior makes it difficult to (s)elect a suitable leader for a given network partition at any given time. However, such leaders or representatives are needed by many protocols for ad hoc networks. In this paper, we will illustrate the leader election process and its influe...

We describe Tempest, a platform for assisting web services developers. Tempest allows Java programmers to create services that scale across clusters of computing nodes, adapting automatically as load surges or drops, components fail or recover, and client-generated loads vary. The system automates tasks such as replica placement, update dissemination, consistency checking, and repair when incon...