{"created":"2023-05-15T12:20:27.147573+00:00","id":11030,"links":{},"metadata":{"_buckets":{"deposit":"dce9fb2b-1471-41ef-aed4-d90328964cfe"},"_deposit":{"created_by":1,"id":"11030","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"11030"},"status":"published"},"_oai":{"id":"oai:kansai-u.repo.nii.ac.jp:00011030","sets":["528:1538:1585"]},"author_link":["23598","23599","23600","23601"],"item_7_alternative_title_22":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Proposing Replica Allocation Scheme for Enhancement of Data　Availability over SkipGraph"}]},"item_7_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2009-03-10","bibliographicIssueDateType":"Issued"},"bibliographic_titles":[{}]}]},"item_7_description_4":{"attribute_name":"概要","attribute_value_mlt":[{"subitem_description":"本稿では，構造型P2P ネットワークのひとつであるSkipGraph における，複製配置によるデータ可用性の向上について議論する．まず，順序付きキーの列に対して，資源を割り当て，キー順序を保持したSkipGraph を構成することで，範囲検索の可能な形でデータを自律分散的にデータ管理を行う方法を提案している．さらに，SkipGraphの隣人関係に従って，複製データの配置法について提案し，ネットワーク上からデータを消失を防ぐための自律分散的な修復法について議論する．提案手法では，データ管理層を用いることにより，SkipGraph のトポロジー管理とデータ管理を独立させている．最後に，提案手法について有効性を確認するため，数値シミュレーションによる評価を行い，その有用性を示す．\n\\nThis paper studies a replica allocation scheme over a structured P2P network, SkipGraph. First, a method to construct SkipGraph network for a given key-ordered list of data, is provided by assigning nodes (=CPU) in logical key space to preserve key-order among data stored in subnetworks of higher layers. Also data management policies are discussed that enable range queries in terms of keys in autonomous P2P settings. Furthermore, a replica allocation scheme using SkipGraph topology is proposed, and discussion on repair strategies is also provided to avoid a complete loss of data from the network, due to the sudden disappear of nodes. In the approach, data management layer is separated from topology maintenance of SkipGraph, which enables to decrease complexity of replica management as well as network cost.","subitem_description_type":"Other"}]},"item_7_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"DEIMフォーラム2009　第1回データ工学と情報マネジメントに関するフォーラム　2009年3月8日～10日","subitem_description_type":"Other"}]},"item_7_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"23600","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Oku, Tomoteru"}]},{"nameIdentifiers":[{"nameIdentifier":"23601","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Ueshima, Shinichi"}]}]},"item_7_publisher_36":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_7_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"(C) 電子情報通信学会　http://db-event.jpn.org/deim2009/program.html"}]},"item_7_version_type_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"奥, 智照"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"上島, 紳一"}],"nameIdentifiers":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-22"}],"displaytype":"detail","filename":"KU-1100-20090310-01.pdf","filesize":[{"value":"191.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KU-1100-20090310-01.pdf","url":"https://kansai-u.repo.nii.ac.jp/record/11030/files/KU-1100-20090310-01.pdf"},"version_id":"1c07a617-0260-4286-9e5e-402d276f7f7f"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"SkipGraph","subitem_subject_scheme":"Other"},{"subitem_subject":"複製配置","subitem_subject_scheme":"Other"},{"subitem_subject":"自律分散","subitem_subject_scheme":"Other"},{"subitem_subject":"データ管理","subitem_subject_scheme":"Other"},{"subitem_subject":"SkipGraph","subitem_subject_scheme":"Other"},{"subitem_subject":"Replica Allocation","subitem_subject_scheme":"Other"},{"subitem_subject":"autonomous","subitem_subject_scheme":"Other"},{"subitem_subject":"data management","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"SkipGraph を用いたデータの可用性向上のための複製配置手法の提案","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"SkipGraph を用いたデータの可用性向上のための複製配置手法の提案"}]},"item_type_id":"7","owner":"1","path":["1585"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-09-11"},"publish_date":"2012-09-11","publish_status":"0","recid":"11030","relation_version_is_last":true,"title":["SkipGraph を用いたデータの可用性向上のための複製配置手法の提案"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-05-15T14:40:16.815955+00:00"}