期刊文献+

基于消息的加权负载均衡算法 被引量:4

Message-oriented load balancing algorithm
下载PDF
导出
摘要 在研究EAP协议与Diameter协议的基础上,为解决分布式认证系统节点间会话一致性的问题,以及尽可能减少服务节点数量改变时产生的会话迁移数量,提出了一种基于消息的加权负载均衡算法(MOLB)。该算法使用散列法、虚拟节点和红黑树相结合的技术,实现了客户端请求在服务节点间的合理分布。Diameter网络环境中的实验结果表明:与其他常用的负载均衡算法相比,本文算法具有较小的负载均衡度和会话破坏度以及较低的会话破坏分布度。 Based on the study of extensible authentication protocol(EAP) and Diameter protocol,a message-oriented load balancing(MOLB) algorithm was proposed.This algorithm can maintain the consistency of session between nodes in distributed authentication system and reduce the number of migration sessions when service nodes are varied.In this algorithm hash method,virtual nodes and red-black tree are combined to achieve a rational distribution of requests between service nodes.In the Diameter network environment,the experiment results show that compared with other commonly load balancing algorithms,MOLB algorithm has smaller load balancing degree,smaller session destruction degree and lower session destruction distribution degree.
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2012年第1期140-144,共5页 Journal of Jilin University:Engineering and Technology Edition
基金 国家发展改革委员会项目(CNGI2008-023) 国家科技支撑计划项目(2008BAH37B05023) 吉林省科技发展计划项目(20080702)
关键词 计算机应用 DIAMETER协议 负载均衡 虚拟节点 computer application Diameter protocol load balancing virtual node
  • 相关文献

参考文献9

  • 1Edith Cohen. Proactive caching of DNS records: ad- dressing a performance bottleneck[C] // Applications and the Internet, 2001: 85-94.
  • 2IETF. DNS Support for load balancing[S/OL]. [-2010-10-09]. http://tools, ietf. org/html/rfcl794.
  • 3Kargerl D, Lehman E, Leighton F, et al. Consist- ent hashing and random trees., distributed caching protocols for relieving hot spots on the World Wide Web[C]//The 29th Annual ACM Syrup on Theory of Computing,E1 Paso, 1997; 654-663.
  • 4Godfrey B, Lakshminarayanan K, Surana S. Load balancing in dynamic structured P2P systems[C]/,/ The Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, 2004:2253-2262.
  • 5Latze C. Roaming, accounting and seamless han- dover in EAP-TLS authenticated networks [C] // Software, Telecommunications and Computer Net- works, 2008.
  • 6Wu W T. Design and implementation of WIRE Di- ameter[C] ffThe 3rd International Conference on In- formation Technology: Research and Education, 2005 : 428-433.
  • 7Knuth Donald E. Sorting and Searching trees[M]// The Art of Computer Programming, New Tersey: Addison-wesley Professional, 1973.
  • 8Xie Nan-bin, Huang Xiang-dan. The mixed encryption algorithm based on [D] and XOR transforma- tion[C] // Education Technology and Computer Sci- ence (ETCS), 2010:394-396.
  • 9Hi W G, MacGregor M H, Gburzynski P. I.oad balancing for parallel forwarding[J]. IEEE/ACM Trans on Networking, 2005,13(4) : 790-801.

同被引文献30

引证文献4

二级引证文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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