732 Int. J. Computer Aided Engineering and Technology, Vol. 10, No.

6, 2018

Unevenness measurement using the support vector

machine and dynamic multiservice load balancing
with modified genetic algorithm in cloud-based
multimedia system

Eswaran Sivaraman* and R. Manickachezian

Department of Computer Science,
NGM College,
Pollachi – 642 001, Coimbatore, India
Email: sivaraman.eswaran@gmail.com
Email: chezian_r@yahoo.co.in
*Corresponding author

Abstract: Cloud computing is the most concerned and growing field in the real
world, which is used by various fields to handle and manage the multimedia
application due to availability of more amount of resources. At the time of
multiple multimedia requests entering into the cloud server, fining and
provisioning the required resources for the incoming multimedia requests of
different king would be a more difficult task. In the existing system centralised
hierarchical cloud-based multimedia system (CMS) is introduced which
consists of elements such as resource manager, cluster head and server clusters.
This word can assign the user required resources effectively with reduced cost.
Also, existing research overcomes the load balancing problem which might
occur at the time of multiple multimedia services with different characteristics
entering into the system and allocating them in the server without considering
their load capacity level using genetic algorithm. However, genetic algorithm
would fail to find the optimal resource with optimal load level due to local
search optimisation problem. A, load balancing cannot be done effectively in
case of arrival of multimedia tasks with varying characteristics. This problem is
resolved in the proposed research methodology by introducing the novel load
balancing system in which both task unevenness problems and the genetic
algorithms local search optimisation problems are resolved. This paper
proposed an effective multimedia load balancing (MLB) scheme for CMS
using support vector machine (SVM) and dynamic multiservice load balancing
with adaptive genetic algorithm (AGA) (MLB-SVM-AGA). In this work, SVM
is introduced for the purpose of quantifying the unevenness in the utilisation of
multiple resources on a resource manager on the client side and confirmed at
the server side in the each cluster. Unevenness scenario can be modelled as a
mathematical hyperplane problem, but in most cases it is computationally
intractable. Here, AGA is used for the purpose of solving the problem of
dynamic load balancing. The experimental evaluation is conducted in the
CloudSim toolkit for both proposed and existing research methodologies. The
performance evaluation is done and the results demonstrate that AGA approach
is able to dynamically spread the multimedia task load equally.

Keywords: cloud computing; adaptive genetic algorithm; AGA; load

balancing; meta heuristic; cloud-based multimedia system; CMS; support
vector machine; SVM; unevenness.

Copyright © 2018 Inderscience Enterprises Ltd.

 Unevenness measurement using the SVM and dynamic multiservice load 733

Reference to this paper should be made as follows: Sivaraman, E. and

Manickachezian, R. (2018) ‘Unevenness measurement using the support vector
machine and dynamic multiservice load balancing with modified genetic
algorithm in cloud-based multimedia system’, Int. J. Computer Aided
Engineering and Technology, Vol. 10, No. 6, pp.732–747.

Biographical notes: Eswaran Sivaraman is a PhD candidate in the Research

Department of Computer Science at NGM College affiliated to Bharathiar
University, Coimbatore. He received his Bachelor and Master’s degrees from
Bharathiar University, Coimbatore. Currently, he is an Assistant Professor of
Computer Science and Engineering at Dr.NGP Institute of Technology,
Coimbatore. His research interests include cloud computing and big data
analytics. He is a life member of the Indian Society for Technical Education
and Computer Science of India.

R. Manickachezian received his MSc in Applied Science from PSG College of

Technology, Coimbatore, India in 1987. He has completed his MS degree in
Software Systems from Birla Institute of Technology and Science, Pilani,
Rajasthan, India and PhD degree in Computer Science from School of
Computer Science and Engineering, Bharathiar University, Coimbatore. He
served as a Faculty of Mathematics and Computer Applications at P.S.G
College of Technology, Coimbatore from 1987 to 1989. Presently, he is
working as an Associate Professor of Computer Science at NGM College
(Autonomous), Pollachi. He has published 150 papers in various international
journals and conferences. He is a recipient of many awards like Desha Mithra
Award, GRABS Best Researcher Award and several other best paper awards.
His research focuses on network databases, data mining, network security,
bio-informatics and distributed computing.

This paper is a revised and expanded version of a paper entitled ‘Unevenness

measurement using the support vector machine and dynamic multiservice load
balancing with modified genetic algorithm in cloud-based multimedia system’
presented at IEEE Sponsored International Conference on Innovations in
Information, Embedded and Communication Systems (ICIIECS ‘16),
Karpagam College of Engineering, India, 17–18 March 2016.

