mirage

Replica placement in P2P storage : complexity and game theoretic analyses

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Replica placement in P2P storage : complexity and game theoretic analyses

Show full item record

Title: Replica placement in P2P storage : complexity and game theoretic analyses
Author: Rzadca, Krzysztof; Datta, Anwitaman; Buchegger, Sonja
Copyright year: 2010
Abstract: In peer-to-peer storage systems, peers replicate each others’ data in order to increase availability. If the matching is done centrally, the algorithm can optimize data availability in an equitable manner for all participants. However, if matching is decentralized, the peers’ selfishness can greatly alter the results, leading to performance inequities that can render the system unreliable and thus ultimately unusable. We analyze the problem using both theoretical approaches (complexity analysis for the centralized system, game theory for the decentralized one) and simulation. We prove that the problem of optimizing availability in a centralized system is NP-hard. In decentralized settings, we show that the rational behavior of selfish peers will be to replicate only with similarly-available peers. Compared to the socially-optimal solution, highly available peers have their data availability increased at the expense of decreased data availability for less available peers. The price of anarchy is high: unbounded in one model, and linear with the number of time slots in the second model.
Subject: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexityDRNTU::Engineering::Computer science and engineering::Computing methodologies::Simulation and modeling
Type: Conference Paper
Conference name: IEEE International Conference on Distributed Computing Systems (30th : 2010 : Genoa, Italy)
School: School of Computer Engineering
Rights: © 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Version: Published version

Files in this item

Files Size Format View Description
serenity.pdf 418.5Kb PDF View/Open Main article
   

DOI Query

- Get published version (via Digital Object Identifier)
   

This item appears in the following Collection(s)

Show full item record

Statistics

Total views

All Items Views
Replica placement in P2P storage : complexity and game theoretic analyses 357

Total downloads

All Bitstreams Views
serenity.pdf 287

Top country downloads

Country Code Views
United States of America 79
China 48
Singapore 33
Germany 27
Spain 11

Top city downloads

city Views
Mountain View 51
Singapore 32
Beijing 12
Netze 8
Tarragona 8