Open AccessA Quantum MMAS Based Algorithm for Multicast Routing Problem
Author(s) -
Yalong Li,
Wei Wang,
Jizhong Sun,
Jie Wan
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1920/1/012105
Subject(s) - computer science , ant colony optimization algorithms , multicast , mathematical optimization , algorithm , routing (electronic design automation) , convergence (economics) , coding (social sciences) , encode , quantum computer , destination sequenced distance vector routing , quantum , link state routing protocol , distributed computing , computer network , mathematics , routing protocol , biochemistry , statistics , chemistry , physics , quantum mechanics , economics , gene , economic growth
For solving the problem of multicast routing, ant colony algorithm (ACO) has insufficient optimization ability. The paper proposes a routing algorithm which combines quantum computing and max min ACO. The algorithm uses quantum bit probability amplitude to encode the link, and dynamically adjusts quantum revolving gate to update the quantum coding on the link, so as to meet the cost optimization under constraint conditions, combined with the maximum and minimum pheromone decision mechanism to find the optimal link path, effectively control the evolution speed and direction, and enhance the convergence performance of the algorithm. The simulation results show that the algorithm can effectively control the evolution speed and direction, and is better than ant colony algorithm in the optimization ability and convergence performance.