期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

动态结构化P2P网络的负载均衡方案 被引量：3

Load Balancing Scheme for Dynamic Structured P2P Networks
下载PDF
导出
摘要 DHT结构化P2P网络中,节点上存放对象个数的差异性、节点处理能力的异构性以及P2P网络的动态性,使P2P网络出现负载不均衡问题.为此,文中在超立方DHT覆盖网络上构建了基于二叉树的层次化负载均衡模型,用于收集节点的负载和容量信息、生成负载均衡策略和执行负载转移操作.通过应用均衡域的操作模式,P2P网络的负载均衡任务可按照并行与分布式进行处理.模拟结果表明,在动态的P2P网络环境下,负载均衡方案可获得较好的效果. In DHT-based structured P2P（Peer to Peer） networks,load imbalance occurs owing to the non-uniform distribution of objects stored at peer nodes,the heterogeneity nature of node capabilities and the dynamic characte-ristics of P2P networks.In order to solve this problem,a hierarchical load balancing model based on binary trees is established on the hypercube DHT overlay networks.The proposed model is used to collect the load and capacity information of nodes,develop the load balancing strategy and transfer the overloaded loads.In this model,by using the balancing domain,load balancing can be implemented in a parallel and distributed way.Simulation results show that the proposed scheme can achieve preferable load balancing in the environment of dynamic P2P networks.
作者 彭利民 肖文俊
机构地区 华南理工大学计算机科学与工程学院 华南理工大学软件学院
出处 《华南理工大学学报（自然科学版）》 EI CAS CSCD 北大核心 2011年第10期55-60,共6页 Journal of South China University of Technology(Natural Science Edition)
基金 国家自然科学基金资助项目(60973150 61103037) 国家科技支撑计划项目(2009BAH46B01)
关键词 P2P网络 负载均衡 虚拟服务器 均衡域 二叉树 peer to peer networks load balancing virtual server balancing domain binary trees
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献12

  • 1Karger D, Lehman E, Leighton T, et al. Consistent hashing and random trees:distributed caching protocols for relieving hot spots on the World Wide Web [ C ]//Proceedings of the 29th Annual ACM Symposium on Theory of Compu- ting. Texas : ACM, 1997:654-663.
  • 2Saroiu S, Gummadi P K, Gribble S D. A measurement study of peer-to-peer file sharing systems [ C ] jj Procee- dings of Multimedia Computing and Networking. San Jose : SPIE,2002 : 156-170.
  • 3Willebeek L H, Reeves A P. Strategies for dynamic load balancing on highly parallel computers [ J ]. IEEE Tran- sactions on Parallel and Distributed Systems, 1993,9 (4) : 979-993.
  • 4闫钧华,张焕春,经亚枝.基于Multi-agent的分布式系统负载平衡[J].华南理工大学学报（自然科学版）,2004,32(12):74-79. 被引量：7
  • 5Rao A, Lakshminarayanan K, Surana S, et al. Load balan- cing in structured P2P systems [ C] /,/Proceedings of the 2nd International Workshop Peer-to-Peer Systems. Berke- ley : Springer-Verlag,2003 : 68- 79.
  • 6Godfrey B, Lakshminarayanan K, Surana S, et al. Load balancing in dynamic structured P2P systems [ C ]//Pro- ceeding of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies. Los Alamiws: IEEE,2004:2253-2262.
  • 7Zhu Yingwu, Hu Yiming balancing for DHT-based sactions on Parallel and (4) :349-361. Efficient, proximity-aware load P2P systems [ J ]. IEEE Tran- Distributed Systems, 2005, 16.
  • 8李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法[J].计算机研究与发展,2006,43(9):1579-1585. 被引量：26
  • 9Stoica I, Morris R, Karger D R, et al. Chord: a scalable peer-to-peer lookup protocol [or internet applications [ J ]. IEEE/ACM Transactions on Networking, 2003,11 ( 1 ) : 17-32.
  • 10Rowstron A, Druschel P. Pastry : scalable, decentralized object location and routing for large-scale peer-to-peer systems [ C]//Proceedings of the 18th IFIP/ACM Inter- national Conference on Distributed Systems Platforms. Heidelberg: Springer-Verlag, 2001:329-350.

二级参考文献18

  • 1Willebeek-Lemair H, Reeves A P. Strategies for dynamic load balancing on highly parallel computers [J]. IEEE Transaction on Parallel and Distributed Systems,1993,4(9) :979 -993.
  • 2Lavi R, Barak A. The home model and competitive algorithms for load balancing in a computing cluster [A].Proceedings of 21 st International Conference on Distributed Computing Systems [ C]. Los Alamitos, California:The Institute of Electrical and Electron
  • 3Maturana F P, Tichy P, Slechta P, et al. Distributed multi-agent architecture for automation systems [J]. Expert Systems with Applications,2004,26(1):49 - 56.
  • 4Wooldridge M, Jennings N R. Intelligent Agents: theory and practice [ J ]. Knowledge Engineering Review, 1994,10(2) :115 - 152.
  • 5S Ratnasamy, P Francis, M Handley, et al. A scalable content-addressable network [C]. SIGCOMM 2001, San Diego, CA,USA, 2001
  • 6I 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
  • 7A 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
  • 8B 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
  • 9D 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
  • 10S 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

共引文献31

同被引文献25

  • 1夏启志,谢高岗,闵应骅,李忠诚.IS-P2P:一种基于索引的结构化P2P网络模型[J].计算机学报,2006,29(4):602-610. 被引量：39
  • 2Hung Chang Hsiao, Hao Liao, Ssu Ta Chen, et al. Load balance with imperfect irgormation in structured peer-to-peer systems [J]. IEEE Transactions on Parallel and Distributed Systems, 2011, 22 (4): 56-61.
  • 3CHEN C, Tsai K C. The server reassignment problem for load balancing in structured P2P systems [J]. IEEE Trans Parallel and Distributed Systems, 2008, 12 (2): 234-246.
  • 4Quadtree index in peer-to-peer networks [J]. VLDB, 2007, 16 (2) : 165-178.
  • 5TANG Yuzhe, ZHOU Shuigeng. LIGHT.. A query- efficient yet low-maintenance indexing scheme over DHTs [J]. IEEE Transactions on Knowledge and Data Engineering, 2010, 22 (8): 345-352.
  • 6Prashant Dewan, Partha Dasgupta. P2P reputation management using distributed identities and decentralized recommendation chains [J]. IEEE Transactions on Knowledge and Data Engineering, 2010, 22 (7): 112-119.
  • 7LI D, CAO J, LU X, et al. Efficient range query processing in peer-to-peer systems EJ]. IEEE Trans Knowledge and Data Eng, 2009, 21 (1): 78-91.
  • 8Gharib M, Barzegar Z, Habibi J. A novel method for supporting locality in peer-to-peer overlays using hypercube topology [C]//Proceeding of the International Conference on Intelligent Systems, Modelling and Simulation. Liverpool: IEEE, 2010: 391-395.
  • 9Pitoura T Replication. Load balancing and efficient range query processing in DHTs [G]. LNCS 3896: Proceedings of the 10th International Conference on Advances in Database Technology, 2006: 131-148.
  • 10Hung-Chang Hsiao,Hao Liao,Ssu — Ta Chen,etc., " Load Bal-ance with Imperfect Information in Structured Peer -to -PeerSystems",Parallel and Distributed Systems [J],IEEE Trans”Vol.22, no.4, pp.634 - 649, Apr 2011.

引证文献3

二级引证文献1

华南理工大学学报（自然科学版）
2011年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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