In this research simulation process was according to the cost of the proposed algorithms. The proposed algorithms were as follow LA, CA and LOAC algorithms. NETBEANS software was employed for implementation of these algorithms. Results of simulation of this research were validated with pinch mark. The results of simulation were for two aspects, in terms of cost for four scenarios and in terms of processing time for seven different data centers. The results for costs were stated that the lower cost is happened at the first scenario and maximum cost happened at the third scenario. When it comes to the processing time, the maximum delay happens in data center No.6 while the minimum processing time happened in data center No.2

1. http://www.iaeme.com/IJCIET/index.asp 1751 editor@iaeme.com
International Journal of Civil Engineering and Technology (IJCIET)
Volume 10, Issue 01, January 2019, pp. 1751-1757, Article ID: IJCIET_10_01_162
Available online at http://www.iaeme.com/ijciet/issues.asp?JType=IJCIET&VType=10&IType=01
ISSN Print: 0976-6308 and ISSN Online: 0976-6316
© IAEME Publication Scopus Indexed
THE AFFECTION OF COST AND BROKERING
IN LOAD BALANCING BY USING
SCHEDULING ALGORITHM IN CLOUD
COMPUTING
Hind Hameed Rasheed
Department of computer engineering
Al-Esraa University College, Baghdad, Iraq.
ABSTRACT
In this research simulation process was according to the cost of the proposed
algorithms. The proposed algorithms were as follow LA, CA and LOAC algorithms.
NETBEANS software was employed for implementation of these algorithms. Results of
simulation of this research were validated with pinch mark. The results of simulation
were for two aspects, in terms of cost for four scenarios and in terms of processing time
for seven different data centers. The results for costs were stated that the lower cost is
happened at the first scenario and maximum cost happened at the third scenario. When
it comes to the processing time, the maximum delay happens in data center No.6 while
the minimum processing time happened in data center No.2.
Keywords: load balancing, LOAC, NETBEANS and brokering.
Cite this Article: Hind Hameed Rasheed, the Affection of Cost and Brokering in Load
Balancing by Using Scheduling Algorithm in Cloud Computing, International Journal
of Civil Engineering and Technology, 10(01), 2019, pp. 1751–1757
http://www.iaeme.com/IJCIET/issues.asp?JType=IJCIET&VType=10&IType=01
1. INTRODUCTION
Recently various energy efficient techniques have been introduced to help Cloud providers
reduce the energy cost of their infrastructure, which can then lead to reducing the cost of
operational expenditure (OPEX) and having less negative impact on the environment.
Cost mechanisms offered by Cloud providers have become sophisticated, as customers are
charged per month, hour or minute for the services they use [1]. Nevertheless, there are still
limited as customers are charged based on a predefined tariff for the resources usage which
include CPU, memory, storage and network. This pre-defined tariff does not consider the
variable cost of energy [2]. Consequently, modelling a new cost mechanism for services offered
that can be adjusted to the actual energy costs has become an interesting research topic.

2. Hind Hameed Rasheed
http://www.iaeme.com/IJCIET/index.asp 1752 editor@iaeme.com
Many extensive studies have been conducted in resource brokering in terms of grid
computing. An example of such studies is that conducted by Leal et al. [3]. In their study, a
decentralized model that is capable of scheduling independent tasks in partnering grid was
presented. However, in order to further modify it such that more complicated scenarios can be
considered, specific organizations interfaces with different sorts of grid infrastructure [4]. The
principles of scheduling that are applied in this contribution are based on the performance
criteria such as the optimization of throughput, enhance the network makespan, or usage of
network bandwidth. Co-allocation has been highlighted as one interesting issue of scheduling
in environments of federated grid; the allocation is described as the advance reservation of
resources belonging to various grids in an organized manner [5]. More so, studies have also
been conducted in the area of the policies guiding the provision of resource in multi-grid
environments [6]. In their study, the provisioning policies in which cost of resources are
incorporated were analyzed, and the manner in which requests can be redirected by a grid to
other grid during peak periods of load was demonstrated. In this demonstration they showed
that this can be achieved through the use of a cost-aware algorithm of load sharing. Despite the
extensive research that has been carried out in the area of using multi-provider scheduling that
is cost-aware for grid environments [7], the presence of abnormalities caused by the usage of
artificial currencies [8], suggest that such techniques can have great potentials for use in cloud
applications, where the consumption of resources is based on real financial compensation. This
study specifically focuses on load balancing among virtual machines and data centers. The
desire to develop a new algorithm for load balancing is driven by the limitations of efficient
cloud load balancing motivated us to develop a novel load balancing algorithm. The proposed
algorithm reduces overall processing and also cloud broker in grand load balancing algorithms
for a cloud computing environment were proposed.
2. RESEARCH PROCEDURE
2.1. Software Definitions
NetBeans is an integrated development environment (IDE) for Java [9]. NetBeans allows
applications and users to be developed from a set a number of modular software components
called modules.
In this research NETBEAN software has been conducted to simulate the scheduling
algorithm for the cloud brokering in term of load balancing and the cost. Figure 1 shows the
main page of the software.
Figure.1 Main page of the software