1 Introduction

In general, cloud-based multimedia system (CMS) (Zhu et al., 2011) includes

infrastructure, platforms, and software to support an enormous amount of clients
concurrently to accumulate and process their respective multimedia application data in a
distributed approach and satisfy different multimedia QoS requirements through the
internet. The majority of multimedia applications need substantial computation, and are
habitually executed on mobile devices with constrained power, in order that the support
of cloud computing is strongly essential. CMS supports vast number of users’
requirements for a variety of multimedia computing and storage services through the use
internet (Lai et al., 2010; Hui et al., 2011). In this work, a centralised hierarchical CMS is
considered which is composed of a resource manager and several server clusters, each of
which is coordinated through a cluster head (CH). Every time when the CMS obtains
clients’ task requests of multimedia services, the resource manager of the CMS allocates
those requests to different server clusters in accordance with the features of the requested
734 E. Sivaraman and R. Manickachezian

tasks. Then, the CH of each server cluster allocates the assigned task to a server of the
server cluster. It is not extremely complicated to supervise the load of each server cluster
considerably have an effect on the performance of the entire CMS. On the whole, the
resource manager is in hunt for fairly distributing the task load across server clusters, as a
result, it is of significance and attention to be capable of tackling load balancing in the
CMS.
A few notable previous works on load balancing for the CMS are as follows: Wen
et al. (2011) have proposed an effective load balancing for CMS called CMLB for the
purpose of allocating and schedule resources for different user requests in an extremely
reasonable way by means of providing a cloud-based framework, which offers a better
solution to the inbuilt issues of multimedia applications, like computational complexity
and QoS provisioning. Wen et al. (2011) and Tian et al. (2011) have formulated a
dynamic and integrated load balancing scheduling (DAIRS) algorithm for the purpose of
cloud data centres, with the aim of developing an integrated measurement for the overall
imbalance level of a cloud data centre, in addition to the average imbalance level of each
server. In Nan et al. (2011), resource allocation is optimised for multimedia cloud in
accordance with the queuing model. Lin and Qi (2010) developed a self-organising
model for the purpose of managing cloud resources during the non-existence of
centralised management control. Authors in Shi and Zhan (2009) completely
concentrated on the maximisation of the steady-state throughput through deploying
resources for the independent equalised tasks in the cloud. Teng and Magoules (2010)
presented a resource pricing and equilibrium allocation policy in accordance with the
consideration of cloud users’ struggle for inadequate resources. Investigations have found
that servers in several existing CMLB are typically carried out in accordance with the
even resource requirement only, not under unevenness measurement-based load
balancing (Garey and Johnson, 1979).
In the existing work, an genetic algorithm (GA) (Aarts et al., 2005; Zhang et al.,
2012) is proposed for the considered dynamic load balancing problem for CMSs. GA has
several applications in fields like computer science and engineering, for instance, fast
covariance matching (Gonzalez-Longatt et al., 2012), optimal electric network design
(Ma and Szeto, 2004), among others. However, in general, the selection process of GA
requires external input parameter to carry out load balancing task which requires extra
time (Zhang and Szeto, 2005). In order to solve this complication, idea of mutation
matrix is applied during the development of GA namely adaptive genetic algorithm
(AGA) (Szeto and Zhang, 2006; Yang and Guo, 2006). The experimental results
demonstrate that AGA approach is able to dynamically spread the multimedia task load
equally.

2 Problem formulation and system model

The proposed load balancing problem for the CMS is an extended version of Hui et al.
(2011). This section initially provides the system overview of the CMS, and subsequently
formulates concerned problem. Also, this work requires predicting the future resource
requirements of resource manager to every cluster. As explained earlier, the major
concentration is on multimedia service applications. One resolution is to look within the
resource manager for application level statistics, e.g., by means of parsing logs of
awaiting requests. To carry out this process, it requires modification of the resource
 Unevenness measurement using the SVM and dynamic multiservice load 735

manager which might not always be possible. On the other hand, make prediction in
accordance with the past external behaviours of resource manager. In this work, the
concept of support vector machine (SVM) is introduced for the purpose of quantifying
the unevenness in the deployment of multiple resources on a resource manager at client
side and confirmed at the server side in the each cluster. On the whole, CMSs can be
partitioned into two categories: centralised and decentralised. Here, the centralised CMS
is taken into account and it is illustrated in Figure 1, which includes a resource manager
and several server clusters each of which is coordinated through a CH.

