ISSN:2229-6093
Indra nath Sahu et al , International Journal of Computer Technology & Applications,Vol 8(4),544-550
Cooperative PSO-ACO Approach for Job Scheduling and Load
Balancing in Public Cloud Network
Indra Nath Sahu
Ph.D. Scholar
Sri Satya Sai University & Medical Sciences,
Sehore, India
rc.insahu@gmail.com
Abstract
Resource allocation and management of job is major issue
in public cloud networks. For the allocation of resource and
management of job used scheduling techniques. The
conventional and dynamic job scheduling techniques
increases the time span and failure of jobs are occurred. The
failure of job and resource raised the problem of load
balancing. For the management o f load balancing used
various dynamic methods based on probability theory and
heuristic function. In this paper proposed the hybrid
methods of load balancing for public cloud networks. The
hybrid methods are combination of two well know heuristic
function particle swarm optimization and ant colony
optimization. The particle swarm optimization maps the job
according to their resource and the ant colony optimization
works as scheduler of jobs. The proposed algorithm
simulated in cloudSim simulator and measure two
parameter one is data processing time and other is response
time.
Keywords: - Cloud Computing, Load Balancing, ACO,
PSO, CloudSim.
I. INTRODUCTION
Cloud computing play a vital role in current decade IT based
services. The IT based services used infrastructure, platform
and software. The all buckets of services provided by the
cloud network with min imu m cost. The reduction of cost of IT
based infrastructure is big story of the success of IT based
industry[1-3]. The efficiency and utility of cloud co mputing
network based on the management of resource and jobs
scheduling. For the managements of job and scheduling of
resource used various algorithms and methods based on the
concept of conventional and dynamic load balancing.
Resource provisioning is the task of mapping of the resources
to different entities of cloud on demand basis. Resources must
be allocated in such a manner that no node in the cloud is
overloaded and all the available resources in the cloud do not
undergo any kind of wastage [17-20]. Virtual mach ines reside
on the host. More than one instance of VM can be mapped
onto a single host subject to its availability and capabilit ies.
Host is responsible fo r assigning processing cores to VM.
Provisioning policy define the basis of allocating processing
IJCTA | July-August 2017
Available online@www.ijcta.com
Dr. Jitendra Sheetalani
Associate Professor
Sri Satya Sai University & Medical Sciences,
Sehore, India
dr.jsheetlani@g mail.co m
cores to VM on demand. Allocation policy or algorith m must
ensure that crit ical characteristics of Host and VM do not
mis match [30]. Applications or tasks are actually executed on
VM . Each application requires certain amount of processing
power for their co mp letion. VM must provide required
processing power to the tasks mapped onto it and these tasks
must be mapped onto appropriate VM based upon its
configuration and availability [22]. The scalability of network
is generally marked by efficient usage of the resources
available [27]. This could only be achieved Load balancing in
cloud computing provides an efficient solution to various
issues residing in cloud computing environment set-up and
usage. Load balancing must take into account two major tasks,
one is the resource provisioning or resource allocation and
other is task scheduling in d istributed environment [28].
Efficient provisioning of resources and for measuring the
efficiency and effectiveness of Load Balancing algorith ms
simu lation environ ment are required [29]. Cloud Sim is the
most efficient tool that can be used for modelling of Cloud.
During the lifecycle of a Cloud, Cloud Sim allows VMs to be
managed by hosts which in turn are managed by datacenters.
Cloud sim provides architecture with four basic entities. These
entities allow user to set-up a basic cloud computing
environment and measure the effectiveness of Load Balancing
algorith ms [21]. Now a day’s various authors used swarm
based searching technique for the scheduling of task for the
proper execution of task. The family of swarm intelligence
gives verity of algorithm such as ant colony optimization,
particle of swarm optimization and glowworm swarm
optimization the policy of cloud partition based on the
consideration of master and slave concept. The all load
initially distributed in terms of this manner. The master
partition of load shares the basic information in terms of
server and the slave node share the information accord ing to
the client node in network[5-7]. The slave node of partit ion
flows the instruction of master node. The particle swarm
optimization algorith m based on the concept of bird fo rk in
the sky. The bird fork sky in the fly and maintains the constant
velocity and gives the concept of optimization behavior of
swarm. The family o f swarm intelligence derives in terms of
artificial intelligence and used various domains for the process
of optimization. Now a day’s particle swarm optimizat ion
used load balancing for the optimization of load during
scheduling of process. The proposed methods are comb ination
544

