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

Parallel route searching method and system

A routing and cascading technology, applied in the field of communication, can solve problems such as multi-instance VRF value inclusion, and achieve the effects of eliminating limitations, improving efficiency, and insufficient optimization

Active Publication Date: 2021-01-15
FENGHUO COMM SCI & TECH CO LTD +1
View PDF7 Cites 3 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
  • Parallel route searching method and system
  • Parallel route searching method and system
  • Parallel route searching 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 parallel route lookup method, which is based on a custom routing prefix that stores routing information hierarchically. The custom routing prefix includes the first-level routing prefix, the second-level routing prefix, and the second-level A three-level routing prefix, the method includes the following steps:

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

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

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

no. 1 example

[0098] The first instance number (VRF), used to represent the 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 routing;

[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] Such as Figure 4 As shown, the length of the first-level routing p...

Embodiment 2

[0128] see Figure 5 As shown, Embodiment 2 of the present invention provides a parallel route lookup method, which is based on self-defined routing prefixes that store routing information hierarchically. The self-defined routing prefixes include multi-level routing prefixes in turn, and each upper-level routing prefix contains a label Whether there is a data flag bit for data in the next-level routing prefix, the method includes the following steps:

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

[0130] A2. Identify the data flags 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 address IP, query the routing prefixes of all levels of data.

[0132] In the embodiment of the present invention, the routing table will be processed hierarchically, and the cust...

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 searching method and system, and relates to the technical field of communication, and the method comprises the following steps: receiving a message, and extracting VRF information and a destination address IP corresponding to the message; identifying a first flag bit of the first-level routing prefix, if the first flag bit indicates that the second-level routing prefix has no data, querying the first-level routing prefix according to the VRF information and the destination address IP, and otherwise, querying the first-level routing prefix and the second-level routing prefix; and when querying the second-level routing prefix, identifying a second flag bit of the second-level routing prefix, if the second flag bit indicates that the third-level routing prefix has no data, querying the second-level routing prefix, and otherwise, querying the second-level routing prefix and the third-level routing prefix. According to the method, the multi-level routing prefix is adopted, a multi-level data storage structure which is simple and convenient to search is provided, and the limitation of the existing parallel routing search method is eliminated.

Description

technical field [0001] The invention relates to the field of communication technology, in particular to a parallel route search method and system. Background technique [0002] Data communication equipment is an important part of the current Internet, carrier 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 that were previously realized based on dedicated chips such as NPs 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 engines. Th...

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/741H04L12/743H04L45/74
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