Figure 1 Illustration of a centralised hierarchical CMS (see online version for colours)

2.1 Cloud-based multimedia system

1 U is the collection of vertices that stand for the server clusters of the CMS.
2 V indicates the set of vertices that stand for clients.
3 E represents the set of edges between U and V in which each edge eij  E stands for
the link among server cluster i  U and client j  V.
4 I: U → N represents a function utilised to limit that server cluster i can only handle
multimedia tasks of type Ii.

5 ψt: V → N represents a function utilised to represent that client j requests the

multimedia service of category ψ tj during the tth time step.

6 q: U ∪ V → N is a function utilised to indicate the server cluster i can provide the

multimedia service of QoS qi.
736 E. Sivaraman and R. Manickachezian

7 rt: U ∪ V → N represents a function utilised to represent that client j requests the

multimedia service of QoS requirement rjt during the tth time step.

wt: E →R+ indicates the weight function connected with edges, where w ijt stands for the
wt value that represents the cost for sending multimedia data between server cluster i and
client j during the tth time step, which is given as below:

­°f if d ijt o f or Ii z ψ j
w ijt ® t t (1)
°̄d ijlij otherwise

where d ijt stands for the network proximity among server cluster i and client j; lijt
indicates the traffic load of the link among server cluster i and client j that is given as
below,

lijt ¦u
kK i
t
ikj Cik (2)

t
where Ki stands for the set of servers in server cluster i, u ikj indicates the server
utilisation ratio of server k in server cluster i as a result of client j, and Cik represents its
capacity. During this step, the server utilisation resource ratio of server k in server cluster
i, for a while bottleneck resources complication takes place because of the increased
number of the user request in the multi service Multimedia System. In order to solve this
complication, in this work unevenness uneven of the server utilisation resource ratio is
determined by means of the application of the SVM calculation. The SVM objective
function is used to quantify the unevenness in the exploitation of multiple resources on a
t
server in every cluster. The labelled cloud resources is given as the form {(u ikj , R i )}iN 1 ,
t
with u ikj  {1,  1}, Ri  Rn make use of a SVM formulation. For a kernel on data
points, k(u, z): Rn × Rn → R, represents the inner product, Φ(R). Φ(z), in an unrealised
algorithm discovers a hyperplane which potentially separates the cloud resources through
dual formulation maximise resource utilisation,
N
1
un even (α) Yi (α) ¦α  2 ¦α α u
i 1
i
ij
i
t t
j ikj u ikl k  uikjt , u iklt  (3)

It must be noted that the proximity d ijt in the middle of server cluster i and client j in (1)
is essential to be measured during every time step because of dynamic change of network
topology. This work uses the setting of Hui et al. (2011) in accordance with the
distributed binning scheme in Lu and Zhou (2008) to compute the proximity d ijt . Similar
to previous works, compute the proximity in the middle of the server cluster and the
client as a distance between them (Dai et al., 2006).

Minimise λ
¦ ¦ xw iU jV
t
ij
t
ij
§
 (1  λ) ¨¨1 
¦ ¦ jV iU
x ijt ·
¸ (4)
¸
¦ w iV
max © V ¹
 Unevenness measurement using the SVM and dynamic multiservice load 737

Subject to

¦ x d 1, j  V
iU
t
ij (5)

¦ x l d un (α) d ¦ C
jV
t t
ij ij even
kK i
ik , i  U (6)

x ijt Ii x ijt ψ tj i  U, j  V (7)

x ijt q i t x ijt rjt i  U, j  V (8)

x ijt  {0, 1} i  U, j  V (9)

where x ijt represents an indicator variable defined as given below:

­1 if client j is assign et to server cluster i at the t th time step

x ijt ® (10)
¯0, otherwise

With the above model, indicator variable x ijt in (8) is utilised for the purpose of
determining whether to allocate the link eij among server cluster i and client j in the entire
bipartite graph U × V. The objective (4) of the model is a weighted sum of two terms: the
first is to reduce the overall weighted values of the bipartite graph, i.e., to diminish the
total cost of transmitting multimedia data during the tth time step, at the same time the
second is to increase the number of link assignments. The objective of the problem is to
allocate multimedia service load in order that total cost of transmitting multimedia data is
minimised and the quantity of served clients is maximised.

3 Proposed unevenness measurement and dynamic multiservice load

3.1 Balancing methodology