3. The Affection of Cost and Brokering in Load Balancing by Using Scheduling Algorithm in Cloud
Computing
http://www.iaeme.com/IJCIET/index.asp 1753 editor@iaeme.com
2.2. Work Configuration
The experiments as mentioned [10] have been stated that the configuration of work as shown
in the table .1
Table.1 System Configurations
Cpu speed speed10,000MIPS
CPU core 4
RAM 20 GB
Network bandwidth 10Gbps
CPU architecture
10Gbps
x86
OS Linux
Virtual machine e monitor(VMM) Xen
Storage 1000GB
VM CONFIGRATION
CPU SPEED 1000 MIPS
RAM 1 GB
STORAGE 50 GB
NETWORK BANDWIDTTH 100 MPS
The experiments were conducted for seven data centers by focusing on cost per virtual
machine as shown in figure 2
Figure .2 cost per data center
2.3. Code Validation
In order to validate the results that described in Section 3 of this work, 7 data centers have been
selected for configurations of the results and the performance. Here, we focus on cost per
virtual machine for each data center .as show in Fig. 3 should give similar performance, of the
machines that has been done before.
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0 1 2 3 4 5 6 7 8
costrate
data centers

4. Hind Hameed Rasheed
http://www.iaeme.com/IJCIET/index.asp 1754 editor@iaeme.com
Figure .3 Validate cost per data center
2.3. Algorithm of Load /Cost Broking
The algorithm that shows in figure 4 explains how can minimize the cost and load balancing
in cloud computing. This algorithm will be conducted in NETBEANS to show the affection of
the cost and the load balancing in cloud computing. Furthermore this algorithm maintains a list
of data centers, which is indexed by the location of the data center in a specific country.
General brokering algorithm
Figure .4 General brokering algorithm
3. RESULTS
3.1. Implementation of LA, CA and LOAC algorithm
In this research Load Aware over Cost (LAOC) have been employed to explain the effects of
cost in cloud computing with different four scenarios. (LAOC) has been developed by [10]
.load aware algorithm, cost aware algorithm and Load Aware Over Cost (LAOC) algorithm
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
0 1 2 3 4 5 6 7 8
costrate
Data ceters

5. The Affection of Cost and Brokering in Load Balancing by Using Scheduling Algorithm in Cloud
Computing
http://www.iaeme.com/IJCIET/index.asp 1755 editor@iaeme.com
have been implemented in NETBEANS. The results of simulation that shown in figure 5 is
explaining that the effects total virtual machines cost on these algorithms due to the scenarios.
Figure .5 cost in VM per scenarios
In figure 5 four scenarios were taken in the account. Where each scenario is simulating
three different algorithms. The algorithms as follow LA, CA, LOAC,. The results is stated that
the maximum total cost for virtual machine was happened in in the third scenario.in the third
scenario the cost of VM in term of LOAC has been reached to maximum . When it comes to
the first scenario we see the contradicted results as mentioned in the third scenario where the
minimum LOAC was occurred in that scenario
3.2. Effects of processing time in terms of LA, CA and LOAC algorithms
Current research tries to pay attention about the affections of time on processes. Simulation
processes have been carried out for three algorithms as follow LA, CA and LOAC algorithms.
Figure 6 is showing that the results of time processing for seven different data center by
implementation of these algorithms.
Figure .6 Processing time per data centers
0
200
400
600
800
1000
1200
1 2 3 4
COSTINVM
Scenarios
CA
LOAC
LA
0
1000
2000
3000
4000
5000
6000
1 2 3 4 5 6 7
PreocessingTime
Data centers
LA
LOAC
CA

