{"updated":"2025-01-20T03:21:39.289828+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00184231","sets":["1164:2592:9018:9281"]},"path":["9281"],"owner":"11","recid":"184231","title":["BDDを用いたリンクの故障に依存関係がある場合のネットワーク信頼性評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-11-09"},"_buckets":{"deposit":"9cd3f8b1-25b0-4805-a658-45d2861f7703"},"_deposit":{"id":"184231","pid":{"type":"depid","value":"184231","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"BDDを用いたリンクの故障に依存関係がある場合のネットワーク信頼性評価","author_link":["406746","406749","406744","406745","406743","406748","406750","406747"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"BDDを用いたリンクの故障に依存関係がある場合のネットワーク信頼性評価"},{"subitem_title":"On network reliability with link failure dependencies using BDDs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2017-11-09","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"奈良先端科学技術大学院大学情報科学研究科"},{"subitem_text_value":"奈良先端科学技術大学院大学情報科学研究科"},{"subitem_text_value":"NTT未来ねっと研究所"},{"subitem_text_value":"奈良先端科学技術大学院大学情報科学研究科"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/184231/files/IPSJ-AL17165016.pdf","label":"IPSJ-AL17165016.pdf"},"date":[{"dateType":"Available","dateValue":"2019-11-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL17165016.pdf","filesize":[{"value":"2.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"443d2ab5-41be-4d49-96c0-e04b86c812e4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"吉田, 拓弥"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"川原, 純"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"井上, 武"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"笠原, 正治"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takuya, Yoshida","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Jun, Kawahara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takeru, Inoue","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shoji, Kasahara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ネットワーク信頼性評価とは，ネットワークの各リンクに静的な故障確率が設定されている場合に，2 頂点間が通信可能である確率を求める問題である．確率を厳密に計算する手法として，二分決定グラフ (BDD) を用いた計算方法が知られている．BDDは 論理関数を圧縮して効率よく表現できるデータ構造である．本稿では，ネットワークの 2 つ以上のリンクの故障に依存関係がある場合の信頼性評価を行う．本手法では，リンク間に存在する依存関係を BDD で表現し，依存関係を考慮しない場合に構築した BDD との二項演算を行うことで，依存関係を考慮した信頼性 BDD を生成し，確率を計算する．本手法を 3 つの計算方法で実装し，各方法を処理時間と生成される BDD のノード数の観点から比較を行う．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The network reliability evaluation is to find the probability that two specified nodes can communicate with each other in a given network whose links break down with some probabilities. Calculation methods based on Binary Decision Diagram (BDD) are known as strict methods for the network reliability evaluation. A BDD is a data structure that can efficiently express Boolean functions. In this research, we propose methods to calculate the reliability considering dependencies between links of a network. We implement three calculation methods and compare them in terms of the running time and BDD size.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2017-11-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"16","bibliographicVolumeNumber":"2017-AL-165"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:51:41.514250+00:00","id":184231,"links":{}}