Study on a structured P2P routing algorithm considering physical network latency

Luo Yuan*, Keiichi Koyanagi

*この研究の対応する著者

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Chord [1] has been widely used as a routing protocol in structured peer-to-peer overlay networks. The neighbor peers in Chord are defined by logical address and there is no necessary causality between logical address and physical address. It may appear a "detour" phenomenon which reject what is near at hand and seek what is far away in the physical layer. This paper proposes a strategy that considers physical network latency presenting the distance in physical layer to some extent. The improved routing algorithm chooses the next hops based on both logical distance and physical latency and makes a trade-off between them. Theoretical and experimental analysis shows that Latency-based Chord can improve search performance effectively.

本文言語English
ホスト出版物のタイトル2011 International Conference on Computational Problem-Solving, ICCP 2011
ページ436-439
ページ数4
DOI
出版ステータスPublished - 2011 12 26
イベント2011 International Conference on Computational Problem-Solving, ICCP 2011 - Chengdu, China
継続期間: 2011 10 212011 10 23

出版物シリーズ

名前2011 International Conference on Computational Problem-Solving, ICCP 2011

Conference

Conference2011 International Conference on Computational Problem-Solving, ICCP 2011
国/地域China
CityChengdu
Period11/10/2111/10/23

ASJC Scopus subject areas

  • 計算数学

フィンガープリント

「Study on a structured P2P routing algorithm considering physical network latency」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル