A trust-based routing strategy in structured P2P overlay networks

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (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.

Original languageEnglish
Title of host publicationInternational Conference on Information Networking 2013, ICOIN 2013
Number of pages6
Publication statusPublished - 2013
Externally publishedYes
Event27th International Conference on Information Networking, ICOIN 2013 - Bangkok, Thailand
Duration: 2013 Jan 272013 Jan 30

Publication series

NameInternational Conference on Information Networking
ISSN (Print)1976-7684


Conference27th International Conference on Information Networking, ICOIN 2013


  • Chord
  • P2P overlay network
  • churn
  • routing
  • trust

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems


Dive into the research topics of 'A trust-based routing strategy in structured P2P overlay networks'. Together they form a unique fingerprint.

Cite this