Game-theoretic mechanisms to increase data availability in decentralized storage systems
2015 (English)In: ACM Transactions on Autonomous and Adaptive Systems, ISSN 1556-4665, E-ISSN 1556-4703, Vol. 10, no 3Article in journal (Refereed) Published
In a decentralized storage system, agents replicate each other’s data to increase availability. Compared to organizationally centralized solutions, such as cloud storage, a decentralized storage system requires less trust in the provider and may result in smaller monetary costs. Our system is based on reciprocal storage contracts that allow the agents to adopt to changes in their replication partners’ availability (by dropping inefficient contracts and forming new contracts with other partners). The data availability provided by the system is a function of the participating agents’ availability. However, a straightforward system in which agents’ matching is decentralized uses the given agent availability inefficiently. As agents are autonomous, the highly available agents form cliques replicating data between each other, which makes the system too hostile for the weakly available newcomers. In contrast, a centralized, equitable matching is not incentive compatible: it does not reward users for keeping their software running. We solve this dilemma by a mixed solution: an "adoption" mechanism in which highly available agents donate some replication space, which in turn is used to help the worst-off agents. We show that the adoption motivates agents to increase their availability (is incentive-compatible), but also that it is sufficient for acceptable data availability for weakly-available agents.
Place, publisher, year, edition, pages
ACM Special Interest Group on Computer Science Education, 2015. Vol. 10, no 3
IdentifiersURN: urn:nbn:se:kth:diva-174642DOI: 10.1145/2723771ISI: 000363674700001ScopusID: 2-s2.0-84940970636OAI: oai:DiVA.org:kth-174642DiVA: diva2:875910
FunderSwedish Foundation for Strategic Research , SSF FFL09-0086Swedish Research Council, VR 2009-3793
QC 201512022015-12-022015-10-072015-12-02Bibliographically approved