Dynamic Task Migration for Enhanced Load Balancing in Cloud Computing using K-means Clustering and Ant Colony Optimization

Cloud computing efficiently allocates resources, and timely execution of user tasks is pivotal for ensuring seamless service delivery. Central to this endeavour is the dynamic orchestration of task scheduling and migration, which collectively contribute to load balancing within virtual machines (VMs). Load balancing is a cornerstone, empowering clouds to fulfill user requirements promptly. To facilitate the migration of tasks, we propose a novel method that exploits the synergistic potential of K-means clustering and Ant Colony Optimization (ACO). Our approach aims to maximize the cloud ecosystem by improving several critical factors, such as the system's make time, resource utilization efficiency, and workload imbalance mitigation. The core objective of our work revolves around the reduction of makespan, a metric directly tied to the overall system performance. By strategically employing K-means clustering, we effectively group tasks with similar attributes, enabling the identification of prime candidates for migration. Subsequently, the ACO algorithm takes the reins, orchestrating the migration process with an inherent focus on achieving global optimization. The multifaceted benefits of our approach are quantitatively assessed through comprehensive comparisons with established algorithms, namely Round Robin (RR), First-Come-First-Serve (FCFS), Shortest Job First (SJF), and a genetic load balancing algorithm. To facilitate this evaluation, we harness the capabilities of the CloudSim simulation tool, which provides a platform for realistic and accurate performance analysis. Our research enhances cloud computing paradigms by harmonizing task migration with innovative optimization techniques. The proposed approach demonstrates its prowess in harmonizing diverse goals: reducing makespan, elevating resource utilization efficiency, and attenuating the degree of workload imbalance. These outcomes collectively pave the way for a more responsive and dependable cloud infrastructure primed to cater to user needs with heightened efficacy. Our study delves into the intricate domain of cloud-based task scheduling and migration. By synergizing K-means clustering and ACO algorithms, we introduce a dynamic methodology that refines cloud resource management and bolsters the quintessential facet of load balancing. Through rigorous comparisons and meticulous analysis, we underscore the superior attributes of our approach, showcasing its potential to reshape the landscape of cloud computing optimization

Load Balancing and Virtual Machine Allocation in Cloud-based Data Centers

As cloud services see an exponential increase in consumers, the demand for faster processing of data and a reliable delivery of services becomes a pressing concern. This puts a lot of pressure on the cloud-based data centers, where the consumers’ data is stored, processed and serviced. The rising demand for high quality services and the constrained environment, make load balancing within the cloud data centers a vital concern. This project aims to achieve load balancing within the data centers by means of implementing a Virtual Machine allocation policy, based on consensus algorithm technique. The cloud-based data center system, consisting of Virtual Machines has been simulated on CloudSim – a Java based cloud simulator

Adaptive and learning-based formation control of swarm robots

Autonomous aerial and wheeled mobile robots play a major role in tasks such as search and rescue, transportation, monitoring, and inspection. However, these operations are faced with a few open challenges including robust autonomy, and adaptive coordination based on the environment and operating conditions, particularly in swarm robots with limited communication and perception capabilities. Furthermore, the computational complexity increases exponentially with the number of robots in the swarm. This thesis examines two different aspects of the formation control problem. On the one hand, we investigate how formation could be performed by swarm robots with limited communication and perception (e.g., Crazyflie nano quadrotor). On the other hand, we explore human-swarm interaction (HSI) and different shared-control mechanisms between human and swarm robots (e.g., BristleBot) for artistic creation. In particular, we combine bio-inspired (i.e., flocking, foraging) techniques with learning-based control strategies (using artificial neural networks) for adaptive control of multi- robots. We first review how learning-based control and networked dynamical systems can be used to assign distributed and decentralized policies to individual robots such that the desired formation emerges from their collective behavior. We proceed by presenting a novel flocking control for UAV swarm using deep reinforcement learning. We formulate the flocking formation problem as a partially observable Markov decision process (POMDP), and consider a leader-follower configuration, where consensus among all UAVs is used to train a shared control policy, and each UAV performs actions based on the local information it collects. In addition, to avoid collision among UAVs and guarantee flocking and navigation, a reward function is added with the global flocking maintenance, mutual reward, and a collision penalty. We adapt deep deterministic policy gradient (DDPG) with centralized training and decentralized execution to obtain the flocking control policy using actor-critic networks and a global state space matrix. In the context of swarm robotics in arts, we investigate how the formation paradigm can serve as an interaction modality for artists to aesthetically utilize swarms. In particular, we explore particle swarm optimization (PSO) and random walk to control the communication between a team of robots with swarming behavior for musical creation

Operation and planning of distribution networks with integration of renewable distributed generators considering uncertainties: a review