Indra nath Sahu et al , International Journal of Computer Technology & Applications,Vol 8(4),544-550
of two swarm intelligence algorithm co mb ination[11-12]. The
rest of paper d iscuss as section II. Swarm intelligence. In
section III. Load balancing. In section IV discuss proposed
algorith m for load balancing, in section V discuss the
simu lation result analysis and finally discuss conclusion and
future work in section VI.
II. SWARM INTELLIGENCE
In this section discuss the swarm intelligence, the swarm
intelligence plays vital role in the fields of load balancing and
jobs scheduling in public cloud networks. The swarm based
algorith ms estimated the optimization process of load
balancing and enhanced the performance of cloud computing.
The job allocation process used hybrid swam intelligence
algorith m. The hybrid swarm intelligence algorith m is
combination of ant colony optimization and particle of swarm
optimization. The both swarm algorith m is memo ry based
and gives better optimization results instead of other swarm
based algorith m. The co mbination of swarm algorith m creates
the dual search space for the allocation of job. The job
allocation process gives the most dominated load for the
process of scheduling. For the mapping of job used particle
swarm optimization. The processing of ACO and PSO is
combined in terms of local loads set and global loads set. The
processing of loads done by particle swarm optimizat ion and
the verification of constraints function done by ant colony
optimization. The processing of ant colony optimizat ion gives
the value of Gbest and final process loads for load balancing
in cloud networks. in this section discuss PSO, ACO and
ACO-PSO.
ANT COLONY OPTIM IZATION (A CO)
The ant colony optimizat ion algorithm is proposed by Dorigo
and scholar. The proposed algorithm inspired by the behavior of
biological ants. The algorithm support the dynamic population
based process . The working principle of ant colony optimization
is theory of continuity and shortest path estimation. Ants are
creepy crawlies which live respectively. Since they are visually
impaired creatures, they find the most limited way from home to
sustenance with the guide of pheromone. The pheromone is the
concoction material kept by ants, which serves as basic
correspondence media among ants, in this way directing the
assurance of the following development[13-14]. Then again, ants
find the briefest way in view of power of pheromone saved on
various ways. By and large, power of pheromone and the length
of the way are utilized to reenact insect framework. The ant
colony optimization used here for the selection of local loads
process during the fusion process.
PARTICLE SWA RM OPTIM IZATION (PSO)
Particle swarm optimizat ion algorithm inspired by the concept
of bird’s fo rk. The property of b ird’s fork is fly in the sky with
IJCTA | July-August 2017
Available online@www.ijcta.com
ISSN:2229-6093
constant and optimal velocity and cannot drop in ground[16].
This biological property derived in fro m of algorith m. the
particle swarm optimizat ion work in two phase local phase
and global phase. The local phase is called Pbest and the
Global phase is called the Gbest. The value o f optimization in
local phase Pbest in set assigned to Global best Gbest[15][19].
The process of algorithm proceeds in terms of population and
controlled iteration. The movement of each particle is
coordinated by a velocity which has both magnitude and
direction. Each part icle position at any instance of time is
influenced by its best position and the position of the best
particle in a p roblem space. The performance of a part icle is
measured by a fitness value, which is problem specific[25-26].
III LOAD BALANCING
Load balancing helps in reasonable distribution of registering
asset to accomplish a high User fulfillment and appropriate
Resource use. High asset use and Proper load balancing helps
in limiting asset utilization. It helps in actualizing bomb over,
versatility, and staying away fro m bottlenecks. Load
balancing is a method that helped systems and assets by
giving a Maximu m throughput least reaction time. Stack
balancing is separating the movement between all servers, so
informat ion can be sent and got immediately with load
balancing[23]. In cloud environment, numerous calculations
are accessible that aides in appropriate movement. The
process of load describes here. The cloud server farm
comprises of L number of virtual machine. There are K
diverse assets. VM i has C_ ik amount of assets of type k.
There are M distinctive sorts of VMs that the clients can ask
for fro m the cloud specialist organization. Each kind of VM is
specified by the measure of various assets that it demands.
Type−𝑚 VM requests 𝑅𝑚𝑘 amount of resources of type 𝑘 .
For VM 𝑖, an 𝑀-dimensional vector𝑁 is said to be a feasible
VM -configuration if the given VM. In other words, 𝑁 is
feasible at VM 𝑖 if and only if
𝑀
� 𝑁𝑚 𝑅𝑚𝑘 ≤ 𝐶𝑖𝑘
𝑚=1
for all 𝑘.Welet 𝑁𝑚𝑎𝑥 denote the maximu m number of VMs of
any type that can be VMd on any VM . We consider a cloud
framework that hosts VMs for customers. A VM ask for fro m
a customer specifies the sort of VM the customer needs. We
call a VM ask for "an occupation." a vocation is said to be a
sort m work if a sort m VM is asked. We expect that time is
opened. We say that the extent of the occupation is S if the
VM should be facilitated for vacancies[4][8]. We expect that
S is obscure when a VM arrives. We next fine de the idea of
limit with regards to a cloud. Let DIJ(t)denote the
arrangement of sort m occupations that touch base toward the
very beginning space t and let 𝐷𝐼𝐽(𝑡) = 𝐷𝐼𝐽(𝑡) , i.e., the
quantity of sort m emp loy ments that land toward the get-go
opening t. DIJ(t) is thought to be a stochastic procedure which
is coupled. Crosswise over time and autonomous crosswise
545
 ISSN:2229-6093

