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

Route prefix processing, lookup, adding and deleting method

A processing method and deletion method technology, which is applied in the field of network communication, can solve the problems of memory consumption and low cost, and achieve the effect of avoiding backtracking operations

Active Publication Date: 2013-04-17
IPLOOK NETWORKS CO LTD
View PDF6 Cites 20 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In order to solve the existing technical problems of high-speed search and update, low memory consumption, and low cost in the existing routing table implementation method, the present invention provides a processing method for routing prefixes, including searching, adding, and deleting. wait for operation

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
  • Route prefix processing, lookup, adding and deleting method
  • Route prefix processing, lookup, adding and deleting method
  • Route prefix processing, lookup, adding and deleting method

Examples

Experimental program
Comparison scheme
Effect test

example

[0157] Example: Implementing an IPV4 routing table based on a 256-branch Trie tree

[0158] 1. In the example, a multi-branch Trie tree with an equal step size of 8 (that is, 256) is used to realize the rapid update and search of the IPV4 routing table prefix.

[0159] 2. The data structure adopts the above-mentioned Table 1-Table 3.

[0160] 3. Add process:

[0161] According to the implementation method of adding a routing prefix above, take adding the following routing entry as an example:

[0162] route entry prefix routing table entry index 192.168.1.1 / 0 is 0.0.0.0 N0 192.168.1.1 / 1 is 128.0.0.0 N1 ...... ...... 192.168.1.1 / 10 is 192.128.0.0 Na 192.168.1.1 / 11 is 192.160.0.0 Nb ...... ...... 192.168.1.1 / 24 is 192.168.1.0 N18 ...... ...... 192.168.1.1 / 31 is 192.168.1.0 N1f 192.168.1.1 / 32 is 192.168.1.1 N20

[0163] Table 4

[0164] The added routing table memory map is shown i...

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 provides a route prefix processing, lookup, adding and deleting method. A multi-way Trie tree is utilized to artfully design a Trie node data structure, and the technical problems that the traditional routing table realization method can not satisfy the quick route lookup requirement, the memory access times are reduced, the cost of construction is high and the use efficiency is low can be solved by a prefix list item storage data structure and algorithm, a high-speed longest route prefix lookup method, a quick route prefix increasing method and a quick route prefix deleting method. The route prefix processing, lookup, adding and deleting method has the advantages of high lookup speed, high update speed and good use benefit.

Description

technical field [0001] The invention belongs to the technical field of network communication, and in particular relates to a method for processing, searching, adding and deleting routing prefixes. Background technique [0002] With the rapid development of the Internet, core routers and network devices with routing and forwarding functions have an interface bandwidth of 10G or even 40G or more, and the capacity of IPV4FIB entries is also on the order of one million entries, which requires the routing table to support large capacity and the search speed is very fast; The addition and deletion operations of the routing table are also very frequent. In the worst case, the internal routing changes can occur hundreds of times per second. In order to adapt to the rapid dynamic changes of the routing table items and ensure the correctness of the search, this requires that the routing table should also have a good Update Speed. [0003] Route lookup, since CIDR (Classless Inter-Dom...

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/745H04L45/748
Inventor 王辉
Owner IPLOOK NETWORKS 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