一种改进的Linux集群系统负载均衡算法

提出一种基于改进的Linux集群系统负载均衡算法.首先通过修改负载权值计算指标,然后通过动态反馈机制收集各个各服务器的实时负载,负载均衡器根据收集的负载信息动态调整服务器权值,最后根据权值选择最优服务器去处理新的任务.仿真测试结果表明,改进负载均衡算法提高了整个系统的响应能力和吞吐量,较大幅度地提高系统的综合性能.     

嵌入式Web服务器负载均衡算法的研究与实现

结合嵌入式Web技术的发展以及B/S结构的广泛应用,提出了一种基于服务器集群的访问请求优先级的最少连接数的解决方案,重点解决了嵌入式Web访问的负载均衡及单点故障问题,论述了以排队论为模型的负载均衡算法,并给出了实现方案。实验结果表明,该算法有效提高了嵌入式Web服务器的多发处理能力,提高了嵌入式系统的可靠性。     

基于剩余负载率的动态负载均衡研究

为进一步提高集群系统服务的性能,在对静态负载均衡和动态负载均衡的优缺点分析的基础上,提出一种基于剩余负载率的动态均衡机制.该均衡机制采用剩余负载率作为负载状态的评价标准;针对服务器各节点性能的不同,提出采用BP神经网络训练节点;并设计了一种基于流表的静态分配策略和基于负载预测的动态分配策略相结合的任务分配策略来实现任务在集群系统各节点间的动态分配,从而降低了服务器各节点之问任务重新调度的次数,提高了集群系统的服务性能.实验结果表明,该均衡机制是可行的、有效的.     

基于动态反馈机制的服务器负载均衡算法研究

针对当前已有负载均衡算法无法准确反映服务器负载的大小和手动设置服务器权值比较固定等方面所存在的不足,提出了一种基于动态反馈机制的服务器负载均衡算法。本算法综合考虑服务器各种性能因素,并根据当前负载动态调整权值,再依据算法调整服务器负载,使得服务器实现负载均衡。通过使用OPNET仿真软件证明该算法相对于传统算法能够减少服务器延迟,提高平均响应速率,并且有效地平衡了集群中服务器的负载。     

一种面向多类型服务的动态负载均衡算法

针对航空物流ILink数据平台交易复杂性高、服务种类多、业务规模大等特点,提出一种面向多类型服务的动态负载均衡算法。通过分析四种基本服务类型以及实时采集四种服务类型的资源消耗,根据用户服务请求类型的不同动态调整各服务器的负载,引入了过载服务器节点缓冲机制缓冲负载过重节点,有效解决了航空物流ILink数据平台可能出现的用户等待时间过长、局部负载过重、甚至个别服务器节点崩溃的问题,达到了集群的负载均衡。仿真实验结果表明,提出的算法在系统吞吐量、系统响应时间、负载率等关键指标上优于经典的比率算法和遗传算法。     

社会属性感知的边缘计算任务调度策略

边缘计算服务器的负载不均衡将严重影响服务能力,该文提出一种适用于边缘计算场景的任务调度策略(RQ-AIP)。首先,根据服务器的负载分布情况衡量整个网络的负载均衡度,结合强化学习方法为任务匹配合适的边缘服务器,以满足传感器节点任务的资源差异化需求;进而,构造任务时延和终端发射功率的映射关系来满足物理域的约束,结合终端用户社会属性,为任务不断地选择合适的中继终端,通过终端辅助调度的方式实现网络的负载均衡。仿真结果表明,所提出的策略与其他负载均衡策略相比能有效地缓解边缘服务器之间的负载和核心网的流量,降低任务处理时延。     

基于DHCP服务器状态的动态负载均衡算法

负载均衡是DOCSIS/PacketCable网络环境中DHCP服务集群亟待解决的问题,负载均衡算法是给集群中各服务器分配任务的核心,本文提出了一种根据服务器状态来分配任务的算法,给出了服务器性能、负载量、权值及服务器状态的计算。算法引入了根据随机数和服务器的状态选择服务器的方法,在考虑服务器真实负载,处理能力的基础上,尽量简化负载均衡器的任务分配算法。测试结果显示该算法优于基于实时性能动态反馈的负载均衡算法。     

基于LVS的动态反馈负载均衡的分析与研究

在Linux内核中实现负载均衡调度算法都是静态的,没有动态调节机制。这里在介绍LVS集群原理和已有方法的基础上,提出一种实时获取真实服务器的性能数据、计算和评估真实服务器负载,并动态地调节服务器权值的方法。经测试,使用该方法能够达到良好的负载均衡效果,进而能有效地提高集群的性能。     

云环境下一种基于任务类型匹配的负载均衡策略研究

针对云计算环境下大量并行计算节点容易产生计算节点之间的负载不均问题,本文提出了一种基于任务类型匹配的负载均衡方案。该方案针对任务集中的多种不同长度的子任务类型情况进行判定,并对当前主流的Max-Min和Min-Min两种启发式负载均衡算法进行分析,综合其优缺点,并针对任务集的类型采用不同的算法进行任务调度。实验结果表明在该负载均衡的策略下,提出的方案具有比单一应用Max-Min或者Min-Min算法具有更好的负载均衡特性和更短的完成时间。     

一种基于改进遗传算法的动静态负载均衡算法

