{"updated":"2025-01-22T02:39:43.084273+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00062396","sets":["1164:2836:5643:5720"]},"path":["5720"],"owner":"10","recid":"62396","title":["遅延状況を考慮した構造型 P2P オーバレイネットワーク構築法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-06-11"},"_buckets":{"deposit":"48c30ccb-be3e-4e24-9505-c22081599bc5"},"_deposit":{"id":"62396","pid":{"type":"depid","value":"62396","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"遅延状況を考慮した構造型 P2P オーバレイネットワーク構築法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"遅延状況を考慮した構造型 P2P オーバレイネットワーク構築法"},{"subitem_title":"A configuration method for structured P2P overlay network considering delay variations","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"P2P(1) ネットワーク","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2009-06-11","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"静岡大学"},{"subitem_text_value":"奈良先端科学技術大学院大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Nara Institute of Science and 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/62396/files/IPSJ-DPS09139003.pdf"},"date":[{"dateType":"Available","dateValue":"2011-06-11"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPS09139003.pdf","filesize":[{"value":"329.0 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":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"90b32146-a5eb-49f0-8a52-68fe0f224856","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"木谷, 友哉"},{"creatorName":"中村, 嘉隆"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tomoya, Kitani","creatorNameLang":"en"},{"creatorName":"Yoshitaka, Nakamura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10116224","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":"P2P サービスはネットワーク上のノードにコンテンツやリソースを分散配置しているため，高いスケーラビリティを達成している．これらのリソースを利用する際は，ネットワーク上でのリソース位置を検索する必要がある．一般にこのようなサービスの検索では分散ハッシュテーブルがよく用いられる手法であるが，限られた範囲を指定した検索など，検索目的によっては効率が悪くなることが知られている．そこで本稿では，範囲検索を実現するために，各ノードの地理情報をもとに各ノード間の遅延変動を考慮した構造型 P2P オーバレイネットワークを構築するプロトコルの提案を行う．提案手法では，ばねの原理を用いて遅延変動を考慮した座標設定を行ない，座標を空間充填曲線にマッピングすることで効率的な P2P ネットワークの検索を実現している．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"P2P networks can achieve high scalability since they distribute service contents/resources to multiple nodes in the network． In a P2P network, it is necessary to search the resource location on the network when we use some contents/resources． Generally, each part of contents is labeled and dispersed in the network, and it is managed by a distributed hash table (DHT)． But search efficiency becomes worse in the limited region search of such service． In this paper, we propose a new configuration method for structured P2P overlay network． In the proposed method, we set each coordinate considering delay variation and achieve the efficient search of P2P network by mapping a coordinate onto space filling curve．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告マルチメディア通信と分散処理（DPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2009-06-11","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2009-DPS-139"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:24:21.717444+00:00","id":62396,"links":{}}