@techreport{oai:ipsj.ixsq.nii.ac.jp:00194859,
 author = {金子, 孟司 and 坂野, 遼平 and 青木, 優介 and 首藤, 一幸 and Takeshi, Kaneko and Ryohei, Banno and Yusuke, Aoki and Kazuyuki, Shudo},
 issue = {50},
 month = {Feb},
 note = {ノード群による自律分散的なネットワークを構築し，効率的なルーティングを実現する構造化オーバレイ技術の一つに Skip Graph がある．Skip Graph は，各ノードに割り当てられる membership vector に基づいてネットワークトポロジを形成することで，ノード数 n に対してO (logn) の経路長を達成する．しかし，各ノードは大域的な情報をもたないため，大抵の場合は最短経路ではない．そこで我々は，迂回経路を活用することで経路長を短縮する Detouring Skip Graph を提案する．提案手法は追加リンクの構築等を必要としないため，Skip Graph の特長を維持した上での経路長の短縮に成功している．評価実験により，平均経路長がSkip Graph よりも 20% から 30% 程度短縮したことを確認した．, Skip Graph, one of the structured overlays, constructs its own structure based on membership vectors assigned to every node, and consequently it provides routing path lengths of O (logn) where n is the total number of nodes. However, there is a problem that most of routing paths are not the shortest paths because each node knows only its local information, rather than the global topology. We proposed Detouring Skip Graph, which shortens the path lengths by means of utilizing detour routes. It does not require construction of extra links and modification of its topology ; thereby, we succeeded in shortening them while maintaining the advantages of Skip Graph. Our evaluation experiments confirmed that the average path length was shortened by approximately 20% to 30% compared to Skip Graph.},
 title = {DetouringSkipGraph:迂回経路を活用する構造化オーバレイ},
 year = {2019}
}