检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:袁刚[1,2]
机构地区:[1]南京邮电大学宽带无线通信与传感网技术教育部重点实验室,江苏南京210003 [2]南京邮电大学江苏省电信网络融合实验室,江苏南京210003
出 处:《计算机技术与发展》2015年第6期96-100,105,共6页Computer Technology and Development
基 金:国家科技重大专项(2012ZX03001008-003;2011ZX03005-004-03);国家"973"重点基础研究发展计划项目(2013CB329005)
摘 要:现有的动态负载均衡算法通常对服务器上的负载进行监测,然而大多数负载均衡算法不能区分用户请求服务的类别,且对于监控时间间隔之间的负载很难实时获得。针对此种情况,文中提出了一种预测动态负载均衡算法。该算法对用户请求服务进行分类,同时可对每台服务器节点的资源利用率进行实时预测。在实验室搭建的Web服务器集群(WSC)上,对该算法的两种PSDLB模型、WLC以及QSC-LB负载均衡算法在异构环境中安全传输服务、数据库服务、大小文件下载服务的请求失败率、系统响应时间进行了对比测试。结果表明,在高负载情况下该算法优于另外两种算法。The present dynamic load balancing algorithms usually monitor load on servers,however,most of them cannot differentiate the types of the request services and the load between monitoring intervals is so difficult to achieve in real-time. Based on this situation,pres-ent a predictive dynamic load balancing algorithm PSDLB. This algorithm takes the users’ services types into consideration,as well as, the resource utilization of each server node between monitoring intervals can be predicted in real-time. On the Web Server Cluster ( WSC) of the lab,the proposed algorithm’ s two models are compared with WLC algorithm and QSC-LB algorithm in the heterogeneous environment. The content of the comparison is the failed requests rate and the system response time of the four request service types, such as,secure transaction service,database service,small file downloading service and big file downloading service. Results of the experi-ments show that the proposed algorithm is better than the other two algorithms under high system loading condition.
关 键 词:动态负载均衡算法 预测 服务分类 WEB服务器集群
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31