By Topic

A Peer Selection Algorithm with Consideration of Both Network Topology Information and Node Capability in P2P Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tao Guo ; High Performance Network Lab., Chinese Acad. of Sci., Beijing, China ; Xu Zhou ; Hui Tang ; Zexu Wu

The features of P2P networking architecture can contribute to robustness and scalability, however, it also introduces network-oblivious traffic, which brings big pressure to the ISPs. Meanwhile, since traffic of P2P applications occupies much of bandwidth in bottleneck links, non-p2p applications may be severely harmed due to lack of bandwidth. To conquer this problem, previous works mainly focused on blocking the P2P traffic to benefit the ISPs, or optimizing peer selection algorithms which can only benefit the P2P applications but ignore the influence to the network. In this paper, we propose an algorithm, which is called PSANIC, to optimize peer selection in P2P networks with consideration of not only network topology information but also node capability. Simulation results show that PSANIC can achieve better performance than traditional DHT algorithms and the algorithm proposed in our previous work in [10], it can also reduce traffic significantly between domains in networks.

Published in:

Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on  (Volume:1 )

Date of Conference:

11-12 May 2010