An Energy-Aware Service Management Algorithm for Vehicular Cloud Computing

Multi objective trust aware task scheduling algorithm in cloud computing using whale optimization

Cloud computing has been considered the most reliable and safe technology among many cloud users. Virtual machine migration is a crucial component of cloud computing technology. A Virtual machine is transferred from one host machine to another during the migration process, which is accomplished by repeatedly copying the memory pages available in the virtual disk. The time required for the movement of secondary storage, main memory, process states, and network connectivity, as well as the maintenance of their accuracy, must be considered for the efficient migration of virtual machines from one physical host to another in the cloud service provider. The most robust mechanism for system maintenance, resilience system, balancing the load of the service provider, and power-saving is the live migration of virtual machines between the nodes in the data center. So many services are running in the virtual machines during live migration; thus, it needs to take place with the least amount of downtime possible to prevent service degradation. The memory pages in the virtual storage must be copied to the other host using the least frequently used service-based pre-copy algorithm to optimize the downtime. The effectiveness of the suggested solution was evaluated in comparison to OpenNebula and OpenStack, two cloud computing platforms. The least frequently used service-based pre-copy algorithm reduces the amount of virtual machine downtime during live migration.

Cloud Computing has become the most popular distributed computing environment because it does not require any user level management and controlling on the low-level implementation of the system. However, efficient resource provisioning is a key challenge for cloud computing and resolving such kind of problem can reduce under or over utilization of resources, increase user satisfaction by serving more users during peak hours, reduce implementation cost for providers and service cost for users. Existing works on cloud computing focuses to accurate estimation of the capacity needs, static or dynamic VM (Virtual Machine) creation and scheduling. But significant amount of time is required to create and destroy VMs which could be used to serve more user requests. In this paper, an adaptive QoS (Quality of Service) aware VM provisioning mechanism is developed that ensures efficient utilization of the system resources. The VM for similar type of requests has been recycled so that the VM creation time can be minimized and used to serve more user requests. In the proposed model, QoS is ensured by serving all the tasks within the requirements described in SLA. Tasks are separated using multilevel queue and the most urgent task is given high priority. The simulation-based experimental results shows that a great number of tasks can be served compared to others which will help to satisfy customers during the peak hour.

Cloud Computing is known as a provider of dynamic services. It utilizes a very large, scalable and virtualized resource over the Internet. So many industries have joined this bandwagon nowadays. One of the major research issues is to maintain good Quality of Service (QoS) of a Cloud Service Provider (CSP). The QoS encompasses different parameters, like, smart job allocation strategy, efficient load balancing, response time optimization, reduction in wastage of bandwidth, accountability of the overall system, etc. The efficient allocation strategy of the independent computational jobs among different Virtual Machines (VM) in a Datacenter (DC) is a distinguishable challenge in the Cloud Computing domain and finding out an optimal job allocation strategy guided by a good scheduling heuristic for such an environment is an NP-complete problem. So different heuristic approaches may be used for better result. The related works with other NP- complete problems have shown that solutions guided by heuristic approaches can often be improved by applying local scheduling procedure for allocating independent jobs in the virtual machines (VM) inside a Datacenter (DC), which, when combined with fast construction heuristics, can find out the shorter schedules on benchmark problems than the other solution methodologies found in different literatures, and in significant less time. This paper highlights a smart job allocation strategy for a CSP by applying Round-Robin (RR) scheduling policy.

Virtual Machine (VM) placement is considered as one of the crucial problems in Cloud Computing environments. From the perspective of Cloud Service Providers (CSPs), finding the optimal VM placement strategy is often related to optimal resource utilization, revenue maximization, and energy efficiency. However, to ensure the continuity of customer services, CSPs should also consider the reliability of deployed applications when placing VMs on their infrastructures. Existing research in this area either do not focus on the Cloud reliability evaluation aspect or do not account for the trade-off between reliability and performance in the VM placement process. In this paper, we propose a multi-objective placement model for interdependent VMs in the Cloud that considers both reliability and workload. Reliability in our model is quantitatively evaluated through a set of metrics that we propose. The model involves an Integer Linear Programming problem that aims at maximizing the reliability of the Cloud while minimizing network delay. A multi-objective genetic algorithm is then used to solve the problem heuristically. The proposed model introduces a level of flexibility and its parameters could be adjusted depending on the requirements of the infrastructure and services. The results show that our model achieves high Cloud reliability and allows to effectively control the trade-off between reliability and Quality of Service.

