首页> 外文会议>2010 International Conference on Intelligent Computation Technology and Automation >A Peer Selection Algorithm With Consideration of Both Network Topology Information and Node Capability in P2P Network
【24h】

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

机译:P2P网络中同时考虑网络拓扑信息和节点能力的对等选择算法

获取原文
获取外文期刊封面目录资料

摘要

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.
机译:P2P网络体系结构的功能可以提高鲁棒性和可伸缩性,但是它也引入了网络无关的流量,这给ISP带来了巨大压力。同时,由于P2P应用程序的流量在瓶颈链路中占用大量带宽,因此非p2p应用程序可能会由于带宽不足而受到严重损害。为了解决这个问题,以前的工作主要集中在阻止P2P流量以使ISP受益,或者优化对等点选择算法,这只能使P2P应用受益,而忽略了对网络的影响。在本文中,我们提出了一种称为PSANIC的算法,该算法不仅考虑网络拓扑信息,而且考虑节点能力,以优化P2P网络中的对等方选择。仿真结果表明,PSANIC可以比传统的DHT算法和我们先前的工作[10]中提出的算法获得更好的性能,并且还可以显着减少网络域之间的流量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号