본문 바로가기
  • Home

An Adaptive Peer-to-Peer Search Algorithm for Reformed Node Distribution Rate

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2005, 10(4), pp.93-102
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

BoonHee Kim 1 Lee Jun Yeon 1

1동명대학교

Candidate

ABSTRACT

Excessive traffic of P2P applications in the limited communication environment is considered as a network bandwidth problem. Moreover, Though P2P systems search a resource in the phase of search using weakly connected systems(peers' connection to P2P overlay network is very weakly connected), it is not guaranteed to download the very peer's resource in the phase of download. In previous P2P search algorithm[1], we had adopted the heuristic peer selection method based on Random Walks to resolve this problems. In this paper, we suggested an adaptive P2P search algorithm based on the previous algorithm[1] to reform the node distribution rate which is affected in unit peer ability. Also, we have adapted the discriminative replication method based on a query ratio to reduce traffic amount additionally. In the performance estimation result of this suggested system, our system works on a appropriate point of compromise in due consideration of the direction of searching and distribution of traffic occurrence.

Citation status

* References for papers published after 2022 are currently being built.