A novel algorithm of quantum random walk in server traffic control and task scheduling
type: Item
instance of: scholarly article
title: A novel algorithm of quantum random walk in server traffic control and task scheduling
zbMATH Open document ID: 1406.81019
DOI: 10.1155/2014/818479
author: Dong Yumin
author: Xiao Shufen
published in: Journal of Applied Mathematics
publication date: 2019-02-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 81S25
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 7010763
Wikidata QID: Q59052587
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/818479
OpenAlex ID: W2115076373
description: scientific article; zbMATH DE number 7010763