6. Hind Hameed Rasheed
http://www.iaeme.com/IJCIET/index.asp 1756 editor@iaeme.com
According to the results that have been obtained by the simulation process for these data centers
(DC) we can notice that the maximum processing time occurred in data center No. 6 by
implementation of these algorithms. However minimum processing time has been happened in
data center No.2. the results of simulations is clearly stated that the maximum processing time
was happened in data centers No.4.5.6.7 while the minimum processing time was occurred in
the data centers No.1.2.3.4
3.4. Contributions
The main contribution of current work is to use the scheduling algorithm that have been used
by [10] in NETBEAN software in order to study the cost for cloud computing as well as delay
in time in the data centers.
4. CONCLUSIONS
In current study three algorithms were proposed to simulate the cost and delay in cloud
computing by implementation in NETBEAN software .The proposed algorithms were as
follow LA, CA and LOAC algorithms. NETBEANS software was employed for
implementation of these algorithms. Results of simulation of this research were validated with
pinch mark. The results of simulation were for two aspects, in terms of cost for four scenarios
and in terms of processing time for seven different data centers. The results for costs were
stated that the lower cost is happened at the first scenario and maximum cost happened at the
third scenario. When it comes to the processing time, the maximum delay happens in data
center No.6 while the minimum processing time happened in data center No.2.
REFERENCES
[1] Fernando, N., Loke, S. W., & Rahayu, W. (2013). Mobile cloud computing: A survey.
Future generation computer systems, 29(1), 84-106.
[2] Yu, S., Wang, C., Ren, K., & Lou, W. (2010, March). Achieving secure, scalable, and fine-
grained data access control in cloud computing. In Infocom, 2010 proceedings IEEE (pp.
1-9). Ieee.
[3] Grossman, R. L. (2009). The case for cloud computing. IT professional, 11(2), 23-27.
[4] Kumar, K., & Lu, Y. H. (2010). Cloud computing for mobile users: Can offloading
computation save energy?. Computer, 43(4), 51-56.
[5] Santos, N., Gummadi, K. P., & Rodrigues, R. (2009). Towards Trusted Cloud Computing.
HotCloud, 9(9), 3.
[6] Santos, N., Gummadi, K. P., & Rodrigues, R. (2009). Towards Trusted Cloud Computing.
HotCloud, 9(9), 3.
[7] Berl, A., Gelenbe, E., Di Girolamo, M., Giuliani, G., De Meer, H., Dang, M. Q., &
Pentikousis, K. (2010). Energy-efficient cloud computing. The computer journal, 53(7),
1045-1051.
[8] Brodkin, J. (2008). Gartner: Seven cloud-computing security risks. Infoworld, 2008, 1-3.
[9] Wang, C., Wang, Q., Ren, K., & Lou, W. (2010, March). Privacy-preserving public
auditing for data storage security in cloud
[10] Kerrigan, M., Mocan, A., Tanler, M., & Fensel, D. (2007, June). The web service modeling
toolkit-an integrated development environment for semantic web services. In European
Semantic Web Conference (pp. 789-798). Springer, Berlin, Heidelberg.
[11] Gangu Dharmaraju, J. Divya Lalitha Sri and P. Satya Sruthi, A Cloud Computing
Resolution in Medical Care Institutions for Patient’s Data Collection. International Journal
of Computer Engineering and Technology, 7(6), 2016, pp. 83–90.

7. The Affection of Cost and Brokering in Load Balancing by Using Scheduling Algorithm in Cloud
Computing
http://www.iaeme.com/IJCIET/index.asp 1757 editor@iaeme.com
[12] Dr. V. Goutham and M. Tejaswini, A Denial of Service Strategy To Orchestrate Stealthy
Attack Patterns In Cloud Computing, International Journal of Computer Engineering and
Technology, 7(3), 2016, pp. 179–186.
[13] Damodar Tiwari, Shailendra Singh and Sanjeev Sharma, A Prediction Based Multi- Phases
Live Migration Approach to Minimize the Number of Transferred Pages, in Cloud
Computing Environment, International Journal of Computer Engineering & Technology,
9(3), 2018, pp. 23–31.