Indra nath Sahu et al , International Journal of Computer Technology & Applications,Vol 8(4),544-550

LSI
over various sorts. We additionally accept that 𝐷𝐼𝐽(𝑡) ≤ 𝑇𝑎. Rf = Here Lsi is interference value of ants and
Wd
For each employ ment j, let Ta signify its size, i.e., the quantity
Wd is sum value of PSO space.
of availabilit ies required to VM the occupation. For every j
2. The PSO space creates the selection state for the
and 𝑆_𝑗is assumedtobe a (positive) number esteemed irregular
processing of mapping load.
variable autonomous of the entry procedure and the sizes of max (𝑅𝐹) −𝐹(𝑠)
every other emp loyment in the framework[9-10]. The
𝐹𝑆= � 𝑚𝑎𝑥
( 𝑊𝑆 ) 𝑖𝑓 𝑠𝑖 ∈ 𝑓𝑗 (3)
circulat ion 𝑜𝑓 𝑆_𝑗 is thought to be indistinguishable for all ℎ=1:

occupations of same sort. At the end of the day, for each
typem, the occupation sizes are 𝑖. 𝑖. 𝑑. Let 𝑅𝑖𝑗 be the asset chief
𝑅, 𝑖. 𝑒. , 𝑅 = { 𝑉𝑀 ∈ 𝑇𝐴: 𝑃(𝐷𝑖𝑗 = 𝑇𝐴) > 0}. The emp loy ment
measure dissemination is expected to fulfill the acco mpanying
presumption.
IV PROPOS ED METHODOLOGY
The following parameter is used for the process of job
allocation methods, x1, x2,…………..,xn is the loads
component of user side over cloud network. W is the Wight
factor for the sum of loads, 𝜏 is the value of phero mones of
ants, v1 and v2 is velocity of particle agents, c1 and c2 is
constants value of particle. The process of selection step given
below.
Step1. Define the value of loads set S1{x1,x2,………….xn}
with population random population of PSO.
a. Assign the velocity of particle V1=0,V=0 and
W=0
b. Fitness constrains function for the selection of ants
𝐹(𝑠) =
(𝐹𝑓𝑑 −𝐹𝑝𝑓)
, 𝑤𝑖𝜖𝑆(𝑥1, 𝑥2 … . . 𝑥𝑛) … … … … . . (1)
𝐹𝑑∗𝑓𝑝
Here Ffd is assigned resource and Fpf is allocated
and w is set of resource mapping co mponent of
sum sets
The selected loads components set the value of
ants𝐹 = {𝑓𝑎1 …………….. 𝑎𝑛} . these ants value proceed
for the estimat ion of local best, the local best
function define as
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
3. create the relative FS d ifference value
n m
Rd = � � (xi − fs ) … … … … … … . . (4)
fd=1 pf=1
4. if the value of Rd is zero the job allocation process is
done.
5. Else the process of selection goes into steps 2
6. if loads selection state is empty the process of
selection is terminated.
V. EXPERIMENTAL RES ULT ANALYS IS
To interface with different administrations in the cloud and to
keep up the assets in a balancing way to satisfy the necessity
of assets/foundation by those administrations, a few
procedures are required. Considering a center arrangement of
elements in the three basic cloud admin istrations, for examp le,
Infrastructure as a Service (IaaS), Plat form as a Service (PaaS)
and Software as a Serv ice (SaaS). To assess the execution of
distributed computing systems in distributed computing
situations for the heap adjust and asset administration, here we
are utilizing different quantities of procedures, For the further
execution and correlation for execution assessment we utilized
java programming dialects with NetBeans IDE 8.0.1 devices
for finish usage/comes about process.

