A novel algorithm of quantum random walk in server traffic control and task scheduling
Summary: 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.
- Research and application on a novel clustering algorithm of quantum optimization in server load balancing
- A random walk approach to quantum algorithms
- Random walk quantum clustering algorithm based on space
- A hybrid classical-quantum clustering algorithm based on quantum walks
- Quantum Random Walks – New Method for Designing Quantum Algorithms
- Random walk quantum clustering algorithm based on space
- Quantum load balancing in ad hoc networks
- Research and application on a novel clustering algorithm of quantum optimization in server load balancing
- A study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D lattice
This page was built for publication: A novel algorithm of quantum random walk in server traffic control and task scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714775)
