Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 818479, 8 pages
Research Article

A Novel Algorithm of Quantum Random Walk in Server Traffic Control and Task Scheduling

1Network Center, Qingdao Technological University, Qingdao 266033, China
2College of Automobile and Transportation, Qingdao Technological University, Qingdao 266033, China

Received 18 January 2014; Accepted 19 February 2014; Published 7 April 2014

Academic Editor: Feng Gao

Copyright © 2014 Dong Yumin and Xiao Shufen. This 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 random walk optimization model and algorithm in network cluster server traffic control and task scheduling is proposed. In order to solve the problem of server load balancing, we research and discuss the distribution theory of energy field in quantum mechanics and apply it to data clustering. We introduce the method of random walk and illuminate what the quantum random walk is. Here, we mainly research the standard model of one-dimensional quantum random walk. For the data clustering problem of high dimensional space, we can decompose one -dimensional quantum random walk into one-dimensional quantum random walk. In the end of the paper, we compare the quantum random walk optimization method with GA (genetic algorithm), ACO (ant colony optimization), and SAA (simulated annealing algorithm). In the same time, we prove its validity and rationality by the experiment of analog and simulation.