The paper explores schemes for dynamic replication and migration of web objects in the context of an Internet hosting service. It describes a replica placement algorithm for deciding the location and number of replicas of an object as well as request distribution schemes for choosing among currently available replicas. We compare two classes of request distribution algorithms – namely feedback ...

Peer-to-peer based (P2P) VoD systems have proven to be an effective solution for scalable video distribution. In P2P VoD, each peer contributes storage to replicate videos and assist video delivery. A fundamental question is how to optimally replicate video content across the peers so as to maximize their upload capacity. We study this question within the context of a large-scale P2P network wh...

The paper explores schemes for dynamic replication and migration of web objects in the context of an Internet hosting service. It describes a replica placement algorithm for deciding the location and number of replicas of an object as well as request distribution schemes for choosing among currently available replicas. We compare two classes of request distribution algorithms – namely feedback ...

UNLABELLED Temporal bone dissection plays an important role in the training of surgeons; however, they are difficult to obtain. AIM To develop a synthetic replica of the temporal bone for dissection training. STUDY DESIGN Experimental. MATERIALS AND METHODS An acrylic synthetic resin replica was obtained from a human temporal bone. For the evaluation of the method, we selected five ear su...

c ©2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. This is the ...

The class of NUMA (nonuniform memory access time) shared memory architectures is becoming increasingly important with the desire for larger scale multiprocessors. In such machines, the placement and movement of code and data are crucial to performance. The operating system can play a role in managing placement through the policies and mechanisms of the virtual memory subsystem. In this paper, w...

Increasing need for large-scale data analytics in a number of application domains has led to a dramatic rise in the number of distributed data management systems, both parallel relational databases, and systems that support alternative frameworks like MapReduce. There is thus an increasing contention on scarce data center resources like network bandwidth (especially cross-rack bandwidth); furth...

In this paper, we revisit the well-studied problem of replica placement in tree networks. Rather than minimizing the number of servers needed to serve all client requests, we aim at minimizing the total power consumed by these servers. In addition, we use the most general (and powerful) server assignment policy, where the requests of a client can be served by multiple servers located in the (un...

In a push-based system, updates that are made to objects are sent to clients, without them explicitly requesting these updates. The focus of this research is to develop a server replication protocol for such interactive, push-based networks. When a server gets overwhelmed and is serving more clients than it can handle, a replica is created. After the replication, a portion of the clients connec...