@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00089826,
 author = {木谷, 友哉 and 中村, 嘉隆 and TOMOYA, KITANI and YOSHITAKA, NAKAMURA},
 book = {マルチメディア通信と分散処理ワークショップ論文集},
 issue = {14},
 month = {Dec},
 note = {一般に構造型P2Pネットワークは.ラベル付けされた情報を分散ハッシュ表(DHT)などを用いて分散管理している.このとき.P2Pネットワークのトポロジ構成,および,リンクの張られたノード間距離がサービス提供時の遅延に大きな影響を与える.そこで,本稿では,各ノードの地理情報を考慮して,遅延の小さな構造型P2Pオーバレイネットワークを構築するプロトコルの提案を行う.提案手法では,ノード間のリンク遅延がそのノード間の物理的距離に比例すると仮定し,任意のノード間のリンク遅延が最小になるようにトポロジを構成する.また,このときトポロジのネットワーク直径はO(logN)(Nはノード数)に抑えるようにする., 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.},
 pages = {139--144},
 publisher = {情報処理学会},
 title = {ノードの地理情報を考慮した遅延の小さな構造型P2Pオーバレイネットワークの構築法},
 volume = {2008},
 year = {2008}
}