Vehicular cloud is getting significant research attention due to the technological advancements in smart vehicles. In near future, vehicles are envisioned to become part of a grid network providing cloud services, such as computing, storage, network, and application as a service. Vehicular cloud computing is an emerging area, designed to support delay-sensitive applications. However, this integration of vehicular network and cloud computing introduces new challenges for the research community. New frameworks have been proposed to assimilate and efficiently manage this merger. In this survey paper, we present the recent advancements in vehicular cloud computing domain. The review is primarily focused on two areas. First, we discuss the frameworks designed to utilize the vehicles’ onboard resources to provide cloud services and highlight the design issues and research challenges. Secondly, we focus on a detailed study of mobility generators, network, and vehicular ad hoc network simulators, as well as the available vehicular data sets. We thus provide an overarching view of the complete domain of vehicular cloud computing and identify areas for future research directions.

Nowadays, Cloud Service Providers (CSPs) provide flexible architectures and reliable internet accessories in cloud datacenters, where different types of applications are hosted. In order to achieve higher resource utilization and better quality of service, virtualization is widely used and implemented with virtual machines (VMs). However, most studies focus on VM management for utilization and energy, not yet considering the cost for emerging internet applications. Therefore, to further reduce network cost, we propose utilization-and-network-driven (UND) and only-network-driven (OND) strategies on top of the common minimal-migration (MM) based VM management as UND-MM and OND-MM. According to simulation results, both UND-MM and OND-MM strategies effectively reduce network cost by averagely 7% and 37%, respectively, of the original MM while retaining comparable resource utilization in CPU and memory for normally-loaded and overloaded datacenters. Moreover, the OND-MM, which is simpler, outperforms the UND-MM, and thus becomes more preferable for VM management in cloud datacenters.

To be successful a cloud service provider has to target a preferably large customer group to leverage economies of scale. Therefore an application offered as a service in the cloud is often configurable regarding non-functional qualities, such as location or availability. Since many of these qualities depend on the resources on which the service is hosted, a large number of computing environments has to be managed by the service provider. This paper analyses the challenges arising from such a scenario and identifies several optimization opportunities originating from an intelligent distribution of users among the functionally equal resources with different quality of services. A framework enabling the development of distribution strategies exploiting these opportunities is defined. It allows modeling of resources, their deployment dependencies, and users with specific demands. An architecture and prototype of a management system is introduced to handle the required resource provisioning and user request routing. Several optimization strategies are defined and their performance is evaluated using statistical data of an existing cloud service provider.

In intelligent transportation systems, Vehicular Cloud Computing (VCC) is a new technology that can help ensure road security and transport efficiency. The study and evaluation of performances of a VCC is a topic of crucial interest in these environments. This paper presents a model of the computation resource allocation problem in VCC by considering heterogeneity and priority of service requests. We consider service requests from two classes, Primary service requests and Secondary service requests. We involve a Semi-Markov Decision Process (SMDP) to achieve the optimal policy that maximizes the performances of the VCC system taking into account the variability of resources, the income and the system cost. We utilize an iterative approach to achieve the optimal scheme that characterizes the action to be taken under each state. We validate our study by numerical results that show the effectiveness of the proposed SMDP-based scheme.

