面向异构网络的动态负载均衡算法及其收敛性分析  

A Diffusion-based Dynamic Load Balancing Algorithm for Heterogeneous Networks and Its Convergence Analysis

作　　者：张浩军[1,2] 朱艳琴[1,2] 纪其进[1,2] 

机构地区：[1]苏州大学计算机科学与技术学院,苏州215006 [2]江苏省计算机信息处理技术重点实验室,苏州215006

出　　处：《电子与信息学报》2013年第9期2247-2253,共7页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(61070170);东南大学计算机网络和信息集成教育部重点实验室开放研究基金;苏州市应用基础研究计划项目(SYG201238)资助课题

摘　　要：资源共享是分布式计算的核心问题,平衡负载是实现资源共享的基本手段。现有的负载均衡算法多局限于同构网络,伴随计算终端多元化的发展趋势,面向异构网络的负载均衡需求也不断增加。该文基于经典的扩散算法,提出一种适用于异构网络环境的新的动态负载均衡算法,并通过严格的数学方法证明了算法中各结点可收敛于平衡点。实验结果表明,该算法的收敛性能优于Rotaru等人(2004)提出的GDA算法,并且对于网状网络、星型网络和花环网络等经典结构都有良好的收敛性,即便在随机生成的网络结构中,仍然保持了较快的收敛速度。Resource sharing is one of the key issues of distributed computing, and load balancing is the fundamental approach to sharing scarce resource in a distributed computing system. However, the existing load balancing methods are mostly confined to the homogeneous networks. With the diversity of the computing terminals, there is increasing requirement for the study of load balancing toward the heterogeneous networks. In this paper, a diffusion-based dynamic load balancing algorithm is proposed for the heterogeneous networks and it is proved with mathematical strictness that all nodes will converge to the excepted balanced point. The numerical results show that the algorithm is better than the GDA algorithm proposed by Rotaru et al. （2004） and has ideal convergence property over many network topologies including Mesh, Star and Tours etc. And it converges rather fast even in a randomly generated network.

关 键 词：分布式计算 异构网络 动态负载均衡 收敛性分析 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]