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)
- Publication Year :
- 2014
- Publisher :
- Wiley, 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 one m-dimensional quantum random walk into m 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.
- Subjects :
- Mathematics
QA1-939
Subjects
Details
- Language :
- English
- ISSN :
- 1110757X and 16870042
- Volume :
- 2014
- Database :
- Directory of Open Access Journals
- Journal :
- Journal of Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.0fc962a453b84a96830a12608b767c62
- Document Type :
- article
- Full Text :
- https://doi.org/10.1155/2014/818479