𝑆 𝛽
⎧ ( 𝜏𝑖 )𝛼 �𝐿𝐼 𝑗 �
⎪ 𝑖
𝑖𝑓 𝑖 ∉ 𝑆𝑗 (2)
𝑃𝑏𝑒𝑠𝑡 = 𝛼 𝑗 𝑆 𝛽
⎨∑𝑔 ∉𝑆𝑗�𝜏𝑔 � �𝐿𝐼𝑔 �
⎪
⎩ 0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

Here 𝜏𝑖 is phenomenon value of ants and LI is value

of least interface of ants.

Step2. The Pbest value set to Gbest

Input the job allocation state of Gbest Value

1. Calculate the value of relat ive mapping set in Gbest

set

IJCTA | July-August 2017 546

Available online@www.ijcta.com
 ISSN:2229-6093

Indra nath Sahu et al , International Journal of Computer Technology & Applications,Vol 8(4),544-550

Figure 1: window show that the configuration of user base and Figure 4: window show that the configuration of user base and
data center (5x5) our implementation using ACO method. data center (5x5) our implementation using ACO method.

Figure 2: window show that the configuration of user base and Figure 5: window show that the configuration of user base and
data center (5x5) our implementation using PSO method. data center (5x5) our implementation using Proposed method.

COMPARATIVE PERFORMANCE

Data Used
Overall
Center Method
Response
Processing
Average ACO
300.772 0.366
Time
Minimu m
241.639 0.022
Time
Maximu m
370.639 0.638
Time
Average PSO
295. 392 0.269
Time
Minimu m
236.639 0.020
Time
Maximu m
365. 392 0.511
Figure 3: window show that the configuration of user base and Time
data center (5x5) our implementation using Proposed method. Average Proposed
293. 212 0.245
Time
Minimu m
232.269 0.018
Time
Maximu m
361. 396 0.488
Time
Table 1: Shows the Response Time and Processing Time
analysis using ACO, PSO and Proposed method for 5 user
base and 5 data center.

Data Used
Overall
Center Method
Response
Processing
Average ACO
270.255 0.332
Time
Minimu m
238.892 0.021
Time
Maximu m 344.861 0.610

IJCTA | July-August 2017 547

Available online@www.ijcta.com
 ISSN:2229-6093

Indra nath Sahu et al , International Journal of Computer Technology & Applications,Vol 8(4),544-550

Time
Average PSO Comapartive Data Center Processing Time
Time
266. 339 0.277 using ACO, PSO and Proposed Method
Minimu m 0.7
224.632 0.018
Time
0.6
Maximu m
339. 382 0.486 0.5
Time
Average Proposed 0.4
247.685 0.268
Time
0.3
Minimu m
220.913 0.017
Time 0.2
Maximu m 0.1
328.522 0.475
Time
Table 2: Shows the Response Time and Processing Time 0
analysis using ACO, PSO and Proposed method for 5 user
base and 5 data center.

Comapartive Overall Response Time using Figure 7: window show that the performance of data center
ACO, PSO and Proposed Method processing time using ACO, PSO and Proposed method with
configuration of user base and data center (5x5).
400

350 Comapartive Overall Response Time using

ACO, PSO and Proposed Method
300 400
350
250
300
200 250
200
150 150
100
100
50
50 0

Figure 8: window show that the performance of overall

response time using ACO, PSO and Proposed method with
Figure 6: window show that the performance of overall configuration of user base and data center (5x5).
response time using ACO, PSO and Proposed method with
configuration of user base and data center (5x5).

