Service Broker Policy Research Articles

Optimizing Cloud Computing Performance by Integrating the Novel PSBR Service Broker Policy and Load Balancing Algorithms

As cloud computing advances, organizations' IT infrastructure and application deployment processes are moving to the cloud because cloud computing provides everything as a service over the Internet. The performance of a cloud-based application is based on proper datacenter selection and workload distribution within the selected datacenter. Service broker policies are used for suitable datacenter selection, and load balancing algorithms(LBA) are applied to distribute workloads. This paper is to evaluate the effect of a proposed service broker policy (PSBR) on the performance of cloud-based applications with LBA. To achieve the objective, the behavior of the TikTok application was modeled using the worldwide users’ statistics on the cloud simulation framework, namely CloudAnalyst. As a result, the average response time and data center processing time are measured. Next, the PSBR provides better results than the existing service proximity-based policy. This paper supports cloud service providers' benefits, from coordination between data center configuration, data center selection, and workload distribution to cloud users' identification of the appropriate procedures for their organization or application. PSBR with Active Monitoring had the best average response time of 75.1 ms, while SPR consistently exhibited higher average times across all algorithms, with the highest being 84.5 ms for Round Robin. Under the PSBR policy, Throttled had the lowest average processing time (4.67), while Round Robin had the highest (5.72). Similarly, under the SPR policy, Throttled maintained its efficiency with the lowest average (4.8), while Round Robin showed the highest (5.79).

The Proposed IT-TALB in Infrastructure as a Service Cloud

Objectives: The purpose of the proposed IT-TALB load balancing algorithm is to dynamically allocate the user's workload to the appropriate virtual machine in an Infrastructure as a Service (IaaS) cloud environment. Methods: This research work includes several key procedures. The user's workloads are distributed to the data center controller (DCC), which in turn uses the ECO-SBP service broker policy to select the efficient data center (DC) for processing the loads. The DCC forwards the load to the selected DC, and the IT-TALB load balancer picks the best Virtual Machine (VM) using CloudAnalyst simulation tool for load allocations according to metrics such as its size, current number of loads, and load size. IT-TALB partitions the available and busy VMs separately and stores them in the TreeMap structure. This algorithm also incorporates the scalability of the given VM when the load size is not compatible with the existing VMs by extending the resources of underutilized VMs. Findings: The research finding demonstrates that the proposed IT-TALB algorithm improves IaaS cloud performance compared to the existing algorithms. It achieves optimum load balancing, reduces the searching time of the VM, avoids the load waiting time, improves throughput, minimizes the response time, and enhances the resource utilization ratio. IT-TALB yields a throughput and resource utilization ratio of 98 to 99 percent. Novelty: The novelty of this research is that the IT-TALB algorithm incorporates the scalability of the underutilized VM and also introduces new metrics such as throughput and resource utilization ratio in the CloudAnalyst simulation tool for assessing the performance of the proposed algorithm. This study provides information for analyzing the proposed IT-TALB strategies with the existing two algorithms such as TLB and TALB in order to show its performance. Keywords: Cloud Computing, Infrastructure as a Service, Load Balancing, Throttled Load Balancing, Virtual Machine

Energy management of renewable based power grids using artificial intelligence: Digital twin of renewables

This paper proposes fog computing as a method of minimizing latency and maximizing performance by storing the information in the cloud to give a wide range of services to users using cloud computing. Also, consumer requests have been handled by several cloud Data Centers (DCs). Due to the fog's ability to attract more users and provide more services, load balancing has become increasingly crucial. It is therefore necessary to enhance the method that balances the fog's load. The study proposes a three-layer model comprising a cloud layer, a fog layer, and a user layer for optimal energy management in renewable power grids. The renewable energy sources are all modeled within the digital twin environment to make sure that very accurate monitoring is made. It is proposed for balancing the fog load using an artificial intelligence based optimization algorithm called the Whale optimization algorithm (WOA). Services are provided by fog servers in response to requests from users. In case of failure of the fog layer, all consumers' records are saved and services are provided to them through the cloud. Moreover, the service broker policies (SBP) have been applied to select the DCs efficiently. This paper compares the suggested algorithm to three previously developed algorithms including the particle swarm optimization (PSO), differential devolution (DE), and teaching–learning-based optimization (TLBO). It uses the three SBPs of closest data center, optimize response time (RT), reconfigure dynamically with load, and an improved SBP. It also minimizes RT and process time to improve the efficiency. The results show that there is an improvement in WOA's performance by approximately 5% compared to that of other algorithms.

