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

Multi-constraint dual-path routing method for deterministic network based on reverse pruning strategy

A multi-constraint, dual-path technology, applied in the field of communication, can solve the problem of finding paths that cannot be applied with multi-constraints, and cannot ensure high reliability of data transmission, etc., and achieves the effect of deterministic time complexity and satisfying time complexity.

Active Publication Date: 2020-07-10
XIDIAN UNIV
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The disadvantage of this method is that since this method only calculates the intersecting paths according to the constraint of bandwidth, this method cannot be applied to the search problem of paths satisfying multiple constraints. The reliability parameters of the path are used as the constituent factors of the weight, so the data on the path obtained by this method cannot be guaranteed to be transmitted with high reliability

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
  • Multi-constraint dual-path routing method for deterministic network based on reverse pruning strategy
  • Multi-constraint dual-path routing method for deterministic network based on reverse pruning strategy
  • Multi-constraint dual-path routing method for deterministic network based on reverse pruning strategy

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments.

[0046] Refer to attached figure 1 , the specific steps of the present invention are further described in detail.

[0047] Step 1, calculate the first path.

[0048] Use the reverse linear marking method of the heuristic multi-constraint optimal path algorithm to perform reverse linear marking on each node in the determined network, obtain the reverse linear marking value of each node, and select the source node in the determined network. Reverse linear tag value.

[0049] The steps of the reverse linear notation method of the described heuristic multi-constraint optimal path algorithm are as follows:

[0050] In the first step, one node in the determined network will be selected as the destination node and added to the first node set, and the remaining nodes will form the second node set, and the destination node in the first node set will be...

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 method for determining network multi-constraint dual-path routing based on a reverse pruning strategy. To pruning and updating of the determined network, two paths satisfying multiple constraint requirements and having the highest overall reliability are obtained. The advantage of the present invention is that the obtained two paths ensure that in the case of failure of the first path, The second path can still carry out data communication, and at the same time, the present invention has deterministic time complexity, and the time complexity meets the requirements of industrial design, and can be used to deploy actual large-scale Internet networks.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a method for determining network multi-constraint dual-path routing based on a reverse pruning strategy in the technical field of network communication. The present invention can be used for route lookup accepting multi-constraint parameters in a definite network, and obtains two paths satisfying multiple constraint requirements and having the highest overall reliability. Background technique [0002] Quality of Service (QoS) routing is a routing mechanism that selects paths based on available network resources and QoS requirements of business flows, that is, a dynamic multi-constraint routing protocol that includes multiple QoS parameters. Determining the network as an emerging network provides people with a variety of network services, different network services have different parameter constraints, and a single traditional network routing protocol cannot meet the n...

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/707H04L12/725H04L45/24
CPCH04L45/24H04L45/302
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