IJCTA | July-August 2017 548

Available online@www.ijcta.com

Indra nath Sahu et al , International Journal of Computer Technology & Applications,Vol 8(4),544-550
Comapartive Data Center Processing Time
using ACO, PSO and Proposed Method
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0 Wu and Yonggang Wen, Towards End-to-End Secure
Figure 9: window show that the performance of data center
processing time using ACO, PSO and Proposed method with
configuration of user base and data center (5x5).
VI. CONCLUS ION & FUTUR E SCOPE
The management of resource in public cloud environments is
big issue. For the management of cloud resource used
scheduling technique. The process of scheduling technique
improves the efficiency of cloud environ ments. The coupling
of virtual machine enhanced the performance of load
balancing technique. nowadays various authors used various
methods for the coupling of virtual mach ine. in this paper
used hybrid job allocation technique for the sharing of load
during the overload situation in job allocation process in
public cloud environ ments. The proposed algorithm used
ACO-PSO function for the decision of the situation of load
condition in cloud environments. For the testing of algorithm
used various scenario of data center and virtual mach ine with
different platform of operating system. Our proposed
algorith m reduces the overload situation and enhanced the
capacity of public cloud environments approx. 10-15% of
pervious work of load balancing. The A CO and PSO based
load balancing policy is very efficient for the proper allocation
of job according to dedicated v irtual mach ine. The partial
allocation of job allocation policy faced problem of min imu m
time span. The min imu m time span factor affects the
efficiency factor of proposed policy.
References
[1] Kui Ren, Cong Wang and Qian Wang, Security
Challenges for the Public Cloud, IEEE, 2012, 69-73.
[2] Yongjun Ren, Jian Shen, Jin Wang, Jin Han and
Sungyoung Lee, Mutual Verifiable Provable Data
Auditing in Public Cloud Storage, Mutual Verifiable
IJCTA | July-August 2017
Available online@www.ijcta.com
ISSN:2229-6093
Provable Data Auditing in Public Cloud Storage, 2015,
317-323.
[3] Wayne Jansen and Timothy Grance, Gu idelines on
Security and Privacy in Public Cloud Co mputing, NIST,
2011, 1-70.
[4] Ang Li, Xiaowei Yang, Srikanth Kandula and Ming
Zhang, Comparing Public- Cloud Providers, IEEE,
2011, 50-53.
[5] Gaochao Xu, Junjie Pang and Xiaodong, A Load
Balancing Model Based on Cloud Partit ioning for the
Public Cloud, Tsinghua Science And Technology, 2013,
34-39.
[6] Huijun Xiong, Xin wen Zhang, Danfeng Yao, Xiao xin
Content Storage and Delivery with Public Cloud, ACM,
2012, 1-10.
[7] Jiawei Yuan and Shucheng Yu, Secure and Constant
Cost Public Cloud Storage Auditing with Deduplication,
IEEE, 2013, 1-9.
[8] Gabriele D’Angelo, Parallel and Distributed Simulat ion
fro m Many Cores to the Public Cloud (Extended
Version), arXiv, 2014, 1-9.
[9] Lei Xu, Xiao xin Wu and Xinwen Zhang, CL-PRE: a
Cert ificateless Proxy Re-Encryption Scheme for Secure
Data Sharing with Public Cloud, A CM, 2012, 1-10.
[10] Katrina LaCurts, Shuo Deng, A meesh Goyal and Hari
Balakrishnan, Choreo: Net work-Aware Task Placement
for Cloud Applications, ACM, 2013, 1-14.
[11] Joanna Kołodziej, Samee Ullah Khan, Lizhe Wang and
Albert Y. Zo maya, Energy ficient
ef genetic -based
schedulers in computational grids, John Wiley & Sons,
Ltd., 2012, 1-21.
[12] M. Abu Sharkh, M. Jammal, A. Shami and A. Ouda,
Resource Allocation in a Network-Based Cloud
Co mputing Environ ment: Design Challenges, IEEE,
2013, 1-7.
[13] Qi Zhang, Quanyan Zhu and Raouf Boutaba, Dynamic
Resource Allocation for Spot Markets in Cloud
Co mputing Environ ments, IEEE, 2011, 1-8.
[14] Javier Espadas, Arturo Molina, Gu illermo Jiménez,
Martín Molina, Raúl Ramírez and David Concha, A
tenant-based resource allocation model fo r scaling
Software-as-a-Serv ice applications over cloud
computing infrastructures, Future Generation Co mputer
Systems, 2013, 273–286.
[15] M. Reza Rahimi, Nalini Venkatasubramanian and
Athanasios V. Vasilakos, MuSIC: Mobility-Aware
Optimal Service A llocation in Mobile Cloud Co mputing,
1-8.
[16] K. Shyamala and T. Sunitha Rani, An Analysis on
Efficient Resource Allocation Mechanisms in Cloud
Co mputing, Indian Journal of Science and Technology,
2015, 814– 821.
[17] Mohammad Hammoud, M. Suhail Reh man and Majd F.
Sakr, Center-of-Grav ity Reduce Task Scheduling to
Lower MapReduce Network Traffic, IEEE, 2013, 1 -10.
549
 ISSN:2229-6093

