A Game Theoretic Approach to Power Reduction in Distributed Storage Systems

• Item type: Trans(1)
• 公開日: 2015-11-20
• タイトル: A Game Theoretic Approach to Power Reduction in Distributed Storage Systems
• タイトル / 言語: en
• タイトル: A Game Theoretic Approach to Power Reduction in Distributed Storage Systems
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [省電力方式] distributed storage system, power-saving, autonomous control, game theory
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Computer Science, University of Tsukuba
• 著者所属: DWANGO Co., Ltd.
• 著者所属: Department of Computer Science, University of Tsukuba
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, University of Tsukuba
• 著者所属(英): en
• 著者所属(英): DWANGO Co., Ltd.
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, University of Tsukuba
• 著者名: Koji, Hasebe; Takumi, Sawada; Kazuhiko, Kato
• 著者名(英): Koji, Hasebe; Takumi, Sawada; Kazuhiko, Kato
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: We present a game theoretic approach for power reduction in large-scale distributed storage systems. The key idea is to use a distributed hash table and migrate its virtual nodes dynamically so as to skew the workload towards a subset of physical disks while not overloading them. To realize this idea in an autonomous way, virtual nodes are regarded as selfish agents playing a game in which each node receives a payoff according to the workload of the disk on which it currently resides. We model this setting as a potential game, a kind of strategic game in which the incentive of all players to change their strategy can be represented by a single global function. Thus, any increase in the payoff of a virtual node yields a better state in terms of energy conservation. This game model consists of a pair of global and private payoff functions, derived by the Wonderful Life Utility scheme. The former function evaluates how good the current state of the system is, while the latter determines the current payoff of each node. The performance of our method is measured both by simulations and a prototype implementation. From the experiments, we observed that our method consumed 11.1%-16.4% less energy than the static configuration. In addition, although a small number of responses were heavily delayed because of overloading of some disks at peak time, our method maintained preferred overall average response time in the range 50-190ms.; \n------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.24(2016) No.1(online); ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: We present a game theoretic approach for power reduction in large-scale distributed storage systems. The key idea is to use a distributed hash table and migrate its virtual nodes dynamically so as to skew the workload towards a subset of physical disks while not overloading them. To realize this idea in an autonomous way, virtual nodes are regarded as selfish agents playing a game in which each node receives a payoff according to the workload of the disk on which it currently resides. We model this setting as a potential game, a kind of strategic game in which the incentive of all players to change their strategy can be represented by a single global function. Thus, any increase in the payoff of a virtual node yields a better state in terms of energy conservation. This game model consists of a pair of global and private payoff functions, derived by the Wonderful Life Utility scheme. The former function evaluates how good the current state of the system is, while the latter determines the current payoff of each node. The performance of our method is measured both by simulations and a prototype implementation. From the experiments, we observed that our method consumed 11.1%-16.4% less energy than the static configuration. In addition, although a small number of responses were heavily delayed because of overloading of some disks at peak time, our method maintained preferred overall average response time in the range 50-190ms.; \n------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.24(2016) No.1(online); ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11833852
• 書誌情報: 情報処理学会論文誌コンピューティングシステム（ACS）; 巻 8, 号 4, 発行日 2015-11-20
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7829
• 出版者 / 言語: ja
• 出版者: 情報処理学会