The modelling of a dynamic multiservice load balancing in cloud-based multimedia
system (CMS-dynMLB) problem at every fixed time step can be done as an integer linear
programming issue as said above. Therefore, this work introduces an AGA for resolving
the problem of dynamic load balancing and SVM in order to quantify the unevenness
seen in the usage of multiple resources on a resource manager at the client side. The
AGA is a random global search technique that has been successful for several kinds of
optimisation problem which is a modified version of the GA. AGA is termed as a global
search heuristic. The proposed AGA is better than the GA due to its ability to resolve the
local optimisation issues by finding the most suitable solutions that resources within
multiple server cluster where algorithm will only look for resources within the server
cluster. And also can change the resources for the multimedia tasks automatically
whenever load balancing needs to be done. If the required resources that matches with the
multimedia tasks is not found in the current server cluster then it will be found in the
other server clusters dynamically where the GA cannot do it. It will only look for solution
in the current server cluster.
738 E. Sivaraman and R. Manickachezian

Dynamic load balancing algorithm is given in Algorithm 1, which is described as

follows. At each time step t, Algorithm 1 does its iteration on t for the purpose of
reallocating the network load assignments in order to adapt according to the time change.
As a first step, line 2 builds a entirely weighted bipartite graph Gt. Next, the infeasible
cases are removed and then AGA is applied to find a locally optimal load assignment
solution. It is to be noted that solutions feasible are limited to (3), (5), (6), (7) and (8).
Algorithm 1, line 3 eliminates the links in Gt thereby violating (7) and (8), when the other
two constraints will be taken into consideration in AGA (Algorithm 3). Before the usage
of AGA for the calculation of solutions, the information of {w ijt }, {lijt } and uneven(D) is
needed, hence line 4 of Algorithm 1 makes a call to Algorithm 2 for obtaining that
information. Next to that, line 5 of Algorithm 1 calls the algorithm, which is detailed in
Algorithm 3 to calculate the final load assignment solution.
Algorithm 1 Dynamic load balancing algorithm

1 For t = 1, 2, … do
2 Consider complete weighted bipartite graph Gt remove the links in Gt violating (7) and (8),
3 Compute {lijt } and {w ijt } by calling algorithm 2, calculate uneven(D)
4 Allocate {x ijt } by calling algorithm 3
5 End for

The concept of SVM is introduced with the aim of quantifying the unevenness in the
usage of multiple resources on a cluster to each server. Let n be the number of resources
considered and ri be the utilisation made of the ith resource. Describe the resource
uneven(D) of a server p as defined in equation (3). Proposed work unevenness uneven of the
server utilisation resource ratio is computed by means of the SVM calculation. The
concept of SVM is introduced with the aim of quantifying the unevenness in the usage of
multiple resources on a cluster to each server. Provided labelled cloud resources of the
form {(u ijt , R i )}iN 1 , with u ijt  {1,  1}, Ri  Rn, a SVM formulation is used. For a kernel
on data points, k(R, z): Rn × Rn → R, which is the inner product, Φ(R). Φ(z), in an
unrealised algorithm is able to find a hyperplane which helps best in separating the cloud
resources by reducing
N
1
¦ξ
2
τ(w, ξ) w C i (11)
2 i 1

With regard to Yi(w, ui) + b) and 1 – ξi and ξi ≥ 0, where C > 0, here C is treated as the
t
resource utilisation threshold value u ikj is the tradeoff occurring between regularisation
and constraint violation. The decision function is sign (h(u)), where:
m
h(u) ¦ α y k  u, u   b
j 1
j j j (12)

For the purpose of clarity, with a slight abuse of notation the servers xj: j  {1, 2, …, m}
will be known as support vectors.
 Unevenness measurement using the SVM and dynamic multiservice load 739

Hence, in general terms, m kernel computations are required for classifying a point
with a kernelised SVM and all m support vector has to be stored. For linear kernels to do
better since, k(u, z) = (u, z), so h() can be formulated as h(u) = (w, u) + b, where.

¦
m
w α j y j k  u, u j .
j 1

Algorithm 2 computes {lijt } and {w ijt }. Firstly, line 1 regards each client j  V for
computing its weight w ijt with each server cluster i. It is to be recalled that the distributed
binning scheme is to be applied for the calculation of the proximity, which is explained in
detail in the earlier section. Therefore, lines 2–3 compute the landmark order lj of client j,
and then, for each of the available server cluster i in the set Uj which includes the server
clusters that are connected to client j, lines 6 and 7 compute the landmark distance li of
server cluster i. In lines 8 to 14, when lj = li (i.e., client j and server cluster i are in the
same landmark bin), in reality, the network proximity between them is t be measured, and
then calculate their lijt and w ijt values; otherwise, let the lijt and w ijt values be directly ∞.

