Back to Search
Start Over
A Novel Algorithm of Quantum Random Walk in Server Traffic Control and Task Scheduling
- Source :
- Journal of Applied Mathematics, Vol 2014 (2014), J. Appl. Math.
- Publication Year :
- 2014
- Publisher :
- Hindawi Publishing Corporation, 2014.
-
Abstract
- 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 onem-dimensional quantum random walk intomone-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.
- Subjects :
- Computer Science::Machine Learning
Heterogeneous random walk in one dimension
Theoretical computer science
Article Subject
Applied Mathematics
lcsh:Mathematics
Loop-erased random walk
Random function
Random walk
lcsh:QA1-939
Computer Science::Digital Libraries
Statistics::Machine Learning
Computer Science::Mathematical Software
Quantum phase estimation algorithm
Quantum algorithm
Quantum walk
Cluster analysis
Algorithm
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 1110757X
- Database :
- OpenAIRE
- Journal :
- Journal of Applied Mathematics
- Accession number :
- edsair.doi.dedup.....05a03f3285fa2c726d591965918fad1d
- Full Text :
- https://doi.org/10.1155/2014/818479