{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00099492","sets":["581:7397:7514"]},"path":["7514"],"owner":"11","recid":"99492","title":["多数決投票を用いた分散システムの可用性の最大化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-03-15"},"_buckets":{"deposit":"1fa3658b-bd47-4913-80fa-42ed84d88b70"},"_deposit":{"id":"99492","pid":{"type":"depid","value":"99492","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"多数決投票を用いた分散システムの可用性の最大化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"多数決投票を用いた分散システムの可用性の最大化"},{"subitem_title":"Maximizing the Availability of Distributed Systems That Use Voting","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[一般論文(推薦論文)] レプリケーション，多数決投票，可用性，パーティション，SMT","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2014-03-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/99492/files/IPSJ-JNL5503010.pdf"},"date":[{"dateType":"Available","dateValue":"2016-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5503010.pdf","filesize":[{"value":"639.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"de9f7936-9dae-4c36-8783-31fc3390f167","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松井, 佑記"},{"creatorName":"小島, 英春"},{"creatorName":"土屋, 達弘"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuki, Matsui","creatorNameLang":"en"},{"creatorName":"Hideharu, Kojima","creatorNameLang":"en"},{"creatorName":"Tatsuhiro, Tsuchiya","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本研究では，ネットワーク上に分散したレプリカからなる多重化データの可用性を最大化する手法について議論する．障害が生じる状況下において，データのレプリカに対する一貫性を提供する機構として，多数決投票システムが知られている．多数決投票システムにおけるレプリカへの票割当ては，このシステムにおけるデータ可用性に大きな影響を与える．そこで，本研究では，可用性を最大化する票割当てをMAX-SMT問題と呼ばれる組合せ最適化問題として定式化し，高速なMAX-SMTソルバを用いて，票割当て問題の解を求める手法を提案する．提案手法の有効性を評価するため，トポロジと故障・修復を考慮したネットワークのモデルを構築し，その上で稼動する分散システムを想定して提案手法の評価を行った．その結果，レプリカ数10以下のシステムであれば，実用的な時間で提案手法を適用し可用性を最大化する票割当てを求めることができること，および，最適な票割当てを用いることで，障害が生じる状況におけるデータ可用性が大きく改善できることが分かった．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We address the issue of maximization of the availability of replicated data that are distributed in a wide area network. We consider a system that uses majority voting, which is a common mechanism for providing consistency of replicated data in the presence of failures. The data availability provided by this mechanism critically depends on the vote assignment to the replicas. In this paper we formulate the problem of finding the optimal vote assignment into a specific form of a combinatorial optimization problem, namely the MAX-SMT problem. This formulation allows us to use a modern, fast MAX-SMT solver to solve the vote assignment problem. To evaluate the effectiveness of this approach, we build a failure-repair model of underlying networks and perform an experiment using that model. The results of the experiment show that if the number of replicas does not exceed 10, then the proposed approach can produce the optimal vote assignment practically, and that data availability can be significantly improved using the optimal vote assignment in the presence of failures.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1185","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1177","bibliographicIssueDates":{"bibliographicIssueDate":"2014-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"55"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":99492,"updated":"2025-01-21T12:01:58.588621+00:00","links":{},"created":"2025-01-18T23:45:30.739272+00:00"}