Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
