A trust-based routing strategy in structured P2P overlay networks

Yang Han, Keiichi Koyanagi, Takeshi Tsuchiya, Tadashi Miyosawa, Hiroo Hirose

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

The existing P2P routing algorithms generally don't take routing security into consideration. Therefore P2P overlay systems are vulnerable to a kind of attacks called misrouting attacks. This is especially serious in structured P2P overlays due to the deterministic routing algorithms. What's more, in dynamic network environments, the continuous process of node arrival and departure, churn, makes peers' routing table lose accuracy and may lead to the increase of system latency. In this paper, we propose a trust-based routing strategy in structured P2P systems to solve these problems, using quantified trust degree to select next-hops and neighbors. Not only direct trust, but also indirect trust is used for optimization. At the end of this paper, the simulation results show that this trust-based routing strategy leads to higher look-up success rate compared to the original routing algorithm, with the same magnitude of cost.

本文言語English
ホスト出版物のタイトルInternational Conference on Information Networking 2013, ICOIN 2013
ページ77-82
ページ数6
DOI
出版ステータスPublished - 2013
イベント27th International Conference on Information Networking, ICOIN 2013 - Bangkok, Thailand
継続期間: 2013 1 272013 1 30

出版物シリーズ

名前International Conference on Information Networking
ISSN(印刷版)1976-7684

Conference

Conference27th International Conference on Information Networking, ICOIN 2013
CountryThailand
CityBangkok
Period13/1/2713/1/30

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

フィンガープリント 「A trust-based routing strategy in structured P2P overlay networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル