Search for collections on FTS Digilib

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

Mon, Nan Kham (2024) Optimizing Cloud Computing Performance by Integrating the Novel PSBR Service Broker Policy and Load Balancing Algorithms. Journal of Computing Theories and Applications, 2 (2). pp. 212-221. ISSN 3024-9104

[thumbnail of 11221-Article Text-40335-1-10-20241003.pdf]
Preview
Text
11221-Article Text-40335-1-10-20241003.pdf - Published Version

Download (289kB) | Preview

Abstract

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).

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Depositing User: Unnamed user with email cute.moses89@gmail.com
Date Deposited: 17 Nov 2024 16:35
Last Modified: 17 Nov 2024 16:35
URI: https://dl.futuretechsci.org/id/eprint/10

Actions (login required)

View Item
View Item