Algorithm 2 Calculate weights

1 For each client j  V do

2 Measure the latency form client order li of client j
3 Obtain the set of available server clusters Uj
4 For each i  Uj do
5 Measure the latency from server cluster i to each landmark
6 Compute the landmark order li of server cluster i If li = lj then
7 Measure the network proximity d ijt between server cluster i and client j
8 Measure server utilisation ratios u ikj
t
for all k  K calculate lijt and w ijt by equations (2)
and (1), respectively
9 Else
10 w ijt lijt f
11 End if
12 End for
13 End for

With the values of {lijt } and {w ijt } calculated by Algorithm 2, they are ready to have the
AGA applied for the computation of the optimal load assignment in Algorithm 3, which
is described as follows. The AGA works in a different manner on the basis of two
parameters: the input bipartite graph Gt and the input time step t. It is to be noted that Gt
might not be a complete graph anymore, since the links violating some problem
restrictions have been eliminated in line 3 of Algorithm 1. Let η and τ indicate the size
and the number of generations, correspondingly. In lines 1 to 5, the generation of initial
population of η chromosomes is carried out in two scenarios. When t = 1 (i.e., it is the
first time for running the AGA), then the initial population satisfying the remaining two
740 E. Sivaraman and R. Manickachezian

constraints which were not considered yet [i.e., (5) and (6)] is randomly generated.
Otherwise existed, line 4 makes use of Pτt 1 as the initial population at the tth time step.
Consequently, the while loop in lines 7 to 23 iterates at most τ iterations, each of
which generates a population Pjt 1 of chromosomes, i.e., the subsequent population at the
tth time step. Line 8 chooses a number of chromosomes from the population Pjt to act as
the parental pool Qit . Lines 9 and 10 conduct crossover and mutation operators to the
population Pjt with corresponding probabilities pc and pm. Line 15 substitutes the worst
chromosomes in Pjt with the elite and random immigrants. After finishing the while
loop, the best found chromosome is provided as the output solution at the tth time step.
Algorithm 3 AGA (graph Gt, time step t)

1 If t = 1 then
2 Generate and evaluate the initial population Pjt of size η where each chromosome have to
satisfy (4) to (5) and (6), evaluate population diversity
3 Else
4 P0t m Pt t 1
5 End if
6 i←0
7 While i < τ or the convergent condition is not achieved do
8 Select the parental pool Q tj from Pjt
9 Reproduce a new population Pj t of size η by performing crossover procedure on pairs of
chromosome in Q tj with probability pm
10 Repair each infeasible chromosome in Pj t
11 evaluate Pj t
12 if f(Xj(t)) > f(x(t)) then
13 a number of the best chromosome is found from Pjt 1 generate and evaluate new fitness
14 end if
15 replace the worst chromosome in Pi t with the above elite and random immigrants
Pjt 1 m Pj t
16 j←j+1
17 End while
18 Output the most excellent chromosome as the solution during the ith time step

3.2 Basic definitions of AGA

For the purpose of using GA for solving the CMS-dynMLB problem, first the
fundamental elements of GA are defined (i.e., chromosome, population, fitness function)
for the problem is given as follows.
 Unevenness measurement using the SVM and dynamic multiservice load 741

x Population: One population denotes one generation. A population comprises of

countless chromosomes, and the most of it are dependent on the specified initial
population size. Here, η is utilised to represent the number of chromosomes.
x Chromosome: A resolution for the CMS-dyn MLB problem encloses all the indicator
variables {x ijt | i  U, j  V}. The solution is denoted by a chromosome in GA.
Noting that |U| = m and |V| = n, the solution for indicator variables {x ijt } is encoded
in the form of a series of decimal numbers with length n: < σ1, , σj, , σn > where
σj  {0, 1, 2, , m}stands for the link distribution of client j with the following two
scenarios.
x Population diversity: Usually, the size of population is obtained, while the diversity
of population is greater, which will lead to better generation. Consider a set Pjt with
tth generation population and η population size is taken into consideration. On the
basis of different types of individuals into m parts P1t , P2t , P3t …Pmt , it is evident that
m
∪ j 1
p j (t) p(t) for j  {1, 2, …, m} there are Pjt ∩ Pl t ‡. Set k1, k2 … km are

¦ k η. Delimiting the value of population

