期刊文献+

基于DHT的P2P系统的负载均衡算法 被引量:26

A Load Balancing Algorithm for DHT-Based P2P Systems
下载PDF
导出
摘要 在基于DHT的结构化P2P系统中,DHT的使用以及节点处理能力的不同导致系统中节点的负载不均衡.现有的负载均衡算法存在两个不足:①负载的转移没有考虑节点之间的链路延迟;②算法依赖于系统中固定位置的某些节点.提出了分布式负载均衡算法:每个节点周期性的收集系统局部负载信息,然后选择链路延迟较小的节点进行负载转移.算法依赖于系统中的所有节点,解决了单点失败问题.同时,负载的转移是在链路延迟较小的节点之间进行的.仿真实验表明,①对于各种系统利用率,该算法都可以获得理想的负载均衡效果;②算法可以使负载转移开销减少45%以上. In DHT-based P2P systems, DHT and the heterogeneity of node capacities can cause a load imbalance problem. Existing load balancing approaches have two limitations. First, they do not take the link latency into account when moving loads. Second, they heavily rely on some nodes of fixed locations in the system. A distributed load balancing algorithm is presented in this paper. Every node gathers local load balancing information periodically, and chooses a physically close node close to transfer the load. This algorithm relies on all the nodes in the system to solve a single-point failure problem. Meanwhile, loads are moved between the nodes with smaller link latency. Simulation experiments show that the algorithm can achieve a good load balance in terms of different system utilization and the load movement cost reduction rate is above 45 %
出处 《计算机研究与发展》 EI CSCD 北大核心 2006年第9期1579-1585,共7页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60403031 90604015) 国家"八六三"高技术研究发展计划基金项目(2005AA121560)
关键词 P2P系统 负载均衡 虚拟服务器 P2P systems load balancing virtual servers
  • 相关文献

参考文献14

  • 1S Ratnasamy, P Francis, M Handley, et al. A scalable content-addressable network [C]. SIGCOMM 2001, San Diego, CA,USA, 2001 被引量:1
  • 2I Stoica, R Morris, D Karger, et al. Chord: A scalable peer-to-peer lookup service for Internet applications [C]. SIGCOMM 2001, San Deigo, CA, USA, 2001 被引量:1
  • 3A Rowstron, P Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [C].Int'l Conf on Distributed Systems Platforms (Middleware),Heidelberg, Germany, 2001 被引量:1
  • 4B Y Zhao, L Huang, J Stribling, et al. Tapestry: A resilient global-scale overlay for service deployment [J]. IEEE Journal on Selected Areas in Communications, 2004, 22 (1) : 41-53 被引量:1
  • 5D Karger, E Lehman, T Leighton, et al. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web [C]. The 29th Annual ACM Symposium on Theory of Computing, Texas, USA, 1997 被引量:1
  • 6S Saroiu, P K Gummadi, S D Gribble. A measurement study of peer-to-peer file sharing systems [C]. Multimedia Computing and Networking(MMCN), San Jose, USA, 2002 被引量:1
  • 7F Dabek, M F Kaashoek, D Karger, et al. Wide-Area Cooperative storage with CFS [C]. The 18th ACM Symp Operating Systems Principles (SOSP), Banff, Canada, 2001 被引量:1
  • 8A Rao, K Lakshminarayanan, S Surana, et al. Load balancing in structured P2P systems [C]. IPTPS, Berkeleg, CA, USA,2003 被引量:1
  • 9B Godfrey, K Lakshminarayanan, S Surana, et al. Load balancing in dynamic structured P2P systems [C]. IEEE INFOCOM, Hong Kong, 2004 被引量:1
  • 10Y Zhu, Y Hu. Efficient. Proximity-aware load balancing for DHT-based P2P systems [J]. IEEE Trans on Parallel and Distributed Systems, 2005, 16(4): 349-361 被引量:1

同被引文献239

引证文献26

二级引证文献56

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部