YesDistributed generators (DGs) are a reliable solution to supply economic and reliable electricity to customers. It is the last stage in delivery of electric power which can be defined as an electric power source connected directly to the distribution network or on the customer site. It is necessary to allocate DGs optimally (size, placement and the type) to obtain commercial, technical, environmental and regulatory advantages of power systems. In this context, a comprehensive literature review of uncertainty modeling methods used for modeling uncertain parameters related to renewable DGs as well as methodologies used for the planning and operation of DGs integration into distribution network.This work was supported in part by the SITARA project funded by the British Council and the Department for Business, Innovation and Skills, UK and in part by the University of Bradford, UK under the CCIP grant 66052/000000

A Review on Computational Intelligence Techniques in Cloud and Edge Computing

Cloud computing (CC) is a centralized computing paradigm that accumulates resources centrally and provides these resources to users through Internet. Although CC holds a large number of resources, it may not be acceptable by real-time mobile applications, as it is usually far away from users geographically. On the other hand, edge computing (EC), which distributes resources to the network edge, enjoys increasing popularity in the applications with low-latency and high-reliability requirements. EC provides resources in a decentralized manner, which can respond to users’ requirements faster than the normal CC, but with limited computing capacities. As both CC and EC are resource-sensitive, several big issues arise, such as how to conduct job scheduling, resource allocation, and task offloading, which significantly influence the performance of the whole system. To tackle these issues, many optimization problems have been formulated. These optimization problems usually have complex properties, such as non-convexity and NP-hardness, which may not be addressed by the traditional convex optimization-based solutions. Computational intelligence (CI), consisting of a set of nature-inspired computational approaches, recently exhibits great potential in addressing these optimization problems in CC and EC. This article provides an overview of research problems in CC and EC and recent progresses in addressing them with the help of CI techniques. Informative discussions and future research trends are also presented, with the aim of offering insights to the readers and motivating new research directions

Synergy between biology and systems resilience

Resilient systems have the ability to endure and successfully recover from disturbances by identifying problems and mobilizing the available resources to cope with the disturbance. Resiliency lets a system recover from disruptions, variations, and a degradation of expected working conditions. Biological systems are resilient. Immune systems are highly adaptive and scalable, with the ability to cope with multiple data sources, fuse information together, makes decisions, have multiple interacting agents, operate in a distributed manner over a multiple scales, and have a memory structure to facilitate learning. Ecosystems are resilient since they have the capacity to absorb disturbance and are able to tolerate the disturbances. Ants build colonies that are dispersed, modular, fine grained, and standardized in design, yet they manage to forage intelligently for food and also organize collective defenses by the property of resilience. Are there any rules that we can identify to explain the resilience in these systems? The answer is yes. In insect colonies, rules determine the division of labor and how individual insects act towards each other and respond to different environmental possibilities. It is possible to group these rules based on attributes. These attributes are distributability, redundancy, adaptability, flexibility, interoperability, and diversity. It is also possible to incorporate these rules into engineering systems in their design to make them resilient. It is also possible to develop a qualitative model to generate resilience heuristics for engineering system based on a given attribute. The rules seen in nature and those of an engineering system are integrated to incorporate the desired characteristics for system resilience. The qualitative model for systems resilience will be able to generate system resilience heuristics. This model is simple and it can be applied to any system by using attribute based heuristics that are domain dependent. It also provides basic foundation for building computational models for designing resilient system architectures. This model was tested on recent catastrophes like the Mumbai terror attack and hurricane Katrina. With the disturbances surrounding the current world this resilience model based on heuristics will help a system to deal with crisis and still function in the best way possible by depending mainly on internal variables within the system --Abstract, page iii

2010 Conference Abstracts: Annual Undergraduate Research Conference at the Interface of Biology and Mathematics

Abstract book for the Second Annual Undergraduate Research Conference at the Interface of Biology and Mathematics Date: November 19 - 20, 2010Plenary speaker: Abdul-Aziz Yakubu, Professor and Chair of the Department of Mathematics, Howard UniversityFeatured speaker: Jory Weintraub, Assistant Director Education and Outreach, National Evolutionary Synthesis Cente

A Survey on Load Balancing Algorithms for VM Placement in Cloud Computing

The emergence of cloud computing based on virtualization technologies brings huge opportunities to host virtual resource at low cost without the need of owning any infrastructure. Virtualization technologies enable users to acquire, configure and be charged on pay-per-use basis. However, Cloud data centers mostly comprise heterogeneous commodity servers hosting multiple virtual machines (VMs) with potential various specifications and fluctuating resource usages, which may cause imbalanced resource utilization within servers that may lead to performance degradation and service level agreements (SLAs) violations. To achieve efficient scheduling, these challenges should be addressed and solved by using load balancing strategies, which have been proved to be NP-hard problem. From multiple perspectives, this work identifies the challenges and analyzes existing algorithms for allocating VMs to PMs in infrastructure Clouds, especially focuses on load balancing. A detailed classification targeting load balancing algorithms for VM placement in cloud data centers is investigated and the surveyed algorithms are classified according to the classification. The goal of this paper is to provide a comprehensive and comparative understanding of existing literature and aid researchers by providing an insight for potential future enhancements.Comment: 22 Pages, 4 Figures, 4 Tables, in pres