m
the size of P1t , P2t , P3t …Pmt , then j
j 1

¦ p log p , where p = k / η. From the

m
entropy of the t generation is E j j j j
j 1

entropy formulation, in the case of the individuals in the population different from
each other, that is m = N, the value of entropy reaches the maximum Emax = log N
and vice versa. Entropy will be maximum in the case of the different types of
individual population having even distribution. The value of population entropy will
transform with the modification in the diversity of population. When comparing the
value of current population entropy and the maximum value, the diversity of present
populations is analysed. Set a = Et / Emax and a  [0, 1].
If the value of a is greater, subsequently the amount of different individuals in the
present population is also larger or vice versa (Youchan and Feng, 2012).
x Improvement of crossover and mutation probability: In accordance with the
population entropy, the crossover probability and mutation probability is modified in
the following steps: in accordance with the diversity of contemporary populations
(i.e., population entropy), probability ranges are computed:
­  pc2  pc1 
°°pc1 (t) pc1  *at
2 (13)
®
°p (t) p   pc2  pc1  * 1  a 
°̄ c2 c2
2
t

where pc1, pc2 denotes the series of the initial crossover probability and pc2 > pc1: at
represents the tth population diversity. pc2(t), pc2(t) stands for the series of crossover
probability in tth generation population. In (13), at is larger, the crossover probability
is larger. On the contrary, it is smaller.
742 E. Sivaraman and R. Manickachezian

­  pm2  pm1 
°°p m1 (t) p m1  * 1  a t 
2 (14)
®
°p (t) p   p m2  p m1  * a
°̄ m2 m2
2
t

where pm1, pm2 denotes the range of initial mutation probability, and pm2 > pm1: at
represents the tth population diversity pm1(t), pm2(t), stands for the series of mutation
probability in tth generation population. In (14), at is larger, the mutation probability
is smaller. On the contrary, it is larger.
Based on the range and the fitness value, the rate of crossover and mutation
probability is acquired.

­ pc1 (t)  f avg  f c   pc2 (t)  f c  f min 

° f c  f avg
° f avg  f min
® (15)
° pc2 (t)  f avg  f c   pc3 (t)  f c  f min  c
° f t f avg
¯ f max  f avg

­ p m1 (t)  f avg  f c   p m2 (t)  f c  f min 

° f c  f avg
° f avg  f min
pm ® (16)
° p m2 (t)  f avg  f c   p m3 (t)  f c  f min 
° f t f avg
¯ f max  f avg

where fmax represents the maximum value of the population, favg represents the
average value of every generation population, fmin stands for the minimum value of
the population, f′ stands for the bigger value in the two individuals to cross, f stands
for the fitness value of the individual to mutate; pc1(t), pc2(t) stands for the upper and
lower limits of the crossover probability respectively after making the adjustment in
the first step. pc3(t) is a constant and pc3(t) < pc1(t) < 1; pm1(t), pm2(t) stands for the
upper and lower limits of the mutation probability following the process of adjusting
the first step. pm3(t) is a constant, and pm3(t) < pm1(t) < 1.
x Fitness function: It is the assessment for the determination of which chromosomes
are better or bad. It means, a larger fitness value indicates a worse chromosome.
Therefore, AGA targets at finding the chromosome with minimal fitness value.
Let the objective (3) of the concerned problem as the fitness function be given as
follows.

f  X(t)  λ˜ ¦¦ x w ¦ w t
ij
t
ij max  (1  λ) ˜ §1 
¨ ¦x t
ij | V |·
¸
(17)
iU jV jV © jV ¹

where X(t) is the profile of {x ijt }.

x Termination: When the difference of average fitness values among successive

generations in the most recent ten generations is not beyond 1% of the average of the
average fitness values of these ten generations, or the maximum generations are
accomplished, then AGA terminates. After termination, the best chromosome from
 Unevenness measurement using the SVM and dynamic multiservice load 743

the current population is selected, and its respective load assignment is provided as
the final solution.

4 Implementation and experimentation results