A novel optimal management method for smart grids incorporating cloud-fog layer and honeybee mating optimization algorithm

As a result of cloud-fog (CF) technology, today's society is experiencing low delay, great performance, improved safety, and lower operating costs. As a result of integrating Smart Grid (SG) into the CF platform, the power supply is of higher quality, and the transmission, distribution, and production of power are secure; management of demand and supply is continuous. The study proposes integrating SG with CF-driven environments to improve source distribution. There are 6 fogs in various areas. Every fog connects to a cluster, and there are 500 smart houses in every cluster. Home energy demands are fulfilled by fogs using various load balancing algorithms (LBAs), which are implemented on Digital Twin Virtual Machines (DTDTVMs) and provided with a fast response time (RT) and processing time (PT). The study proposes a Honeybee Mating Optimization Algorithm to balance loads using improved service broker policies. After comparing the outcomes of the suggested LBA to the particle swarm optimization algorithm (PSO), it can be concluded the suggested LBA performs better in comparison with PSO. All the simulation results and comparisons have been performed on digital twin environment to provide more realistic framework for this study.

Performance Evaluation of Load-Balancing Algorithms with Different Service Broker Policies for Cloud Computing

Cloud computing has seen a major boom during the past few years. Many people have switched to cloud computing because traditional systems require complex resource distribution and cloud solutions are less expensive. Load balancing (LB) is one of the essential challenges in cloud computing used to balance the workload of cloud services. This research paper presents a performance evaluation of the existing load-balancing algorithms which are particle swarm optimization (PSO), round robin (RR), equally spread current execution (ESCE), and throttled load balancing. This study offers a detailed performance evaluation of various load-balancing algorithms by employing a cloud analyst platform. Efficiency concerning various service broker policy configurations for load-balancing algorithms’ virtual machine load balance was also calculated using metrics such as optimized response time (ORT), data center processing time (DCPT), virtual machine costs, data transfer costs, and total cost for different workloads and user bases. Many of the past papers that were mentioned in the literature worked on round robin and equally spread current execution, and throttled load-balancing algorithms were based on efficiency and response time in virtual machines without recognizing the relation between the task and the virtual machines, and the practical significance of the application. A comparison of specific load-balancing algorithms has been investigated. Different service broker policy (SBP) tests have been conducted to illustrate the load-balancing algorithm capabilities.

Designing a Component-Based Throttled Load Balancing Algorithm for Cloud Data Centers

Cloud services are accessed from different geographical locations where client migration or switching from one server to another based on the loads is a common phenomenon. One of the most critical challenges the cloud data centers face is managing the loads over geographically dispersed data centers and their virtual machines (VMs). VMs need to be balanced with the varied loads or dynamics of traffic. There are possibilities of the highest loads to be tolerated by the VMs over the cloud servers without crashing. Load balancing issues are managed by load balancing algorithms. Load balancing algorithms have varied issues of efficiency due to certain parameters like the capability of the lowest resource utilization, response time, higher overhead while checking the idle or normal nodes, and many others. Throttled load balancing algorithm manages loads of the virtual machines by dividing the virtual machines into two segments, that is, “available” and “free.” To do this, the throttled algorithm uses a single component to assign the virtual machines and other tasks. The throttled algorithm utilizes only the first VMs available, the next, and so on. These strategic issues most often degrade the performance of the applied load balancing algorithm. Such issues create a curiosity to enhance this algorithm’s performance for efficiently managing the dynamic loads of the cloud VMs. This research paper proposes a component-based throttled load balancing algorithm with VM reader, free VM holder, and free VM manager components. The VM reader component reads all available VMs. The free VM component holds free VMs temporarily until they are moved to the free VM manager component. For the performance test, the cloud analyst simulation tool was used. Based on the comparative analysis with the other five popularly used load balancing algorithms, the component-based algorithm’s performance is significantly enhanced. The proposed algorithm resulted in 325.30-microsecond response time and 27.12-microsecond processing time by the closest data center service broker policy. The newly proposed “component-based throttled load balancing algorithm” is found to be better than the existing throttled algorithm and the other five selected algorithms in terms of response time, processing time, and resource utilization.