By leveraging the Internet, cloud computing allows users to have on-demand access to large pools of configurable computing resources. PaaS (Platform as a Service), IaaS (Infrastructure as a Service), and SaaS (Software as a Service) are three basic categories for the services provided by cloud the computing environments. Quality of service (QoS) metrics like reliability, availability, performance, and cost determine which resources and services are available in a cloud computing scenario. Provider and the user-specified performance characteristics, such as, rejection rate, throughput, response time, financial cost, and energy consumption, form the basis for QoS. To fulfil the needs of its customers, cloud computing must ensure that its services are given with the appropriate quality of service QoS. A “A legally enforceable agreement known as a “Service Level Agreement” (SLA) between a service provider and a customer that outlines service objectives, quality of service requirements, and any associated financial penalties for falling short. We, therefore, presented “A Proactive Resource Supply based Run-time Monitoring of SLA in Cloud Computing”, which allows for the proactive management of SLAs during run-time via the provisioning of cloud services and resources. Within the framework of the proposed work, SLAs are negotiated between cloud users and providers at run-time utilizing SLA Manager. Resources are proactively allocated via the Resource Manager to cut down on SLA violations and misdetection costs. As metrics of performance, we looked at the frequency with which SLAs were broken and the money lost due to false positives. We compared the proposed PRP-RM-SLA model’s simulated performance to the popular existing SLA-based allocation strategy SCOOTER. According to simulation data, the suggested PRP-RM-SLA model is 25% more effective than the current work SCOOTER at reducing SLA breaches and the cost of misdetection.

Defending against fake VIP in scant-transparency information systems with QoS differentiation

The adoption of cloud computing has grown significantly among individuals and in organizations. According to this growth, Cloud Service Providers have continuously expanded and updated cloud-computing infrastructures, which have become more heterogeneous. Managing these heterogeneous resources in cloud infrastructures while ensuring Quality of Service (QoS) and minimizing energy consumption is a prominent challenge. Therefore, unifying energy consumption models to deal with heterogeneous cloud environments is essential in order to efficiently manage these resources. This paper deeply analyzes factors affecting power consumption and employs these factors to develop power models. Because of the strong correlation between power consumption and energy consumption, the influencing factors on power consumption, with the addition of other factors, are considered when developing energy consumption models to enhance the treatment in heterogeneous infrastructures in cloud computing. These models have been developed for two Virtual Machines (VMs) containing heterogeneous Graphics Processing Units (GPUs) architectures with different features and capabilities. Experiments evaluate the models through a cloud testbed between the actual and predicted values produced by the models. Deep Neural Network (DNN) power models are validated with shallow neural networks using performance counters as inputs. Then, the results are significantly enhanced by 8% when using hybrid inputs (performance counters, GPU and memory utilization). Moreover, a DNN energy-agnostic model to abstract the complexity of heterogeneous GPU architectures is presented for the two VMs. A comparison between the standard and agnostic energy models containing common inputs is conducted in each VM. Agnostic energy models with common inputs for both VMs show a slight enhancement in accuracy with input reduction.

Cloud federation is introduced to eliminate the resource limitation problem of individual Cloud Service Provider (CSP). In a federation, one CSP can outsource their overhead requests by hiring unused resources from other CSPs in the federation and CSPs cash greater revenue. In this paper, we propose a system that maximizes this revenue while putting some factor constraints in satisfactory standard. Factors include response time of instances that is analogous to Quality of Service (QoS), and profit that maintains a certain reputation. Response time is reduced by considering geographical location of the user and the data center of desired resources. In this system, CSPs choose suitable resources from resource pool of cloud federation that maximizes the profit while preserving Quality of Service (QoS) high and minimizing the rejection rate of user requests. We map factor constraints to MMKP (Multi-choice Multidimensional Knapsack Problem) algorithm and define objective function for revenue maximization. We calculate response time by Cloud Analyst to measure the QoS. Experimental results show that the proposed system can effectively increases QoS level by reducing response time and rejection requests in a cloud federation that eventually increases the revenue of the CSP.

In this paper, we develop a model for the competitive relationship between cloud service providers and cloud brokers during the virtual machine (VM) placement. The model adopts the idea of a strategy game, in which the cloud service provider and all VMs are participants. First, we define the strategy for the participants in the strategy game model according to the difference between the number of physical resources provided by the provider, and that requested for the VMs by the brokers. Next, payment values between the providers and brokers are obtained from each strategy in the game matrix, which corresponds to the strategy set of VM placement. In addition, the Nash equilibrium solution of the current strategy game demonstrates the trade-off between reducing energy consumption and guaranteeing QoS. On the basis of this, the optimal VM placement scheme is obtained, and the ongoing VM consolidation is examined. Finally, a strategy-game-based VM consolidation (SG-VMC) method is proposed. The extensive experimental results show that the proposed SG-VMC method can significantly reduce energy consumption while guaranteeing QoS.

A survey on vehicular cloud computing