A multi-path multi-communication means routing planning method

A multi-path, communication technology, used in digital transmission systems, electrical components, transmission systems, etc.

Active Publication Date: 2018-06-19
NO 54 INST OF CHINA ELECTRONICS SCI & TECH GRP
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The problem to be solved by the present invention is how to find one or several reasonable routes between each node in a network environment with complex structure and various means of communication, and establish a routing table for information transmission

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
  • A multi-path multi-communication means routing planning method
  • A multi-path multi-communication means routing planning method
  • A multi-path multi-communication means routing planning method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0032] A multi-path multi-communication means routing planning method, comprising the following steps:

[0033] (1) according to the type of communication means, the connection relationship between the nodes in the network diagram is encoded to obtain the adjacency matrix between the nodes, and the network diagram is abstracted through the communication network;

[0034] The adjacency matrix in graph theory is a mathematical expression representing the connection relationship between nodes in the network, and it is the basis for calculating the routing table. According to the needs, the adjacency matrix can have different expressions, which can be calculated according to the value of each element in the matrix. Classification. like figure 1 As shown, take a network diagram of 4 nodes as an example:

[0035] We use a 4×4 matrix to r...

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 relates to a multi-path multi-communication means routing planning method, which relates to the field of path planning in communication networks. Since there are many means of communication between nodes in the communication network, the two-dimensional adjacency matrix that represents the relationship between network nodes in the traditional algorithm can no longer meet the needs. In addition to representing the adjacency relationship between nodes, it can also represent various means of communication between nodes. Based on the depth-first full-path search algorithm in the graph theory, the invention calculates the route with irrelevant nodes in the communication network, better weight value and smaller length. At the same time, in order to achieve the purpose of non-interference between routes, we have performed operations on the obtained routes to remove the correlation between nodes and communication means, so as to maximize the use of resources in the entire communication network, and provide information for the establishment of communication network routing tables and information transmission. Routing screening provides the basis.

Description

technical field [0001] The invention relates to the field of path planning in a communication network, especially in a network graph that contains multiple communication means and has complex node link relationships. excellent path. Background technique [0002] The traditional depth-first search algorithm is a kind of search algorithm, it traverses all the nodes of the tree with the depth of the tree as the first priority, and explores all the branches of the tree as much as possible. For a graph, the depth-first search algorithm can only traverse the nodes in the graph, and cannot be directly used for point-to-point multi-path search. Contents of the invention [0003] The problem to be solved by the present invention is how to find one or several reasonable routes between each node in a network environment with complex structure and various means of communication, and establish a routing table for information transmission. In order to solve the above problems, based o...

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/721
CPCH04L45/14
Inventor 王超郭兆华刘雪峰陈肖蒙王旭常旷博
Owner NO 54 INST OF CHINA ELECTRONICS SCI & TECH GRP
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