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: | Rzadca, Krzysztof, Datta, Anwitaman, Buchegger, Sonja |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference Paper |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/91297 http://hdl.handle.net/10220/6493 |
Similar Items
-
Trust beyond reputation : a computational trust model based on stereotypes
by: Liu, Xin, et al.
Published: (2013) -
P2P overlay support for ubiquitous Web 2.0
by: Anwitaman Datta
Published: (2010) -
Contextual trust aided enhancement of data availability in peer-to-peer backup storage systems
by: Liu, Xin, et al.
Published: (2013) -
Merging ring-structured overlay indices : toward network-data transparency
by: Datta, Anwitaman
Published: (2013) -
Self-repairing homomorphic codes for distributed storage systems
by: Oggier, Frederique, et al.
Published: (2011)