This section primarily describes the generation of the data that is employed in
experiments and about the experimental environment, and then provides the experimental
outcomes of different cases. Considering 20 server clusters (m = 20) and 100 clients
(n = 100). In general, the weight of each link is bounded inside the limit [0, 5].
Specifically, the normalising factor of the initial term in Objective (3) is 5 ∙ 100 = 500,
while that of the second term is 100. If the link is not feasible, its weight is set to 1,000,
which is observed as infinity in our experiments. In experiments, unless otherwise stated
in the rest of this paper, GA algorithm uses the parameter settings in Table 1. Tests with
simulation are done on an Intel Core i7-3770 CPU at 3.40 GHz with 16 GB memory. The
average running time for the determination of an assignment of an instance (i.e.,
20 generations) is approximately 0.0005 s. This indicates that GA has the capability of
coping with the CMS-dyn MLB problem efficiently.
This experimental setup is done and implemented using the CloudSim toolkit where
the number of server clusters, clients and multimedia tasks are generated using as
mentioned previously using CloudSim toolkit. The primary objective of this project is to
provide a generalised, and extensible simulation framework that enables seamless
modelling, simulation, and experimentation of emerging Cloud computing infrastructures
and application services. By using CloudSim, researchers and industry-based developers
can focus on specific system design issues that they want to investigate, without getting
concerned about the low level details related to cloud-based infrastructures and services.
Table 1 Parameters used in simulation

Parameter Value
Number of server clusters(m) 20
Number of clients (n) 100
Maximal weight 5
Weight of first objective (λ) 0.1
Maximum number of generations (τ) 200
Number of generation between two time steps 20
Number of chromosomes (η) 50
Size of the parent pool 50
Crossover rate (pc) 0.5
Mutation rate (pm) 0.02

Consequently, a comprehensive experimental analysis is conducted on adjustment of

parameters. In the first step, for the purpose of observing the convergence of the best cost
values in AGA scheme, the best cost values against the number of generations of AGA
under diverse parameters is plotted in Figure 2, from which every plot is convergent to a
744 E. Sivaraman and R. Manickachezian

predetermined value, implying that this GA has the capacity for making the solutions
convergent.

Figure 2 Static scenarios with numbers of server clusters (see online version for colours)

Figure 2 provides plots for different numbers of server clusters (m), where it makes more
sense that more server clusters (resources) converge with a faster rate between the GA
and MLB-SVM-AGA The highly converged solution is obtained in the proposed
MLB-SVM-AGA approach due to its capability of handling unevenness problem in every
iterations where the GA cannot handle the unevenness problem.

Figure 3 Static scenarios with η values (see online version for colours)

Figure 3 provides plots for η values in which it is again much reasonable that more
number of generations converge very fast between the GA and MLB-SVM-AGA. The
proposed method MLB-SVM-AGA yields constant and standard deviation in the
convergence rate falling due to handling of unevenness problem at the time of load
balancing by getting resources from the every server clusters that suits the requirement
without searching in the single server cluster.
 Unevenness measurement using the SVM and dynamic multiservice load 745

Figure 4 Static scenarios with pc = 0.5 values (see online version for colours)

As for the case of crossover and mutation rates, pc = 0.5 and pm = 0.02 are selected, due
to those settings having the best performance from Figure 4. MLB-SVM-AGA yields
better improvement by modifying the GA by adapting the dynamic adaptation by
resolving the local optimisation issue problem where the solution can be found globally.

Figure 5 Dynamic scenarios under m = 20 (see online version for colours)

With the goal of demonstrating the capability of MLB-SVM-AGA and GA approach

towards adapting the time changes, make the run of 200 generations of on the test
instance in a dynamic scenario, and the best cost values versus the iteration number under
m = 10 values. It is assumed in the dynamic scenario that all of the clients alter their
locations in each of the 20 generations in Figure 5, from which it is observed that every
time the clients have their location changed in each 20 generations, the cost value attains
a large value, and later has its convergence by MLB-SVM-AGA and GA approach.

5 Conclusions and future work

In this paper, the resource optimisation problem is studied in dynamic multimedia cloud
for the purpose of providing multi services with minimum resource cost. Here, the data
centre infrastructure is modelled as a CMS, which further can be modelled as a complete
746 E. Sivaraman and R. Manickachezian

weighted bipartite graph, and subsequently make use of the integer linear programming
problem for the purpose of capturing the association among the service response time and
the assigned resources. Also, this work studies the idea of SVM to measure the
unevenness in the consumption of multiple resources on a resource manager. This work
also studies the resource allocation problem in multiple service scenarios in a dynamic
manner. A practical multiservice dynamic scenario is taken into account, in which during
different time steps, clients can transform their locations, and each server cluster only
manage a particular category of multimedia task, in order that two performance
objectives were optimised simultaneously. The experimental results reveal that the
proposed scheme can considerably improve the performance of multimedia cloud data
centre based on multiple services. As a future work, a strong effort must be taken to
extend the behavioural characterisation of proximity malware to explain strategic
malware detection evasion with game theory is extremely a challenging process.

