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

Method for realizing longest prifix address route search using sectioned compressed list

A longest prefix and routing technology, applied in the field of data communication, can solve the problems of complex longest prefix matching search, increased processor burden, and affecting router performance, etc.

Active Publication Date: 2008-03-12
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Due to the complexity of the longest prefix matching search, the burden on the processor is greatly increased; coupled with the continuous improvement of the network's requirements for router forwarding speed, route search has become one of the main bottlenecks affecting router performance

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 realizing longest prifix address route search using sectioned compressed list
  • Method for realizing longest prifix address route search using sectioned compressed list
  • Method for realizing longest prifix address route search using sectioned compressed list

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0063] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be described in further detail below in conjunction with specific embodiments and with reference to the accompanying drawings.

[0064] In the 64K segment table and the compression offset table, each field is initialized to all 1 values, which means invalid (except for the entry width field of the compression offset table). When searching, if the segment routing index field value in the 64K segment table is all 1, it indicates an invalid route; the compression offset table pointer field value in the 64K segment table is all 1, indicating that there is no compression offset table in this segment; If the value of an entry in the table is all 1s, it means that the corresponding next-hop route index value is a segment route index, and formula 4 is not used for calculation.

[0065] During specific implementation, firstly, the bit width of the routing 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

This invention relates to a method for realizing the longest prefix address route look up which sets up two stages of route information lists: a 64 segment list and a compressed offset list, among which, the route index value in the offset list is compressed to the difference between the said index value and the primary route index for storing route look-up information. When looking up, high 16 order of the being looked-up target IPV4 address is used as the index value to position the item in 64k segment list and judge if the compressed offset list pointer is invalid, if so, the route index is the next jump route index value corresponding to IPV 4 address, if not, the pointer value, primary value and width corresponding to compressed offset list are got to get the next jump route index value of IPV4by accessing offset list items with the low 16 order of the IPV4.

Description

technical field [0001] The invention relates to the technical field of data communication. In particular, a method for realizing routing lookup of IPv4 longest prefix address by using segmentation and compression technology. The method can be used in routers, layer-3 switches, access servers and other devices in the IPv4 Internet that need to search for IPv4 address routing. Background technique [0002] Route lookup is one of the basic functions of routers, Layer 3 switches and other devices. The IP address is composed of <network identifier, host identifier>, and the forwarding of IP packets is performed according to the network identifier. In the early days, IP addresses were fixed at 8, 16, and 24 bits according to the length of the network identifier, corresponding to class A, B, and C addresses respectively. Classless Inter-Domain Routing (CIDR) allows address aggregation of any length, so that the network identification length of the IP address is no longer l...

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/54H04L12/28G06F17/30H04L45/748
Inventor 徐宇锋李华伟宫曙光刘彤
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
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