Unlock instant, AI-driven research and patent intelligence for your innovation.

Method for dynamically updating route based on PC-Trie

A routing and node technology, applied in the network field, can solve the problems of inability to find the root node by binary tree traversal method, slow down the search speed, difficult software maintenance, etc., and achieve the effect of easy implementation of recursive algorithm, easy maintenance, and clear link relationship.

Active Publication Date: 2020-05-08
芯启源(南京)半导体科技有限公司
View PDF12 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] There are some defects in the technical scheme of establishing PC-Trie by using the above rules 1 and 2: there may be redundant nodes in the PC-Trie; when searching for nodes, it may be necessary to search for a linear table in an additional routing table, which slows down the search speed ;The software is not easy to maintain for the following reasons: two sets of search methods need to be provided, one for searching PC-Trie, and the other for users to search for linear tables; when dealing with inheritance relationships, the operating perspective needs to be converted from PC-Trie to binary Trie , and finally convert back to PC-Trie; since the input of the linear routing table is the prefix information, and the input of the PC-Trie is the bit index value of the bitmap, it is necessary to frequently convert the index value to the prefix when traversing the binary tree ;The routing information of the root node is stored in the extra routing table, and the root node cannot be found by traversing the binary tree

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
  • Method for dynamically updating route based on PC-Trie
  • Method for dynamically updating route based on PC-Trie
  • Method for dynamically updating route based on PC-Trie

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below may be combined with each other as long as they do not constitute a conflict with each other.

[0029] Aiming at the problem of redundant nodes, an additional rule is proposed: when a node does not exist, but its two child nodes exist, an auxiliary node needs to be created. With this additional rule, when applying rule 2, there is no need to recursively query child nodes down, because the additional rule will ensure that when both child nodes exist, the parent node also exists, so this add...

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 dynamically updating a route based on PC-Trie. The problem that there are redundant nodes in the PC-Trie in an original technical scheme is solved by adding additional rules. Use of an extra linear routing table in the prior art is eliminated, the operation methods of the added complementary PC-Trie and PC-Trie are the same, and the code maintainability is improved; and the link relation between PC-Trie nodes is clearer through the operation view angle, a recursive algorithm is easier to achieve, and maintenance is easier.

Description

technical field [0001] The invention belongs to the field of network technology, and more specifically relates to a method for dynamically updating routing based on PC-Trie. Background technique [0002] As the scale of network routing continues to grow and the port speed of network devices continues to increase, the routing prefix longest match (LPM) algorithm is also evolving. In 2012, researchers proposed a high-speed LPM (Longest Prefix Match) routing lookup hardware implementation framework based on hash algorithm and Prefix-CompressedTrie (PC-Trie), called FlashTrie. The method of this framework is to layer the Trie tree composed of routing prefixes according to k bits, and each layer divides many sub-Trie trees with a height of k, and then realizes the routing prefix to the address of the sub-Trie tree through the hash algorithm. mapping (as attached figure 1 shown). [0003] Small sub-Trie trees are converted to PC-Trie format. The conversion method from Trie to ...

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
IPC IPC(8): H04L12/703H04L12/707H04L12/751H04L45/28H04L45/02H04L45/24
CPCH04L45/02H04L45/28H04L45/22
Inventor 胡兴峰卢笙陈盈安张仕武
Owner 芯启源(南京)半导体科技有限公司