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

Multi-Constraint Dual-Path Routing Method in Hierarchical Deterministic Networks

A multi-constraint and hierarchical technology, applied in the field of communication, can solve problems such as failure and data loss, and achieve the effects of time complexity satisfaction, time complexity determinability, and time complexity uncertainty

Active Publication Date: 2020-02-21
XIDIAN UNIV
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The disadvantage of this method is that there may be duplicate links between the two paths from the source node to the destination node. In the case of a failure of the duplicate link, the two paths will fail at the same time, resulting in data loss.

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 in Hierarchical Deterministic Networks
  • Multi-Constraint Dual-Path Routing Method in Hierarchical Deterministic Networks
  • Multi-Constraint Dual-Path Routing Method in Hierarchical Deterministic Networks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

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

[0069] Step 1, obtain the service quality parameters and reliability values ​​of each link in the network topology diagram.

[0070] Each node in the sub-network sends query information to its adjacent nodes, and the response of the adjacent node after receiving the information is used as the service quality parameter and reliability value of the link between the two adjacent nodes.

[0071] Use the Dijkstra algorithm to find the shortest path between every two border nodes in the subnetwork, and use the quality of service parameters and reliability values ​​of the shortest path as the quality of service parameters and reliability values ​​of the link between the two border nodes Reliability value.

[0072] The boundary nodes are reserved in e...

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 multi-constraint dual-path routing method in a hierarchical determination network. The implementation steps are as follows: dividing the determination network into several parent networks, wherein each parent network is composed of a different number of sub-networks, and under the condition that quality of service parameters and reliability values of links in a network topology map are obtained, performing three kinds of amplification, namely, parent network, sub-network and node, on the network topology map based on a reverse linear marking method and a forward marking method of a heuristic multi-constraint optimal path algorithm so as to obtain two paths meeting a plurality of constraint requirements. The multi-constraint dual-path routing method disclosed by the invention has the advantages that the obtained multi-constraint dual paths have no repeated link, thereby ensuring that the second path can still perform data communication in the case of a fault ofthe first link, and meanwhile, the time complexity is confirmable, and the time complexity meets the industrial design requirements, so that the multi-constraint dual-path routing method can be usedfor deploying an actual large-scale Internet.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a multi-constraint dual-path routing method in a hierarchical deterministic network DetNet (Deterministic Network) in the technical field of network communication. The present invention can be used to accept multi-constraint parameter routing search in a definite network, obtain two paths satisfying multiple constraint requirements, provide routing services that guarantee QoS (Quality of Service) for the definite network, and effectively improve the complexity of the network. Routing lookup performance. 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 service...

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/24H04L12/721
CPCH04L41/044H04L41/0823H04L41/12H04L45/12
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