Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Calculation method of multi-constraint routing optimization based on dag

A calculation method and multi-constraint technology, applied in the field of multi-constraint routing optimization, can solve problems such as the complexity of multi-constraint routing algorithm calculations, and achieve the effects of avoiding useless calculation processes, reducing the amount of calculation, and increasing the accuracy.

Active Publication Date: 2020-11-10
XIDIAN UNIV +1
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The embodiment of the present invention provides a DAG-based calculation method for multi-constraint routing optimization, which solves the problem of complex calculation of multi-constraint routing algorithms in the prior art

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
  • Calculation method of multi-constraint routing optimization based on dag
  • Calculation method of multi-constraint routing optimization based on dag
  • Calculation method of multi-constraint routing optimization based on dag

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0012] The technical solutions of the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts shall fall within the protection scope of the present invention.

[0013] In order to facilitate understanding and explanation, the following Figure 1 to Figure 4 The calculation method of the DAG-based multi-constraint routing optimization provided by the embodiment of the present invention is described in detail. The method can include:

[0014] S1, pruning the original network topology:

[0015] It should be understood that the present invention uses the queue in the idea of ​​graph theory to assist the search process. spe...

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 calculation method for multi-constraint routing optimization based on DAG, which includes: pruning the original network topology graph; and determining the optimal path from the source node to the destination node according to the obtained DAG graph. Therefore, the calculation method of DAG-based multi-constraint routing optimization provided by the embodiment of the present invention first uses the relevant properties of graph theory and pruning strategies to calculate all paths from the source node to other nodes that meet the multi-constraint requirements, and converts the original network topology to Graph pruning is a DAG graph. Then use the multi-constraint path calculation strategy, use the link comprehensive cost function to balance the bandwidth, delay, delay jitter, cost and other QoS parameters, use the subjective and objective weighting method G1_standard deviation method and neighbor node set self-adaptation Adjust the link weight, find an optimal path from the source node to the destination node based on the DAG graph, thereby increasing the accuracy of the calculation results, avoiding the useless calculation process of unconnected nodes, effectively reducing the calculation amount, and improving the calculation efficiency.

Description

technical field [0001] The invention relates to the technical field of network communication routing, in particular to a DAG-based calculation method for multi-constraint routing optimization. Background technique [0002] With the increasing diversification of network applications and exploration, the network is being forced to meet various traffic demands with clear and critical quality of service (QoS) requirements, such as bandwidth, delay, delay jitter, loss package rate etc. The routing problem that considers two or more QoS index constraints at the same time is called the multi-constraint QoS routing problem, and it is a problem of finding the optimal solution under multiple constraints. Existing studies have shown that the multi-constraint QoS routing problem is an NPC problem, and the solution of this optimization problem is very difficult. [0003] In the prior art, the problem of solving multi-constrained routing based on the pruning strategy is generally to pru...

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 Patents(China)
IPC IPC(8): H04L12/721H04L12/751H04L45/02
CPCH04L45/02H04L45/124
Inventor 王凯东王琨妥艳君胡霞胡有兵
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com