{"updated":"2025-01-21T16:19:24.812046+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00089826","sets":["6164:6165:7006:7057"]},"path":["7057"],"owner":"11","recid":"89826","title":["ノードの地理情報を考慮した遅延の小さな構造型P2Pオーバレイネットワークの構築法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-12-03"},"_buckets":{"deposit":"5278d1d8-90de-4130-8962-d7bc7fe67f1d"},"_deposit":{"id":"89826","pid":{"type":"depid","value":"89826","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"ノードの地理情報を考慮した遅延の小さな構造型P2Pオーバレイネットワークの構築法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ノードの地理情報を考慮した遅延の小さな構造型P2Pオーバレイネットワークの構築法"},{"subitem_title":"A configuration method of small-delay P2P overlay networks using geometryc positions of nodes","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"マルチメディア通信と分散処理ワークショップ","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2008-12-03","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"静岡大学"},{"subitem_text_value":"奈良先端科学技術大学院大学 情報科学研究科"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Nara Institute of Science and Technology","subitem_text_language":"en"}]},"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/89826/files/IPSJ-DPSWS2008024.pdf"},"date":[{"dateType":"Available","dateValue":"2008-01-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPSWS2008024.pdf","filesize":[{"value":"2.3 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":"44"}],"accessrole":"open_date","version_id":"8868e29b-721d-43f7-8727-bfe2d8c3615d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"木谷, 友哉"},{"creatorName":"中村, 嘉隆"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"TOMOYA, KITANI","creatorNameLang":"en"},{"creatorName":"YOSHITAKA, NAKAMURA","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"一般に構造型P2Pネットワークは.ラベル付けされた情報を分散ハッシュ表(DHT)などを用いて分散管理している.このとき.P2Pネットワークのトポロジ構成,および,リンクの張られたノード間距離がサービス提供時の遅延に大きな影響を与える.そこで,本稿では,各ノードの地理情報を考慮して,遅延の小さな構造型P2Pオーバレイネットワークを構築するプロトコルの提案を行う.提案手法では,ノード間のリンク遅延がそのノード間の物理的距離に比例すると仮定し,任意のノード間のリンク遅延が最小になるようにトポロジを構成する.また,このときトポロジのネットワーク直径はO(logN)(Nはノード数)に抑えるようにする.","subitem_description_type":"Other"}]},"item_18_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, generally, each part of contents is labelled and dispersed in the network, and it is managed by a distributed hash table )DHT).  Even in a huge network with 10,000 nodes, it is desirable that each node in the network can access to all nodes with service contents in at most 10 hops since larger hops lead longer access time.  It is important to design the topology of a given P2P network because it makes a big impact on its performance such as communication delay between nodes.  In this study, we will propose a topology where the network diameter is the logarithmic order of N (N denotes the number of nodes).  In addition, we will consider the communication delay of each link in the topology and make it minimize under the assumption that the communication delay of links is proportional to its physical distance.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"144","bibliographic_titles":[{"bibliographic_title":"マルチメディア通信と分散処理ワークショップ論文集"}],"bibliographicPageStart":"139","bibliographicIssueDates":{"bibliographicIssueDate":"2008-12-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"14","bibliographicVolumeNumber":"2008"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:39:32.895557+00:00","id":89826,"links":{}}