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

IF 0.5 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING International Journal of Information Security and Privacy Pub Date : 2016-01-02 DOI:10.1080/15536548.2016.1139425

Minzhe Guo, P. Bhattacharya

{"title":"Mechanism design for Data Replica Placement (DRP) problem in strategic settings","authors":"Minzhe Guo, P. Bhattacharya","doi":"10.1080/15536548.2016.1139425","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":44332,"journal":{"name":"International Journal of Information Security and Privacy","volume":"15 1","pages":"32 - 54"},"PeriodicalIF":0.5000,"publicationDate":"2016-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Information Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/15536548.2016.1139425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 0

Abstract

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

战略环境下数据副本放置(DRP)问题的机制设计

本文讨论了数据副本放置问题，这是一种在具有存储能力的分布式网络中用于提高系统可用性、可靠性和容错性的重要技术。该研究主要关注基于市场的实际数据复制应用(如内容交付网络)所启发的战略设置中的数据副本放置问题。多个具有私有偏好的自利参与者拥有用于复制的数据对象。玩家在复制服务器之间争夺存储空间，以放置副本，以优化自己的利润。采用机制设计方法，将该问题视为背包拍卖的连续组合，并设计了一种算法机制DRPMECH来汇总参与者的偏好并近似求解该问题的社会有效分配。本文分析了DRPMECH的经济和计算特性，通过实验验证了其特性，并将其性能与相关博弈论解决方案进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

International Journal of Information Security and Privacy COMPUTER SCIENCE, SOFTWARE ENGINEERING-

CiteScore

2.50

自引率

0.00%

发文量

期刊介绍： As information technology and the Internet become more and more ubiquitous and pervasive in our daily lives, there is an essential need for a more thorough understanding of information security and privacy issues and concerns. The International Journal of Information Security and Privacy (IJISP) creates and fosters a forum where research in the theory and practice of information security and privacy is advanced. IJISP publishes high quality papers dealing with a wide range of issues, ranging from technical, legal, regulatory, organizational, managerial, cultural, ethical and human aspects of information security and privacy, through a balanced mix of theoretical and empirical research articles, case studies, book reviews, tutorials, and editorials. This journal encourages submission of manuscripts that present research frameworks, methods, methodologies, theory development and validation, case studies, simulation results and analysis, technological architectures, infrastructure issues in design, and implementation and maintenance of secure and privacy preserving initiatives.

期刊最新文献

Adaptive Personalized Randomized Response Method Based on Local Differential Privacy A Novel CNN-LSTM Fusion-Based Intrusion Detection Method for Industrial Internet A System Dynamics Approach to Evaluate Advanced Persistent Threat Vectors Trust and Voice Biometrics Authentication for Internet of Things “Every Dog Has His Day”