IDEAS home Printed from https://ideas.repec.org/a/taf/uipsxx/v12y2016i1p32-54.html
   My bibliography  Save this article

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

Author

Listed:
  • Minzhe Guo
  • Prabir Bhattacharya

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.

Suggested Citation

  • Minzhe Guo & Prabir Bhattacharya, 2016. "Mechanism design for Data Replica Placement (DRP) problem in strategic settings," Journal of Information Privacy and Security, Taylor & Francis Journals, vol. 12(1), pages 32-54, January.
    • Handle: RePEc:taf:uipsxx:v:12:y:2016:i:1:p:32-54
    DOI: 10.1080/15536548.2016.1139425
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/15536548.2016.1139425
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/15536548.2016.1139425?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uipsxx:v:12:y:2016:i:1:p:32-54. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uips .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.