scispace - formally typeset
Journal ArticleDOI

A Lightweight and Cooperative Multifactor Considered File Replication Method in Structured P2P Systems

Haiying Shen, +1 more
- 01 Nov 2013 - 
- Vol. 62, Iss: 11, pp 2115-2130
TLDR
This paper presents a lightweight and Cooperative multifactOr considered file Replication Protocol (CORP), which dramatically reduces the overhead of both file replication and consistency maintenance.
Abstract
File replication is widely used in structured P2P systems to avoid hot spots in servers and enhance file availability. The number of replicas and replication distance affect the file replication cost. These two elements and the replica update frequency determined in the file replication stage also affect the cost of subsequent consistency maintenance. However, most existing file replication protocols focus on improving file lookup efficiency without considering its cost and its subsequent influence on consistency maintenance. This paper studies the problem about how a server chooses files to replicate and where to replicate files to achieve low cost in both file replication and consistency maintenance stages without compromising the effectiveness of file replication. This paper presents a lightweight and Cooperative multifactOr considered file Replication Protocol (CORP) to achieve this goal. CORP simultaneously takes into account multiple factors including file popularity, update rate, node available capacity, file load, and node locality, aiming to minimize the number of replicas, update frequency, and replication distance. CORP also dynamically adjusts the number of replicas based on ever-changing file popularity and visit pattern. Extensive experimental results from simulation and PlanetLab real-world testbed demonstrate the efficiency and effectiveness of CORP in comparison with other file replication protocols. It dramatically reduces the overhead of both file replication and consistency maintenance. In addition, it exhibits high adaptiveness to skewed lookups and yields significant improvement in reducing overloaded nodes. Specifically, compared to the other replication protocols, CORP can reduce more than 71 percent of file replicas, 84 percent of overloaded nodes, 94 percent of consistency maintenance cost, and 72 percent of file replication and consistency maintenance latency.

read more

Citations
More filters
Journal ArticleDOI

CloudFog: Leveraging Fog to Extend Cloud Gaming for Thin-Client MMOG with High Quality of Service

TL;DR: A lightweight system called CloudFog is proposed, which incorporates “fog” consisting of supernodes that are responsible for rendering game videos and streaming them to their nearby players and enables the cloud to be only responsible for the intensive game state computation and sending update information to supern nodes, which significantly reduce the traffic hence the latency and bandwidth consumption.
Journal ArticleDOI

SORD: a new strategy of online replica deduplication in Cloud-P2P

TL;DR: A new strategy of online replica deduplication (SORD), achieving to reduce the impact on other nodes when deleting a redundant replica, which obtains superior performances in access latency around 5–15% on average and better load balance than other similar methods.
Proceedings ArticleDOI

Selective Data replication for Online Social Networks with Distributed Datacenters

TL;DR: This paper aims to reduce inter-datacenter communications while still achieving low service latency, and proposes Selective Data replication mechanism in Distributed Datacenters that incorporates three strategies to further enhance its performance: locality-aware multicast update tree, replica deactivation, and datacenter congestion control.
Journal ArticleDOI

Selective Data Replication for Online Social Networks with Distributed Datacenters

TL;DR: This paper proposes Selective Data replication mechanism in Distributed Datacenters (SD3), where in SD3, a datacenter jointly considers update rate and visit rate to select user data for replication, and further atomizes a user's different types of data for replicate, making sure that a replica always reduces inter-datacenter communication.
Proceedings ArticleDOI

Cloud Fog: Towards High Quality of Experience in Cloud Gaming

TL;DR: A lightweight system called Cloud Fog is proposed, which incorporates "fog" consisting of super nodes that are responsible for rendering game videos and streaming them to their nearby players, which enables the cloud to be only responsible for the intensive game state computation and sending update information to super nodes, which significantly reduce the traffic hence the latency and bandwidth consumption.
References
More filters
Book ChapterDOI

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
Proceedings ArticleDOI

A scalable content-addressable network

TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Journal ArticleDOI

Chord: a scalable peer-to-peer lookup protocol for Internet applications

TL;DR: Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
Journal ArticleDOI

OceanStore: an architecture for global-scale persistent storage

TL;DR: OceanStore monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data.
Book ChapterDOI

Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

TL;DR: In this paper, the authors describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment, which routes queries and locates nodes using a novel XOR-based metric topology.
Related Papers (5)