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...
Saved in:
Main Authors: | Rzadca, Krzysztof, Datta, Anwitaman, Buchegger, Sonja |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/91297 http://hdl.handle.net/10220/6493 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Trust beyond reputation : a computational trust model based on stereotypes
by: Liu, Xin, et al.
Published: (2013) -
AED placement optimisation
by: Lee, Qian Yu
Published: (2021) -
P2P overlay support for ubiquitous Web 2.0
by: Anwitaman Datta
Published: (2010) -
Self-repairing homomorphic codes for distributed storage systems
by: Oggier, Frederique, et al.
Published: (2011) -
Self-repairing codes for distributed storage : a projective geometric construction
by: Oggier, Frederique, et al.
Published: (2011)