Research Article
Research and Application on a Novel Clustering Algorithm of
Quantum Optimization in Server Load Balancing
Dong Yumin,
1
Xiao Shufen,
2
Jia Fanghua,
3
and Li Jinhai
1
1
NetworkCenter,QingdaoTechnologicalUniversity,Qingdao,China
2
Administration Oce of National Assets, Qingdao Technological University, Qingdao, China
3
Library,QingdaoTechnologicalUniversity,Qingdao,China
Correspondence should be addressed to Dong Yumin; dym1188@163.com
Received 16 December 2013; Accepted 3 February 2014; Published 6 April 2014
Academic Editor: Balaji Raghavan
Copyright © 2014 Dong Yumin et al. is is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
A quantum optimization scheme in network cluster server task scheduling is proposed. We explore and research the distribution
theory of energy eld in quantum mechanics; specially, we apply it to data clustering. We compare the quantum optimization
method with genetic algorithm (GA), ant colony optimization (ACO), simulated annealing algorithm (SAA). At the same time, we
prove its validity and rationality by analog simulation and experiment.
1. Introduction
Cluster technology is connecting multiple independent
servers and providing services as a whole by a cluster.
To achieve parallel program in a high eciency, service
request must be allocated to each server, reduce the access
time, and optimize the overall performance. Load balancing
mechanism is the core cluster technology.
Intheliterature[1], server cluster provides high reliability,
availability, and scalability by gathering server nodes into
one group. User requests need to be distributed to every
server node fairly to maximize the characteristic of server
cluster. In the same time, it proposes an ecient and
adaptive load balancing arithmetic for the server cluster.
e arithmetic computes the load of servers with the usages
of computer resources or their weights. e weights are
dynamically determined based on the usages of the statistics.
eir experimental result shows that this arithmetic protect
the bottleneck from server cluster eciently compared with
before arithmetics.
e state of web applications communicates and coor-
dinates with lot of geographically distributed information
resources oering information to great number of clients.
Homogeneous server clusters are unable to meet the growing
demand of the applications including real-time video and
audio, ASP, JSP, and PHP. Moreover, it also provides better
reliability by gracefully transferring the load from server
which is unavailable due to failure or for preventive main-
tenance. Heterogeneity with scalability makes the system
more complex. e literature [2]proposesadynamicload
balancing (DLB) algorithm for extensible heterogeneous
server cluster for content awareness. e arithmetic considers
server’s processing ability, queue length, utilizing ratio, and
so forth, as load indices. As the clusters supports multiplex
services, at the basic level, it has used content awareness
forwarding arithmetic.
Intheliterature[3], online games are becoming more
fashionable recently as the internet becomes popular, game
platforms become dierent, and ubiquitous environment is
supported. Wherefore, distributed technology is required to
support huge numbers of concurrent game clients simul-
taneously. Specically, when the users are playing games,
a lot of unpredictable problems can arise, for example, a
certain server handles more loads than what is recommended
becausemuchmoregameuserscrowdedintoaspecic
region of game world. e kinds of situations can lead
tothegameserversinstability.Here,theglobaldynamic
load balancing model and distributed massive multiplayer
online game (MMOG) servers architecture are put forward
to apply the load balancing arithmetic. Much more dierent
experiments were achieved to test eciency.
Hindawi Publishing Corporation
Mathematical Problems in Engineering
Volume 2014, Article ID 510656, 7 pages
http://dx.doi.org/10.1155/2014/510656