References
Aarts, E., Korst, J. and Michiels, W. (2005) ‘Simulated annealing’, Search Methodologies,
pp.187–210, Springer, USA.
Dai, C.H., Zhu, Y.F. and Chen, W.R. (2006) ‘Adaptive probability of crossover and mutation
genetic algorithm based on cloud model’, Proceedings of IEEE Information Theory Workshop,
pp.710–713.
Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of
NP-Completeness, W.H. Freeman, New York.
Gonzalez-Longatt, F., Wall, P., Regulski, P. and Terzija, V. (2012) ‘Optimal electric network
design for a large offshore wind farm based on a modified genetic algorithm approach’, IEEE
Systems Journal, Vol. 6, No. 1, pp.164–172.
Hui, W., Zhao, H., Lin, C. and Yang, Y. (2011) ‘Effective load balancing for cloud-based
multimedia system’, 2011 International Conference on Electronic and mechanical
Engineering and Information Technology (EMEIT), Vol. 1, pp.165–168.
Lai, C.F., Huang, Y.M. and Chao, H.C, (2010) ‘DLNA-based multimedia sharing system over
OSGI framework with extension to P2P network’, IEEE Systems Journal, Vol. 4, No. 2,
pp.262–270.
Lin, W. and Qi, D. (2010) ‘Research on resource self-organizing model for cloud computing’,
IEEE International Conference on Internet Technology and Applications, pp.1–5.
Lu, J. and Zhou, C., (2008) ‘A adaptive genetic algorithm based on evaluation of population
diversity’, Journal of Computer Simulation, Vol. 2, No. 55, pp.206–208.
Ma, C.W. and Szeto, K.Y. (2004) ‘Locus oriented adaptive genetic algorithm: application to the
zero/one knapsack problem’, Proceeding of the 5th International Conference on Recent
Advances in Soft Computing, RASC2004, Nottingham, UK.
Nan, X., He, Y. and Guan, L. (2011) ‘Optimal resource allocation for multimedia cloud based on
queuing model’, IEEE 13th International Workshop on Multimedia Signal Processing
(MMSP), pp.1–6.
Shi, H. and Zhan, Z. (2009) ‘An optimal infrastructure design method of cloud computing services
from the BDIM perspective’, IEEE Computational Intelligence and Industrial Applications,
Vol. 1, pp.393–396.
Szeto, K.Y. and Zhang, J. (2006) ‘Adaptive genetic algorithm and quasi-parallel genetic algorithm:
application to knapsack problem’, Large-Scale Scientific Computing, pp.189–196, Springer,
Berlin, Heidelberg.
 Unevenness measurement using the SVM and dynamic multiservice load 747

Teng, F. and Magoules, F. (2010) ‘Resource pricing and equilibrium allocation policy in cloud
computing’, IEEE International Conference on Computer and Information Technology,
pp.195–202.
Tian, W., Zhao, Y., Zhong, Y., Xu, M. and Jing, C. (2011) ‘A dynamic and integrated load
balancing scheduling algorithm for cloud data-centers’, IEEE International Conference on
Cloud Computing and Intelligence Systems, pp.311–315.
Wen, H., Chuang, L., Hai-ying, Z. and Yang, Y. (2011) ‘Effective load balancing for cloud-based
multimedia system’, IEEE International Conference on Electronic & Mechanical Engineering
and Information Technology, Vol. 1, pp.165–168.
Yang, L. and Guo, M. (2006) High-Performance Computing: Paradigm and Infrastructure, Wiley,
New York, NY, USA.
Youchan, Z. and Feng, S. (2012) ‘An improvement adaptive genetic algorithm’, Proceedings of the
International Conference on Education Technology and Computer, Vol. 24, No. 5, pp.76–78.
Zhang, J. and Szeto, K.Y. (2005) ‘Mutation matrix in evolutionary computation: an application to
resource allocation problem’, Advances in Natural Computation, pp.112–119, Springer,
Berlin, Heidelberg.
Zhang, X., Hu, S., Chen, D. and Li, X. (2012) ‘Fast covariance matching with fuzzy genetic
algorithm’, IEEE Transactions on Industrial Informatics, Vol. 8, No. 1, pp.148–157.
Zhu, W., Luo, C., Wang, J. and Li, S. (2011) ‘Multimedia cloud computing: an emerging
technology for providing multimedia services and applications’, IEEE Signal Processing
Magazine, Vol. 28, No. 3, pp.59–69.