针对目前负载均衡算法在低负载情况下影响系统效率及在高负载情况下分配效率不佳等问题，基于Nginx服务器，文中提出了一种在改进遗传算法基础上动静态结合的负载均衡算法。该算法选择使用CPU性能、内存性能、磁盘I/O和网络带宽等服务器性能参数作为服务器节点性能评价指标及低负载下的静态加权轮询算法权值，并基于该指标根据节点性能使用率所占集群平均负载使用率的变化，设计了在高负载情况下的动态负载均衡算法。通过引入操作转换阈值及动态三角函数操作概率的改进遗传算法，实现了静态算法优势区转变为动态算法优势区的阈值计算。通过设计对比实验，证明了文中算法在实验环境下相比于加权轮询算法、概率择优算法和dnfs＿conn算法更具有较好的负载均衡效果，相比于dnfs＿conn算法在平均响应时间和实际并发连接数等数值上具有15%左右的提升。     

Research on scheduling method based on traffic matrix for IoT security

With the increasing number of sensors in the Internet of Things (IoT), network nodes are prone to load imbalance, which seriously affects the reliability and scalability of the IoT. In this paper, a method of load balancing is proposed to reduce the pressure of switches in IoT and improve the efficiency of switch. The method is based on software defined network (SDN) technology using dynamic traffic scheduling of server cluster (DTSSC) model. It obtains the traffic and load matrices for each server and achieves load balancing on each of them. This method has high efficiency and low overhead and is easy to deploy. The validity of this method is verified through experiments; ie, the load ratio of each server is balanced.     

Estimation‐Based Load‐Balancing with Admission Control for Cluster Web Servers

The growth of the World Wide Web and web‐based applications is creating demand for high performance web servers to offer better throughput and shorter user‐perceived latency. This demand leads to widely used cluster‐based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database‐driven workloads. We propose an estimation‐based load balancing algorithm with admission control for cluster‐based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.     

An Efficient Gaming User Oriented Load Balancing Scheme for MMORPGs

Massively multi-player online role-playing games (MMORPGs) follows a client-server model that has the numerous gaming users with many interactions at the same virtual world, massive loading that result in delays, resource shortages, and other such problems occur. Also, faced with high resource demand variability and with misfit resource renting policies, the current practices is to overprovision for each game tens of owned data. Existing load balancing schemes for distributed virtual environments and multiplayer games try to balance the workload among servers by transferring some workload of an overloaded server to other servers. While load balancing algorithms can minimize the average response time of the system, they may also result in frequent client migrations, which may damage the interactivity of an online games. To solve this, many developers devote research to load-balancing servers, yet due to steady and dynamic map divisions, such research is unreliable. Many developers propose algorithms to distribute the load on the server nodes, but the load is usually defined as the number of players on each server, what is not an ideal results. So, we propose a gaming user-oriented load balancing scheme for the load balancing of MMORPGs servers in this paper. This scheme shows effectiveness at dealing with hot-spots and other gatherings of gaming users at specific servers compared to previous methods.     

Cache虚拟服务器集群中IP负载均衡技术研究

网络Cache系统可以大大地减少网络流量、降低响应延时以及服务器的负载，通过虚拟服务器构造Cache服务器集群对外提供缓存服务，具有很好的可用性和可扩展性，其中最关键的技术是如何实现各个服务器之间的负载均衡。本文讲述了IP负载均衡技术及如何基于LVS构造高效率Cache服务器集群，最后对虚拟服务器的应用前景进行了展望。     

一种基于分布式服务器集群的可扩展负载均衡策略技术

提出了一种基于软件定义网络的分布式数据库负载均衡算法,将数据、控制、应用分离的同时计算服务器集群中单个服务器的实际负载.通过查询流量采样记录来决策最少连接的服务器路径,减少了访问请求的响应时间,提高了系统吞吐量和容错能力,实现了充分利用服务器资源的目的.内网中的分布式数据库实验对通用负载均衡技术和基于软件定义网络的负载均衡技术进行了比较,在不同服务器集群的负载状态下,后者的平均响应时间小于前者,并得到了更好的负载均衡效果.     

基于内容的分布式web服务器负载平衡算法

通过分析服务器对静态内容和动态内容处理过程的不同,在给出分布式网络服务器系统结构模型的基础上,提出了一个新的将静、动态内容分配都考虑在内的周期更新动态负载分配算法;通过将其加载在所建立的仿真平台上进行测试得到的最终结果可以看出,所给的负载平衡算法能有效的使系统达到并且保持负载平衡.     

Data Allocation and Dynamic Load Balancing for Distributed Video Storage Server

In this paper, a novel initial videos allocation scheme and a dynamic load balancing strategy are proposed for a distributed video storage server in order to increase the availability and reduce operation cost. The initial allocation scheme determines the allocation of video replicas on the servers to achieve static load balance and to obtain a configuration for efficient dynamic load adjustment. From the simulation results, the proposed load shifting algorithm can reduce up to 50% request fail rate if compared with the same initialization algorithm without load shifting. The proposed initial allocation with load shifting also reduces 25% to 60% request fail rate from the least load first initial allocation scheme with load shifting, 5% to 10% request fail rate and 5% to 25% the number of shifting steps from the DASD dancing method. Moreover, a prototype is implemented on Windows NT to examine the correctness and practicability of the proposed schemes.     

The Mathematical Theory of Dynamic Load Balancing in Cellular Networks

While many interesting dynamic load balancing schemes have been proposed for efficient use of limited bandwidth and to increase the capacity of congested or hot spots (or cells) in wireless networks, to date, a comprehensive mathematical framework which encompasses all of these schemes does not exist. In this paper, we provide a unified mathematical framework for dynamic load balancing, which leads to closed-form performance expressions for evaluating the performance of some of the most important dynamic load balancing strategies proposed in the literature. To the best of our knowledge, this is the first generic theoretical framework that can be used to evaluate the performance of many different dynamic load balancing schemes with simple closed-form results. The accuracy of the results predicted by these analytical expressions derived from the theoretical framework is checked by comparing these results with simulation results provided in the literature for well-known schemes.