Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high latencies (O(logN )) in the average case. Such high latencies prohibit them from being used in many relevant, demanding applications such as DNS. In this paper, we present a proactive replication framework that can pro...

Quality-of-service (QoS) techniques and server replication are two complementary approaches that can improve the performance observed by users. QoS techniques provide differentiated service to meet the diverse needs of applications; server replication enables load balancing across a set of servers. To combine the two approaches, we need to address one important question: how to select a server ...

Coda is a file system for a large-scale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication, involves storing copies of a file at multiple servers. The other mechanism, disconnected operation, is a mode of execution in which a caching...

Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high latencies (O( )) in the average case. Such high latencies prohibit them from being used in many relevant, demanding applications such as DNS. In this paper, we present a proactive replication framework that can achieve...

This paper comtemplates two important information-provisioning pradigms-caching and replication, and proposes a new approach on network storage system in order to meet the increasing demands for large les. The key idea of our system is to have two tailor-made servers for large and small object, respectively. Modiied proxy cache is responsible for store and deliver small objects. For large objec...

A distributed virtual walkthrough environment allows users connected to the geometry server to walk through a specific place of interest, without having to travel physically. This place of interest may be a virtual museum, virtual library or virtual university. There are two basic approaches to distribute the virtual environment from the geometry server to the clients, complete replication and ...

The amount of traffic in wireless networks is increasing exponentially, and this problem can be mitigated using device-to-device (D2D) caching technology, which installs a cache on mobile end device. Devices reduce the cell load through self-offloading via content their own D2D offloading others' caches. However, especially early stage systems, limited number devices with small storage might us...

Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as to improve object proximity for the end-users and/ or load-balance the servers. Most of the existing algorithms try to disseminate the objects of an entire Internet Service Provider (ISP), without taking into account t...

In this paper we propose scalable proxy servers cluster architecture of interconnected proxy servers for high quality and high availability services. We also propose an optimal regional popularity based video prefix replication strategy and a scene change based replica caching algorithm that utilizes the zipf-like video popularity distribution to maximize the availability of videos closer to th...

A corporate website is the virtual representation of a corporation or organization on the Internet. Corporate websites face numerous problems due to their large size and complexity, and the nonscalability of the underlying Web infrastructure. Current solutions to these problems generally rely on traditional scaling techniques such as caching and replication. These are usually too restrictive, h...