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

A kind of parallel route lookup method and system

A routing and routing technology, applied in the field of communication, can solve problems such as multi-instance VRF value inclusion, and achieve the effects of eliminating limitations, efficient parallel routing search methods, and strong availability.

Active Publication Date: 2022-07-15
FENGHUO COMM SCI & TECH CO LTD +1
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The latest segment routing lookup algorithm divides 32bit addresses into multi-segment addresses based on the destination address, specifically including DIR-24-8-BASIC, DIR-16-8-8-BASIC, DIR-8-8-8-8- There are several cases such as BASIC, but the algorithm does not include the multi-instance VRF value into the algorithm, so the algorithm generally only supports the public network route search with VRF equal to 0, for the case where the VRF is not unique (generally the VRF value is between 1 and 2047) ) does not give compatible

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 kind of parallel route lookup method and system
  • A kind of parallel route lookup method and system
  • A kind of parallel route lookup method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0064] see Figures 1 to 4 As shown, Embodiment 1 of the present invention provides a method for parallel routing lookup, the method is based on a custom routing prefix that hierarchically stores routing information, and the custom routing prefix sequentially includes a first-level routing prefix, a second-level routing prefix, and a first-level routing prefix. The third-level routing prefix, the method includes the following steps:

[0065] S1. Receive a message, and extract VRF information and destination IP address corresponding to the message;

[0066] S2. Identify the first flag bit of the first-level routing prefix. If the first flag indicates that the second-level routing prefix has no data, query the first-level routing prefix according to the VRF information and the destination address IP, otherwise, query the first-level routing prefix. prefixes and second-level routing prefixes;

[0067] S3. When querying the second-level routing prefix, identify the second flag b...

no. 1 example

[0098] The first instance number (VRF), used to represent instance information of the route;

[0099] The first mask prefix length (Ip_Mask_Len), used to represent the mask prefix length of the route;

[0100] The first routing address (Ip), used to represent the IP address of the route;

[0101] The first next hop information (Next_hop) is used to store the next hop information of the routing table;

[0102] The first next node address (Next), used to represent the next member on the Hash_entry linked list;

[0103] The first reserved bit field (Unused2) is used to indicate that the bit field is a reserved field;

[0104] The first reserved bit field (Unused3) is used to indicate that the bit field is a reserved field.

[0105] Corresponding to the structural example given above, the data storage process of the method mentioned in the embodiment of the present invention;

[0106] like Figure 4 As shown, the length of the first-level routing prefix is ...

Embodiment 2

[0128] see Figure 5 As shown, Embodiment 2 of the present invention provides a parallel route lookup method. The method is based on a custom routing prefix that hierarchically stores routing information. The custom routing prefix sequentially includes multi-level routing prefixes, and each upper-level routing prefix contains a marker. Whether the next-level routing prefix has a data flag bit of data, the method includes the following steps:

[0129] A1. Receive the message, and extract the VRF information and destination IP address corresponding to the message;

[0130] A2. Identify the data flag bits of the routing prefixes at all levels, and determine whether there is data in the routing prefixes at all levels;

[0131] A3. According to the VRF information and the destination IP address, query the routing prefixes at all levels where data exists.

[0132] In this embodiment of the present invention, the routing table is processed in a hierarchical manner, and t...

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 parallel route search method and system, and relates to the technical field of communication. The method includes the following steps: receiving a message, and extracting VRF information and destination address IP corresponding to the message; A flag bit. If the first flag bit indicates that the second-level routing prefix has no data, the first-level routing prefix will be queried according to the VRF information and the destination IP address. Otherwise, the first-level routing prefix and the second-level routing prefix will be queried; When the second-level routing prefix is ​​used, the second flag bit of the second-level routing prefix is ​​identified. If the second flag indicates that the third-level routing prefix has no data, the second-level routing prefix is ​​queried; otherwise, the second-level routing prefix and The third-level routing prefix. The invention adopts the multi-level routing prefix, provides a multi-level data storage structure that is easy to search, and eliminates the limitation of the existing parallel routing search method.

Description

technical field [0001] The present invention relates to the technical field of communications, in particular to a parallel route search method and system. Background technique [0002] Data communication equipment is an important part of the current Internet, operator network and industry network. Typical equipment representatives are traditional routers, switching switches, access gateways, and vCPE, vBRAS, and vFW virtualization equipment under the NFV trend. [0003] Under the new situation, the development trend of NFV is to use general-purpose servers based on the X86 architecture to undertake the above-mentioned services based on the original dedicated chips such as NP and switching chips. X86 is a general-purpose multi-core processor. Compared with traditional special-purpose chips such as NP and switching chips, it completely relies on CPU calculation and search for routing and forwarding services, and lacks TCAM hardware-assisted routing search engine. Multi-core p...

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): H04L45/745H04L45/7453
CPCH04L45/745H04L45/7453
Inventor 范富明李炎涛
Owner FENGHUO COMM SCI & TECH CO LTD
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