{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00046950","sets":["1164:4088:4104:4111"]},"path":["4111"],"owner":"1","recid":"46950","title":["ハッシュ空間の複製によるChordの高速化手法の提案と検証"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-03-29"},"_buckets":{"deposit":"55759a19-89c2-4487-a578-1a1d301dbbfb"},"_deposit":{"id":"46950","pid":{"type":"depid","value":"46950","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"ハッシュ空間の複製によるChordの高速化手法の提案と検証","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ハッシュ空間の複製によるChordの高速化手法の提案と検証"},{"subitem_title":"A High Speed Search Algorithm using Reproduction of Chord's Hush Space","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2006-03-29","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州工業大学 情報工学部"},{"subitem_text_value":"九州工業大学 情報工学部"},{"subitem_text_value":"九州工業大学 情報工学部"},{"subitem_text_value":"九州工業大学 情報工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information Engineering, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Engineering, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Engineering, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Engineering, Kyushu Institute of Technology","subitem_text_language":"en"}]},"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/46950/files/IPSJ-DSM06040005.pdf"},"date":[{"dateType":"Available","dateValue":"2008-03-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DSM06040005.pdf","filesize":[{"value":"1.7 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":"43"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"53b39b6d-5833-4968-b3d1-af5dc5c95e65","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2006 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"妙中雄三"},{"creatorName":"山口, 真之介"},{"creatorName":"西野, 和典"},{"creatorName":"大西淑雅"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuzo, TAENAKA","creatorNameLang":"en"},{"creatorName":"Shin'nosuke, YAMAGUCHI","creatorNameLang":"en"},{"creatorName":"Kazunori, NISHINO","creatorNameLang":"en"},{"creatorName":"Yoshimasa, OHNISHI","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12326962","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"昨今、ネットワークの拡大やコンピュータの高性能化に伴い、コンピュータを対等な関係で相互に接続し自律的にサービスを維持するPeer to Peer技術が注目を浴びている。しかし、接続ノード数が大幅に増加した場合に性能の低下が予測され、更にスケーラブルなP2Pネットワークが必要であると考えられる。本稿では、P2Pネットワークにおける検索手法に着目し、ノード数に影響を受けにくい検索の高速化手法を提案する。本手法は、Distributed Hash Tableを用いた検索手法Chordを基に、ノード数が増加した場合にハッシュ空間を複製しノード数を削減することで高速化を図る。本稿では、これらの設計を述べ、さらにシミュレーションによる評価を行う。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"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_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"30","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告インターネットと運用技術（IOT）"}],"bibliographicPageStart":"25","bibliographicIssueDates":{"bibliographicIssueDate":"2006-03-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"38(2006-DSM-040)","bibliographicVolumeNumber":"2006"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":46950,"updated":"2025-01-22T09:12:37.965272+00:00","links":{},"created":"2025-01-18T23:12:32.725483+00:00"}