Mechanism design for Data Replica Placement (DRP) problem in strategic settings

Minzhe Guo and Prabir Bhattacharya

Journal of Information Privacy and Security, 2016, vol. 12, issue 1, 32-54

Abstract: This article addresses the problem of Data Replica Placement, an important technique used in storage-capable distributed networks to improve system availability, reliability, and fault-tolerance. The study focuses on the Data Replica Placement problem in strategic settings inspired by practical market-based data replication applications, such as content delivery networks. Multiple self-interested players with private preferences own data objects for replication. Players compete for storage space among replication servers for placing replicas with the objective to optimize their own profits. Using mechanism design approach, the authors consider the problem as a sequential composition of knapsack auctions and design an algorithmic mechanism DRPMECH to aggregate players’ preferences and approximate a social efficient allocation for the problem. This work analyzes both the economic and computational properties of DRPMECH, validates the properties using experiments, and compares its performance against related game-theoretical solutions.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/15536548.2016.1139425 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uipsxx:v:12:y:2016:i:1:p:32-54

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uips20

DOI: 10.1080/15536548.2016.1139425

Access Statistics for this article

Journal of Information Privacy and Security is currently edited by Chuleeporn Changchit

More articles in Journal of Information Privacy and Security from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().