{"updated":"2025-01-22T00:52:49.081233+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00066781","sets":["1164:3696:5615:5920"]},"path":["5920"],"owner":"10","recid":"66781","title":["ピアの近接性を考慮したスキップグラフの構築"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-11-19"},"_buckets":{"deposit":"a557168d-af7d-44ed-8d88-5c16caa78a9f"},"_deposit":{"id":"66781","pid":{"type":"depid","value":"66781","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"ピアの近接性を考慮したスキップグラフの構築","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ピアの近接性を考慮したスキップグラフの構築"},{"subitem_title":"Constructing Skip Graphs with Proximity","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"セッション02 P2Pと無線通信","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2009-11-19","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","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/66781/files/IPSJ-GN09073005.pdf"},"date":[{"dateType":"Available","dateValue":"2011-11-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GN09073005.pdf","filesize":[{"value":"1.0 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":"29"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"725c2b45-fccc-4103-b00a-c65a38e552bd","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":"土屋, 達弘"},{"creatorName":"菊野, 亨"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Fuminori, Makikawa","creatorNameLang":"en"},{"creatorName":"Tatsuhiro, Tsuchiya","creatorNameLang":"en"},{"creatorName":"Tohru, Kikuno","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA1155524X","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":"キーの検索に特化したグラフであるスキップグラフは，ネットワーク上に点在するピアが持つキーを管理するために有効なグラフ構造である．しかし，通常のスキップグラフはピアの物理的な位置やピア間の通信時間などを考慮していない．そのため，部分的に通信時間が非常に大きいリンクがグラフ内に存在してしまう可能性がある．本論文ではスキップグラフを構築する際にピア間の通信時間を計測し，より通信時間が小さくなるようにグラフの構築を行う．また，グラフ全体のバランスを取るための手法も合わせて提案する．シミュレーションにより，提案した手法が通常のスキップグラフと比較して小さい検索時間でキーの検索ができることを確認した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A skip graph is a valuable overlay network for searching for keys in a peer-to-peer application. A problem with the construction algorithm for skip graphs is that it considers neither peers' physical location nor communication cost between peers. Because of this, a skip graph often contains links with considerably high communication time. In this paper, we propose a communication cost-aware construction to reduce the time required to search for keys. We also propose a method for dynamically keeping the balance of a skip graph. The results of simulations show that in the skip graph constructed by our approach, a peer can search for keys with lower time than in the original skip graph.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告グループウェアとネットワークサービス（GN）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2009-11-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2009-GN-73"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:27:26.226236+00:00","id":66781,"links":{}}