Multi-Cloud Service Brokers for Selecting the Optimal Data Center in Cloud Environment

Cloud computing provides different services through data centers that are often located in different geographical locations. The users are faced with a wide variety of services to choose from. Also, with the increasing number of serviced applications, overloading might occur on service brokers for balancing and serving the requests. Consequently, maximizing the number of entry points and considering the maximum number of factors that affect the performance for balancing the workload is very important for the quality of service. This paper proposes a model named multi-cloud service brokers (MCSB) for selecting the optimal DC using multiple entry points. The developed service broker policy shares information about the requests considering some new performance factors. This extension is added to the CloudAnalyst simulator tool which is used in this work, and the results are evaluated and compared to other existing policies from the literature.

Improvising Service Broker Policies in Fog integrated Cloud environment

Improvising Service Broker Policies in Fog integrated Cloud environment

Improvising service broker policies in fog integrated cloud environment

Improvising service broker policies in fog integrated cloud environment

Data center selection through service broker policy in cloud computing environment

The concept of cloud computing is well known for the sharing of resources, data and information for which it deals with several services like servers, storage, applications. Service broker based on service broker policies handles the routing between data center and user base. The cloud service providers are responsible for providing different application ad infrastructure services to the end user through data centers. Due to the distribution of data centers in several geographical locations, there may be the possibility of overload and in result in unavailability to end users. The study aims to increase the efficiency of the system by choosing proper selection of policy. Service broker policy not only reduces overloading of data center but also enables to choose proper data center. The study discusses the different parameters like response time, processing time and cost that helps to reduce associated overhead and increase performance by selecting proper data center based on service broker policies. This paper also presents the simulation of service broker policy algorithms for the different parameter’s like response time, processing time, cost of assigned virtual machine and data transfer cost.

Cloud Analyst Using Service Broker Policy and Methodology carried out in SPBR

Cloud Analyst Using Service Broker Policy and Methodology carried out in SPBR

Efficient and Cost-effective Service Broker Policy Based on User Priority in VIKOR for Cloud Computing

Cloud computing has become a practical solution for processing big data. Cloud service providers have heterogeneous resources and offer a wide range of services with various processing capabilities. Typically, cloud users set preferences when working on a cloud platform. Some users tend to prefer the cheapest services for the given tasks, whereas other users prefer solutions that ensure the shortest response time or seek solutions that produce services ensuring an acceptable response time at a reasonable cost. The main responsibility of the cloud service broker is identifying the best data centre to be used for processing user requests. Therefore, to maintain a high level of quality of service, it is necessity to develop a service broker policy that is capable of selecting the best data centre, taking into consideration user preferences (e.g. cost, response time). This paper proposes an efficient and cost-effective plan for a service broker policy in a cloud environment based on the concept of VIKOR. The proposed solution relies on a multi-criteria decision-making technique aimed at generating an optimized solution that incorporates user preferences. The simulation results show that the proposed policy outperforms most recent policies designed for the cloud environment in many aspects, including processing time, response time, and processing cost. KEYWORDS Cloud computing, data centre selection, service broker, VIKOR, user priorities

A Cost Efficient Service Broker Policy for Data Center Allocation in IaaS Cloud Model

