云计算环境下的DPSO资源负载均衡算法

负载均衡问题是云计算研究的热点问题之一。运用离散粒子群算法对云计算环境下的负载均衡问题进行研究,根据云计算环境下资源需求动态变化,并且对资源节点服务器的要求较低的特点,把各个资源节点当做网络拓扑结构中的各个节点,建立相应的资源-任务分配模型,运用离散粒子群算法实现资源负载均衡。验证表明,该算法提高了资源利用率和云计算资源的负载均衡。     

Energy-efficient sender-initiated threshold-based load balancing (e-STLB) in cloud computing environment

Cloud computing has transformed service delivery through its pay-per-use model, supporting diverse users with multiple heterogeneous Virtual Machines (VMs). However, energy consumption has emerged as a critical concern, necessitating cloud resource optimization for environment-friendly practices. This research paper presents an innovative energy-efficient threshold-based sender-initiated load-balancing strategy (e-STLB) to address this concern. The approach employs threshold values to trigger task migration between VMs, ensuring optimal performance while maximizing energy efficiency. The proposed strategy significantly reduces Makespan and increases Resource Utilization in an energy-conscious manner. Experimental evaluations using Cloudsim 3.0 demonstrate that the e-STLB outperforms other state-of-the-art solutions, offering a compelling approach to sustainable cloud computing.     

云环境下机群弹性负载均衡机制

为克服传统刚性负载均衡机制不能适应多变的网络环境的缺陷,解决云环境下已有负载均衡机制存在不能充分利用弹性机制,且服务质量(QoS)不稳定的问题,提出一种基于绿色计算资源池策略的云环境弹性负载均衡机制,根据系统资源利用率对负载进行量化,量化结果决定资源池虚拟机的分配,最后结合虚拟机的使用情况,回收资源,提高资源的利用率。实验结果显示在该负载均衡机制下,响应时间稳定在2.5s左右,整体服务质量有明显提高,降低了电能消耗,验证了该机制的有效性。     

SLA-RALBA: cost-efficient and resource-aware load balancing algorithm for cloud computing

The Journal of Supercomputing - Recently, Service-level agreement (SLA) is deemed to be an integral aspect for on-demand provisioning of scalable resources on Cloud. SLA defines important...     

面向云环境的Flink负载均衡策略

作为新一代的大数据计算引擎,Flink得到了广泛应用。Flink在云环境下进行容器化部署时,其默认任务调度算法不能感知节点的资源信息,导致即时调整负载和自主均衡能力较差,而主流的容器编排工具虽然提供了管理容器的可能性,却也未能结合Flink特点解决平衡资源利用的同时降低容器组内的通信开销问题。针对以上问题开展研究,提出了一种面向云环境的Flink负载均衡策略FLBS,综合考虑了Flink集群中算子的分布特点和容器间通信机制,以节点间通信开销和均衡负载作为评估标准。实验结果表明,与Flink默认调度策略相比,FLBS能够有效提高计算效率,提升系统性能。     

A dynamic VM consolidation approach based on load balancing using Pearson correlation in cloud computing

The Journal of Supercomputing - In recent years, cloud data centers are rapidly growing with a large number of finite heterogeneous resources to meet the ever-growing user demands with respect to...     

A hybrid load balancing policy underlying grid computing environment

In recent years, network bandwidth and quality has been drastically improved, even much faster than the enhancement of computer performance. The various communication and computing tasks in the fields such as telecommunication, multimedia, information technology, and construction simulation, can be integrated and applied in a distributed computing environment nowadays. However, as the demands of many researches for computing resources gradually grow, Grid Computing integrated with a distributed computing environment and the Internet (network) has gained more attention. The so-called Grid Computing is to utilize the idle computing resources (nodes) on the network to facilitate the execution of complicated tasks that require large-scale computing. In other words, the composition of Grid resources is dynamic and varies with time. Thus, when selecting nodes for executing a task, the dynamic of the nodes in the Grid must be considered, and to exploit the effectiveness of the resources, they have to be properly selected according to the properties of the task. This study proposed a hybrid load balancing policy which integrated static and dynamic load balancing technologies to assist in the selection for effective nodes. In addition, if any selected node can no longer provide resources, it can be promptly identified and replaced with a substitutive node to maintain the execution performance and the load balancing of the system.     