Indra nath Sahu et al , International Journal of Computer Technology & Applications,Vol 8(4),544-550

[18] Keke Chen, James Powers, Shumin Guo and Fengguang

Tian, CRESP: To wards Optimal Resource Provisioning
for MapReduce Co mputing in Public Clouds, IEEE,
2014, 1-15.
[19] Hadi Goudarzi and Massoud Pedram, Multi-dimensional
SLA-based Resource Allocation for Multi-Tier Cloud
Co mputing Systems, IEEE, 2011, 1-8.
[20] Balaji Palanisamy, Aameek Singh, Ling Liu and
Bhushan Jain, Purlieus: Locality-aware Resource
Allocation for Map Reduce in a Cloud, ACM, 2011, 1-
12.
[21] Ed mund K. Burke, Matthew R. Hyde, Graham Kendall
and John Woodward, Automating the Packing Heuristic
Design Process with Genetic Programming, ACM , 2012,
1-25.
[22] Andrei Tchernykh, Uwe Schwiegelshohn, Ramin
Yahyapour and Niko lai Ku zjurin, On-line hierarchical
job scheduling on grids with admissible allocation,
Springer, 2010, 545-552.
[23] Lu Huang, Hai-shan Chen and Ting-ting Hu, Survey on
Resource Allocation Po licy and Job Scheduling
Algorith ms of Cloud Co mputing, Journal of Software,
2013, 480-487.
[24] Jinn-Tsong Tsai Jia-Cen Fang and Jyh-Horng Chou,
Optimized task scheduling and resource allocation on
cloud computing environment using improved
differential evolution algorithm, Elsevier, 2013, 3045–
3055.
[25] Ruay-Shiung Chang and Chih-Yuan Lin, Chun-Fu Lin,
An Adaptive Scoring Job Scheduling algorith m for grid
computing, Information Sciences, 2012, 79–89.
[26] Raksha Sharma, Vishnu Kant Soni, Manoj Ku mar
Mishra and Prachet Bhuyan, A Survey of Job
Scheduling and Resource Management in Grid
Co mputing, International Science Index, Co mputer and
Information Engineering, 2010, 736-741.
[27] Jun Wu, Xin Xu, Pengcheng Zhang and Chunming Liu,
A novel mult i-agent rein forcement learning approach for
job scheduling in Grid co mputing, Future Generat ion
Co mputer Systems, 2011, 430– 439.
[28] Fatos Xhafa and Ajith Abraham, Co mputational models
and heuristic methods for Grid scheduling problems,
Future Generation Co mputer Systems, 2010, 608–621.
[29] Mustafizur Rah man, Rafiul Hassan, Rajiv Ran jan and
Rajku mar Buyya, Adaptive work flow scheduling for
dynamic grid and cloud computing environment, John
Wiley & Sons, Ltd., 2013, 1816-1842.
[30] Sowmya Su ryadevera, Jaishri Chourasia, Sonam Rathore
and Abdul Jhummarwala, Load Balancing in
Co mputational Grids Using Ant Colony Optimizat ion
Algorith m, International Journal of Co mputer &
Co mmunicat ion Technology, 2012, 20-23.

IJCTA | July-August 2017 550

Available online@www.ijcta.com