Cloud computing provides distributed computing resources such as servers, storage and applications to the end users through data centers. The data centers are geographically located at different locations. The client applications or requests being serviced by cloud service providers on “pay per use”. So, different pricing models are adapted to compute the cost and revenue of the data centers. The cost of VM is computed depending on its placement in the data centers through broker policies. So, the broker policies have a significant role in evaluating the cost of the VM which directly impacts on revenue of the service provider. In the computing competition, the VM cost should be minimized by which service demand will be maximized. Moreover, the response time and processing time of the data centers need to be minimized to posses commendatory Quality of Service. In this work, we propose a new service broker policy to minimize the total cost. The total cost considers the VM cost and the data transfer cost. The proposed mechanism also reduces the response time and data processing time of the data centers. The proposed policy is simulated in Cloud Analyst. We examine the performance of the proposed mechanism with ten different scenarios. Finally, we compare performance results with respect to VM cost, data transfer cost, total cost, processing time and response time of data centers with the existing policies and observe better than these.

Cloud computing using load balancing and service broker policy for IT service: a taxonomy and survey

Cloud computing is the big boom technology in IT industry infrastructure. Many people are moving to cloud computing because of dynamic allocation of resources and reduction in cost. Cloud computing delivers infrastructure, software, and platforms as a service to all consumers. But still, it has numerous issues related to performance unpredictability, resource sharing, security, storage capacity, availability of resources on each requirement, data confidentiality and many more. Load balancing and service brokering are the two main key areas, which ensures reliability, scalability, minimize response time, maximize throughput and cost in the cloud environment. These are the main things we have to focus to improve the performance of the computation. This survey paper presents a comparative and comprehensive study of various load balancing algorithm used in the load balancer and brokering policy used for each service and their scheduling types. The objectives of this survey is to (1) Determine, illustrate, compare and analyze newer methods developed for load balancing and service brokering (the most notable problem) by systematically reviewing papers from the year 2015 to 2018; (2) Classify and analyze techniques based on the key parameters in cloud computing techniques; (3) Ultimately set an updated, thorough and rigorous discussion on load balancing and service broker techniques so as to motivate and direct with valuable references for future research development and direction.

Experimental Model of Distributed Service Broker Policy Algorithm in Cloud based Centralized and Distributed Data Center

Experimental Model of Distributed Service Broker Policy Algorithm in Cloud based Centralized and Distributed Data Center

Efficient Load Balancing and Service Broker Policy Using Local and Global Representatives in Cloud Computing

Cloud computing is a technology in the field of computing which offer services to the customer from anywhere at any time [1]. In the cloud, resources are shared all around the work for quick servicing to the customer. The aggregation of two terms is referred as cloud computing. The term “cloud” is a pool of different resources offers services to the end customers and “computing” is done based on the Service Level Agreement (SLA) to make the resources efficiently to the customers. Load balancing is an important challenge in the environment of the cloud to increase the utilization of resources [3]. Here we proposed an algorithm which is based on load balancing and service broker policy. We user two representative thin the proposed approach local representative and global representative Local user representative is used to predict the parameters of user task and based on priority it allocate the task to the Virtual Machine (VM). Then for scheduling the task and provide the services to the users based on the available cloud brokers global user representative used Dynamic Optimal Load-Aware Service Broker (DOLASB).we used two scenario with different no. of user requests , in these scenario result of our proposed method is better as compared with the other existing methods in terms s of Execution Time, Makespan, Waiting Time, Energy Efficiency and Throughput.

An Analysis on ECSE Load Balancing Algorithm with CDC as a Service Broker Policy in Cloud with Heterogeneous Communication and Device Characteristics