LATOC: an enhanced load balancing algorithm based on hybrid AHP-TOPSIS and OPSO algorithms in cloud computing

Providing required level of service quality in cloud computing is one of the most significant cloud computing challenges because of software and hardware complexities, different features of tasks and computing resources and also, lack of appropriate distribution of tasks in cloud computing environments. The recent research in this field show that lack of smart prioritization and ordering of tasks in scheduling (as an NP-hard problem) has been very effective and resulted in lack of load balancing, response time increase, total execution time increase and also, average resource use decrease. In line with this, the proposed method of this research called LATOC considered first the key criteria of an input task like required processing unit, data length of task and execution time. Then, it addressed task prioritization in separate queues using the technique for order preference by similarity to ideal solution (TOPSIS) and analytic hierarchy process (AHP) in figure of a hybrid intelligent algorithm (AHP-TOPSIS). Each ordered task in separate priority queues was placed based on its priority level, and then, to assign each task from each priority queue to virtual machines, optimized particle swarm optimization was used. Many simulations based on various scenarios in Cloudsim simulator show that smart assignment of prioritized tasks by LATOC resulted in improvement of important cloud computing parameters such as total execution time and average resource use comparing similar methods.

     

A self‐organized load balancing mechanism for cloud computing

The growth in computer and networking technologies over the past decades established cloud computing as a new paradigm in information technology. The cloud computing promises to deliver cost‐effective services by running workloads in a large scale data center consisting of thousands of virtualized servers. The main challenge with a cloud platform is its unpredictable performance. A possible solution to this challenge could be load balancing mechanism that aims to distribute the workload across the servers of the data center effectively. In this paper, we present a distributed and scalable load balancing mechanism for cloud computing using game theory. The mechanism is self‐organized and depends only on the local information for the load balancing. We proved that our mechanism converges and its inefficiency is bounded. Simulation results show that the generated placement of workload on servers provides an efficient, scalable, and reliable load balancing scheme for the cloud data center. Copyright © 2016 John Wiley & Sons, Ltd.     

Honey bee behavior inspired load balancing of tasks in cloud computing environments

Scheduling of tasks in cloud computing is an NP-hard optimization problem. Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing (HBB-LB), which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue.     

云计算环境中基于朴素贝叶斯算法的负载均衡技术

针对云计算环境中任务调度算法复杂度高、任务分配不够合理等问题,提出一种基于朴素贝叶斯分类的负载均衡技术。该技术利用云计算环境的心跳机制全面地收集各节点负载信息,并采用朴素贝叶斯算法对各节点负载状态进行分类;然后,根据节点状态分类结果,实现任务和资源分配的合理调度。实验结果表明,基于朴素贝叶斯算法的负载均衡技术能提高任务的分配效率,避免任务在各节点间频繁迁移,快速有效地实现云计算环境中各节点间的负载均衡。     

云计算下负载均衡的多维QoS约束任务调度机制

高效的任务调度机制能够更好地满足用户的QoS需求,实现各物理主机间的负载均衡,从而提高云计算环境的整体性能。而传统的任务调度往往只考虑任务的响应时间或安全性等,且负载均衡策略是静态的。根据云计算的弹性化和虚拟化等新特性,综合考虑任务的性能QoS和信任QoS,提出一种在云计算环境下的任务调度机制,采用虚拟机迁移技术实现动态负载均衡。通过在CloudSim2.1仿真环境下的分析和比较,该任务调度机制不但可以提高用户满意度,而且可以有效实现负载均衡。     

改进粒子群算法在云计算负载均衡中的应用研究

