Energy-Efficient Load Balancing Algorithm for Workflow Scheduling in Cloud Data Centers Using Queuing and Thresholds

Cloud computing is a rapidly growing technology that has been implemented in various fields in recent years, such as business, research, industry, and computing. Cloud computing provides different services over the internet, thus eliminating the need for personalized hardware and other resources. Cloud computing environments face some challenges in terms of resource utilization, energy efficiency, heterogeneous resources, etc. Tasks scheduling and virtual machines (VMs) are used as consolidation techniques in order to tackle these issues. Tasks scheduling has been extensively studied in the literature. The problem has been studied with different parameters and objectives. In this article, we address the problem of energy consumption and efficient resource utilization in virtualized cloud data centers. The proposed algorithm is based on task classification and thresholds for efficient scheduling and better resource utilization. In the first phase, workflow tasks are pre-processed to avoid bottlenecks by placing tasks with more dependencies and long execution times in separate queues. In the next step, tasks are classified based on the intensities of the required resources. Finally, Particle Swarm Optimization (PSO) is used to select the best schedules. Experiments were performed to validate the proposed technique. Comparative results obtained on benchmark datasets are presented. The results show the effectiveness of the proposed algorithm over that of the other algorithms to which it was compared in terms of energy consumption, makespan, and load balancing

A policy-based architecture for virtual network embedding

Network virtualization is a technology that enables multiple virtual instances to coexist on a common physical network infrastructure. This paradigm fostered new business models, allowing infrastructure providers to lease or share their physical resources. Each virtual network is isolated and can be customized to support a new class of customers and applications. To this end, infrastructure providers need to embed virtual networks on their infrastructure. The virtual network embedding is the (NP-hard) problem of matching constrained virtual networks onto a physical network. Heuristics to solve the embedding problem have exploited several policies under different settings. For example, centralized solutions have been devised for small enterprise physical networks, while distributed solutions have been proposed over larger federated wide-area networks. In this thesis we present a policy-based architecture for the virtual network embedding problem. By policy, we mean a variant aspect of any of the three (invariant) embedding mechanisms: physical resource discovery, virtual network mapping, and allocation on the physical infrastructure. Our architecture adapts to different scenarios by instantiating appropriate policies, and has bounds on embedding efficiency, and on convergence embedding time, over a single provider, or across multiple federated providers. The performance of representative novel and existing policy configurations are compared via extensive simulations, and over a prototype implementation. We also present an object model as a foundation for a protocol specification, and we release a testbed to enable users to test their own embedding policies, and to run applications within their virtual networks. The testbed uses a Linux system architecture to reserve virtual node and link capacities

Latency-aware resource orchestration in SDN-based packet over optical flexi-grid transport networks

In the upcoming 5G networks and following the emerging Software Defined Network/Network Function Virtualization (SDN/NFV) paradigm, demanded services will be composed of a number of virtual network functions that may be spread across the whole transport infrastructure and allocated in distributed Data Centers (DCs). These services will impose stringent requirements such as bandwidth and end-to-end latency that the transport network will need to fulfill. In this paper, we present an orchestration system devised to select and allocate virtual resources in distributed DCs connected through a multi-layer (Packet over flexi-grid optical) network. Three different on-line orchestration algorithms are conceived to accommodate the incoming requests by satisfying computing, bandwidth and end-to-end latency constraints, setting up multi-layer connections. We addressed end-to-end latency requirements by considering both network (due to propagation delay) and processing delay components. The proposed algorithms have been extensively evaluated and assessed (via a number of figures of merit) through experimental tests carried out in a Packet over Optical Flexi-Grid Network available in the ADRENALINE testbed with emulated DCs connected to it.This work has been partially funded by the EC H2020 5GTransformer Project (grant No. 761536)

Hypervolume Sen Task Scheduilng and Multi Objective Deep Auto Encoder based Resource Allocation in Cloud

Cloud Computing (CC) environment has restructured the Information Age by empowering on demand dispensing of resources on a pay-per-use base. Resource Scheduling and allocation is an approach of ascertaining schedule on which tasks should be carried out. Owing to the heterogeneity nature of resources, scheduling of resources in CC environment is considered as an intricate task. Allocating best resource for a cloud request remains a complicated task and the issue of identifying the best resource – task pair according to user requirements is considered as an optimization issue. Therefore the main objective of the Cloud Server remains in scheduling the tasks and allocating the resources in an optimal manner. In this work an optimized task scheduled resource allocation model is designed to effectively address  large numbers of task request arriving from cloud users, while maintaining enhanced Quality of Service (QoS). The cloud user task requests are mapped in an optimal manner to cloud resources. The optimization process is carried out using the proposed Multi-objective Auto-encoder Deep Neural Network-based (MA-DNN) method which is a combination of Sen’s Multi-objective functions and Auto-encoder Deep Neural Network model. First tasks scheduling is performed by applying Hypervolume-based Sen’s Multi-objective programming model. With this, multi-objective optimization (i.e., optimization of cost and time during the scheduling of tasks) is performed by means of Hypervolume-based Sen’s Multi-objective programming. Second, Auto-encoder Deep Neural Network-based Resource allocation is performed with the scheduled tasks that in turn allocate the resources by utilizing Jensen–Shannon divergence function. The Jensen–Shannon divergence function has the advantage of minimizing the energy consumption that only with higher divergence results, mapping is performed, therefore improving the energy consumption to a greater extent. Finally, mapping tasks with the corresponding resources using Kronecker Delta function improves the makespan significantly. To show the efficiency of Multi-objective Auto-encoder Deep Neural Network-based (MA-DNN) cloud time scheduling and optimization between tasks and resources in the CC environment, we also perform thorough experiments on the basis of realistic traces derived from Personal Cloud Datasets. The experimental results show that compared with RAA-PI-NSGAII and DRL, MA-DNN not only significantly accelerates the task scheduling efficiency, task scheduling time but also reduces the energy usage and makespan considerably

Multi-provider network service embedding

[no abstract