{"created":"2023-05-15T11:57:42.458111+00:00","id":3440,"links":{},"metadata":{"_buckets":{"deposit":"9b8c1984-6ded-4046-904f-e3ace820d719"},"_deposit":{"created_by":3,"id":"3440","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"3440"},"status":"published"},"_oai":{"id":"oai:kyutech.repo.nii.ac.jp:00003440","sets":["8:24"]},"author_link":["13797","13798","13799","13800"],"control_number":"3440","item_1689815586683":{"attribute_name":"CRID","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://cir.nii.ac.jp/crid/1050282813887477760","subitem_relation_type_select":"URI"}}]},"item_1697440742810":{"attribute_name":"HDL","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"http://id.nii.ac.jp/1001/00046950/","subitem_relation_type_select":"HDL"}}]},"item_21_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2006-03-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"38","bibliographicPageEnd":"30","bibliographicPageStart":"25","bibliographicVolumeNumber":"2006-DSM-040","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告. DSM, [分散システム/インターネット運用技術]","bibliographic_titleLang":"ja"}]}]},"item_21_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"昨今,ネットワークの拡大やコンピュータの高性能化に伴い,コンピュータを対等な関係で相互に接続し自律的にサービスを維持するPeer to Peer技術が注目を浴びている.しかし,接続ノード数が大幅に増加した場合に性能の低下が予測され,更にスケーラブルなP2Pネットワークが必要であると考えられる.本稿では,P2Pネットワークにおける検索手法に着目し,ノード数に影響を受けにくい検索の高速化手法を提案する.本手法は,Distributed Hash Tableを用いた検索手法Chordを基に,ノード数が増加した場合にハッシュ空間を複製しノード数を削減することで高速化を図る.本稿では,これらの設計を述べ,さらにシミュレーションによる評価を行う.","subitem_description_language":"ja","subitem_description_type":"Abstract"},{"subitem_description":"Recently, Peer-to-Peer technology that is autonomous system attracts attention. However, it is thought that the lower performance when the number of nodes increases greatly. Therefore a more scalable P2P network is necessary. In this paper, we propose the high speed search algorithm that unrelated to the number of nodes. Proposal algorithm is based on Chord using \"Distributed Hush Table\". When the number of nodes in P2P network increases, this algorithm attempts to reduce the number of nodes by reproducing of Chord's hush space. Then we aim at the speed-up of the search speed. In this paper, we describe these designs and evaluate it by the simulation.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_21_publisher_7":{"attribute_name":"出版社","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"item_21_rights_13":{"attribute_name":"著作権関連情報","attribute_value_mlt":[{"subitem_rights":"社団法人情報処理学会. ここに掲載した著作物の利用に関する注意: 本著作物の著作権は（社）情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan."}]},"item_21_select_59":{"attribute_name":"査読の有無","attribute_value_mlt":[{"subitem_select_item":"yes"}]},"item_21_source_id_10":{"attribute_name":"NCID","attribute_value_mlt":[{"subitem_source_identifier":"AA11559681","subitem_source_identifier_type":"NCID"}]},"item_21_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0919-6072","subitem_source_identifier_type":"PISSN"}]},"item_21_text_64":{"attribute_name":"業績ID","attribute_value_mlt":[{"subitem_text_value":"7AEDB9163E1AC24A492576A400824981"}]},"item_21_version_type_58":{"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":"妙中, 雄三","creatorNameLang":"ja"},{"creatorName":"Taenaka, Yuzo","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorAffiliations":[{"affiliationNames":[{}]}],"creatorNames":[{"creatorName":"Yamaguchi, Shinnosuke","creatorNameLang":"en"},{"creatorName":"山口, 真之介","creatorNameLang":"ja"},{"creatorName":"ヤマグチ, シンノスケ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{},{}],"givenNames":[{},{},{}],"nameIdentifiers":[{},{},{},{}]},{"creatorNames":[{"creatorName":"西野, 和典","creatorNameLang":"ja"},{"creatorName":"Nishino, Kazunori","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorAffiliations":[{"affiliationNames":[{}]}],"creatorNames":[{"creatorName":"Ohnishi, Yoshimasa","creatorNameLang":"en"},{"creatorName":"大西, 淑雅","creatorNameLang":"ja"},{"creatorName":"オオニシ, ヨシマサ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{},{}],"givenNames":[{},{},{}],"nameIdentifiers":[{},{},{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2010-03-04"}],"displaytype":"detail","filename":"110004687626.pdf","filesize":[{"value":"628.0 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"110004687626.pdf","url":"https://kyutech.repo.nii.ac.jp/record/3440/files/110004687626.pdf"},"version_id":"c2212b4a-05d1-4669-9dae-f641fec3f3ae"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"ハッシュ空間の複製によるChordの高速化手法の提案と検証","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ハッシュ空間の複製によるChordの高速化手法の提案と検証","subitem_title_language":"ja"},{"subitem_title":"A High Speed Search Algorithm using Reproduction of Chord's Hush Space","subitem_title_language":"en"}]},"item_type_id":"21","owner":"3","path":["24"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2010-03-04"},"publish_date":"2010-03-04","publish_status":"0","recid":"3440","relation_version_is_last":true,"title":["ハッシュ空間の複製によるChordの高速化手法の提案と検証"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2024-01-29T07:17:50.914465+00:00"}