云计算系统采用虚拟化技术可以更加灵活和高效地分配运算资源,便于管理员根据用户任务需求按需分配云计算资源。但虚拟化后的云计算中心存在种类多样、数量庞大的虚拟机资源,难以将虚拟机合理地放置到物理主机集群上并达到较好的负载均衡。为此,给出了云计算中心虚拟机放置到物理主机的负载均衡模型,采用改进后的粒子群算法（PSO）来求解最优解。最后通过和常用虚拟机放置算法的仿真对比实验,验证了所提云计算负载均衡优化算法的有效性。     

Auto-scalable and fault-tolerant load balancing mechanism for cloud computing based on the proof-of-work election

Load balancing mechanism in technologies such as cloud computing has provided a huge oppor-tunity for the development of large-scale projects.Although the conve...     

A CSO-based approach for secure data replication in cloud computing environment

The Journal of Supercomputing - Cloud computing has a significant impact on information technology solutions for both organizations and researchers. Different users share critical data over the...     

云计算环境下基于蜜蜂觅食行为的任务负载均衡算法

针对云计算环境下的任务调度程序通常需要较多响应时间和通信成本的问题,提出了一种基于蜜蜂行为的负载均衡(HBB-LB)算法。首先,利用虚拟机(VM)进行负载平衡来最大化吞吐量;然后,对机器上任务的优先级进行平衡;最后,将平衡重点放在减少VM等待序列中任务的等待时间上,从而提高处理过程的整体吞吐量和优先级。利用CloudSim工具模拟云计算环境进行仿真实验,结果表明,相比粒子群优化(PSO)、蚁群算法(ACO)、动态负载均衡(DLB)、先入先出(FIFO)和加权轮询(WRR)算法, HBB-LB算法的平均响应时间分别节省了5%、13%、17%、67%、37%,最大完成时间分别节省了20%、23%、18%、55%、46%,可以更好地平衡非抢占式独立任务,适用于异构云计算系统。     

Time efficient secure DNA based access control model for cloud computing environment

The uses of Big Data (BD) are gradually increasing in many new emerging applications, such as Facebook, eBay, Snapdeal, etc. BD is a term, which is used for describing a large volume of data. The data security is always a big concern of BD. Besides the data security, other issues of BD are data storage, high data accessing time, high data searching time, high system overhead, server demand, etc. In this paper, a new access control model has been proposed for BD to solve all these issues, where fast accessing of the large volume of data are provided based on the data size Here, a long 512-bit Deoxyribonucleic Acid (DNA) based key sequence has been used for improving the data security, and it is secured against the collision attack, man-in-the-middle attack, internal attack, etc. The proposed scheme is evaluated in terms of both theoretical and experimental results, which show the proficiency of the proposed scheme over the existing schemes.     

On load balancing for distributed multiagent computing

Multiagent computing on a cluster of workstations is widely envisioned to be a powerful paradigm for building useful distributed applications. The agents of the system span across all the machines of a cluster. Just like the case of traditional distributed systems, load balancing becomes an area of concern. With different characteristics between ordinary processes and agents, it is both interesting and useful to investigate whether conventional load-balancing strategies are also applicable and sufficient to cope with the newly emerging needs, such as coping with temporally continuous agents, devising a performance metric for multiagent systems, and taking into account the vast amount of communication and interaction among agent. This paper discusses the above issues with reference to agent properties and load balancing techniques and outlines the space of load-balancing design choices in the arena of multiagent computing. In view of the special agent characteristics, a novel communication-based load-balancing algorithm is proposed, implemented, and evaluated. The proposed algorithm works by associating a credit value with each agent. The credit of an agent depends on its affinity to a machine, its current workload, its communication behavior, and mobility, etc. When a load imbalance occurs, the credits of all agents are examined and an agent with a lower credit value is migrated to relatively lightly loaded machine in the system. Quasi-simulated experiments of this algorithm show load-balancing improvement compared with conventional workload-oriented load-balancing schemes.