QoS routing method based on quantum maximum and minimum ant colony algorithm

A maximum and minimum ant colony and quantum technology, applied in the field of network communication, can solve problems such as easy premature convergence, low algorithm convergence performance, and many algorithm iterations

Active Publication Date: 2020-09-15
安徽省地震局
View PDF12 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

As a commonly used bionic algorithm, the ant colony algorithm has many advantages. However, in the process of solving NP problems, the number of iterations is large and the obtained solution is likely to be a local solution, and the algorithm has low convergence performance.
In response to these shortcomings, many scholars have proposed different optimization algorithms. For example, the literature adds genetic operators to the ant colony algorithm to solve the QoS anycast routing problem. and delay-constrained QoS unicast routing problems, when solving large-scale QoS routing problems, the number of algorithm iterations is large and it is easy to converge prematurely

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • QoS routing method based on quantum maximum and minimum ant colony algorithm
  • QoS routing method based on quantum maximum and minimum ant colony algorithm
  • QoS routing method based on quantum maximum and minimum ant colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0152]First, the network topology is randomly generated with reference to the Salama model, and in order to make the topology map data clear, only some parameters of the nodes are displayed. When setting the QoS delay constraint as D=95, the link bandwidth B=70, the delay jitter Dj=1000, the packet loss rate Pl=1000(10e-5), and the remaining parameters are respectively set to α'=1, β '=2, ρ=0.02, γ=2, P best =0.05, Q=5, m=50, the maximum evolution algebra NMAX=100, and then conduct experiments from the three aspects of the algorithm’s global search ability, convergence performance and network scale’s influence on the algorithm:

[0153] First, verify from the global search ability, select 50 network nodes, randomly generate network topology, initialize constraint conditions and algorithm parameters, use the algorithm in the present invention to carry out 50 separate experiments for each routing request, in the attached figure 1 Solve the optimal path generated by (1,50) in th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a QoS routing method based on a quantum maximum and minimum ant colony algorithm. Quantum calculation and a maximum and minimum ant colony algorithm are combined; quantum coding is carried out on a link in the network topology by adopting a state vector in quantum calculation; pheromones are updated through quantum rotation entanglement characteristics in combination with amaximum and minimum inspection mechanism; a quantum selection strategy is added in roulette link selection, under the condition of small fitness difference, the evolution speed and direction are effectively controlled, the optimization capability and convergence performance are superior to those of a traditional ant colony algorithm, and the QoS routing selection problem can be effectively and accurately solved under the condition that constraint conditions are met.

Description

technical field [0001] The invention relates to the technical field of network communication, in particular to a QoS routing selection method based on the quantum maximum and minimum ant colony algorithm. Background technique [0002] With the rise of big data and cloud platforms, Internet network applications and scale continue to expand, advanced multimedia services such as images and videos have been widely used in departments such as earthquakes, meteorology, and transportation. The parameter quality of service (QoS) has higher requirements, how to select the route with the optimal cost under the parameter constraints is the research content of the QoS routing problem. [0003] In the QoS routing problem, the constraint parameters determine the quality and accuracy of the solution. For the NP problem of routing with multiple index constraints, intelligent bionic algorithms can be used to solve it. Many scholars have applied various intelligent bionic algorithms to solve ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/721H04L12/725H04L12/751G06N3/00G06N10/00H04L45/02
CPCH04L45/02H04L45/124H04L45/302G06N3/006G06N10/00Y02D30/70
Inventor 李亚龙潘丹王伟何琳孙静万杰张洁檀斌
Owner 安徽省地震局
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap