Replica placement in P2P storage : complexity and game theoretic analyses
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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/91297 http://hdl.handle.net/10220/6493 |
| _version_ | 1811679128986845184 |
|---|---|
| author | Rzadca, Krzysztof Datta, Anwitaman Buchegger, Sonja |
| author2 | School of Computer Engineering |
| author_facet | School of Computer Engineering Rzadca, Krzysztof Datta, Anwitaman Buchegger, Sonja |
| author_sort | Rzadca, Krzysztof |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T03:04:14Z |
| format | Conference Paper |
| id | ntu-10356/91297 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T03:04:14Z |
| publishDate | 2010 |
| record_format | dspace |
| spelling | ntu-10356/912972020-05-28T07:18:48Z Replica placement in P2P storage : complexity and game theoretic analyses Rzadca, Krzysztof Datta, Anwitaman Buchegger, Sonja School of Computer Engineering IEEE International Conference on Distributed Computing Systems (30th : 2010 : Genoa, Italy) DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity DRNTU::Engineering::Computer science and engineering::Computing methodologies::Simulation and modeling 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. Published version 2010-12-21T01:32:05Z 2019-12-06T18:03:09Z 2010-12-21T01:32:05Z 2019-12-06T18:03:09Z 2010 2010 Conference Paper https://hdl.handle.net/10356/91297 http://hdl.handle.net/10220/6493 10.1109/ICDCS.2010.67 en © 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. 12 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity DRNTU::Engineering::Computer science and engineering::Computing methodologies::Simulation and modeling Rzadca, Krzysztof Datta, Anwitaman Buchegger, Sonja Replica placement in P2P storage : complexity and game theoretic analyses |
| title | Replica placement in P2P storage : complexity and game theoretic analyses |
| title_full | Replica placement in P2P storage : complexity and game theoretic analyses |
| title_fullStr | Replica placement in P2P storage : complexity and game theoretic analyses |
| title_full_unstemmed | Replica placement in P2P storage : complexity and game theoretic analyses |
| title_short | Replica placement in P2P storage : complexity and game theoretic analyses |
| title_sort | replica placement in p2p storage complexity and game theoretic analyses |
| topic | DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity DRNTU::Engineering::Computer science and engineering::Computing methodologies::Simulation and modeling |
| url | https://hdl.handle.net/10356/91297 http://hdl.handle.net/10220/6493 |
| work_keys_str_mv | AT rzadcakrzysztof replicaplacementinp2pstoragecomplexityandgametheoreticanalyses AT dattaanwitaman replicaplacementinp2pstoragecomplexityandgametheoreticanalyses AT bucheggersonja replicaplacementinp2pstoragecomplexityandgametheoreticanalyses |