Load balancing algorithms and service broker policies plays a crucial role in determining the performance of cloud systems. User response time and data center request servicing time are largely affected by the load balancing algorithms and service broker policies. Several load balancing algorithms and service broker polices exist in the literature to perform the data center allocation and virtual machine allocation for the given set of user requests. In this paper, we investigate the performance of equally spread current execution (ESCE) based load balancing algorithm with closest data center(CDC) service broker policy in a cloud environment that consists of homogeneous and heterogeneous device characteristics in data centers and heterogeneous communication bandwidth that exist between different regions where cloud data centers are deployed. We performed a simulation using CloudAnalyst an open source software with different settings of device characteristics and bandwidth. The user response time and data center request servicing time are found considerably less in heterogeneous environment.

Analysis of Heterogeneous Device Characteristics in Round Robin Based Load Balancing Algorithm with Closest Data Center as Service Broker Policy in Cloud

Load balancing is an important aspect in cloud to share load among different virtual machines running on various physical nodes. The user response time which is an important performance metric is being highly influenced by the efficient load balancing algorithm for cloud data centers. Virtual machines which are part of the cloud data centers consist of various types of physical devices. The user response time is affected significantly by the capacity of physical devices that exist as part of the data centers. Several load balancing algorithms exist in the literature to allocate task effectively on various virtual machines running in data centers. We investigate the performance of round robin based load balancing algorithm with closest data center as service broker policy in cloud data centers. We have performed a simulation with data centers that consist of devices with different physical characteristics such as memory, storage, bandwidth, processor speed and scheduling policy using Round Robin load balancing algorithm with closest data centers as service broker policy. We present the merits of heterogeneous device characteristics in reducing the user response time and the data center request service time. We used Cloud Analyst, an open source simulation tool for cloud computing environment.

An Research on the Effectiveness of the Different Algorithms and the Scheduling in Improving the Performance of Cloud Computing by using Cloud Analyst Simulator

Cloud computing can be defined as a computing paradigm, where the various systems and large pool are connected to each other in private or public networks. The aim for that is to provide a dynamically scalable infrastructure, where it is used for applications, data and file storage. Cloud computing reduced the cost of computation and application hosting so that content storage and delivering services are handled faster and more flexibility. Load balancing is one of the challenges that affect the performance of cloud computing and the overcome it leads to better resource utilization and response time. The service broker policy plays an important role in accelerating the response time of customer requests by locating data centers or optimize the pattern of access to them. The contribution of this paper investigates the effectiveness of using the different algorithms and the approaches to improve the performance of cloud computing as it has been shown that there is a possibility to increase the performance of cloud computing by relying on certain criteria described in this paper. The results, which are presented in this paper were obtained using the cloud analyst simulator, where this simulator contains (Time duration, Load balancing algorithms, and Service Broker Algorithms, etc).

Dynamic provisioning of resources based on load balancing and service broker policy in cloud computing

Dynamic resource allocation is the key objective of the paper motivated due to a large number of user’s service request and increasing network infrastructure complexity. Load balancing and Service Broker Policy are taken as two main key areas for the dynamic provision of resources to the cloud user in order to meet the QoS requirement. While provisioning the resources, the conventional approaches degrade due to QoS performance limits such as time delay, energy, etc. To overcome those problems, we proposed a new approach to provide dynamic provisioning of resources based on load balancing and service brokering. Initially, the Multi-agent Deep Reinforcement Learning-Dynamic Resource Allocation (MADRL-DRA) is used in the Local User Agent (LUA) to predict the environmental activities of user task and allocate the task to the Virtual Machine (VM) based on priority. Next, a Load balancing (LB) is performed in the VM, which increases the throughput and reduces the response time in the resource allocation task. Secondly, the Dynamic Optimal Load-Aware Service Broker (DOLASB) is used in the Global User Agent (GUA) for scheduling the task and provide the services to the users based on the available cloud brokers (CBs). In the global agent, cloud brokers are the mediators between users and providers. The optimization problem in Global Agent (GA) is formulated by the programming of mixed integers, and Bender decomposition algorithm. The result of our proposed method is better as compared with the conventional techniques in terms of Execution Time, Waiting Time, Energy Efficiency, Throughput, Resource Usage, and Makespan.