Rapid storage method of routing table entry

A fast storage and routing technology, applied in the field of communication, can solve the problems of not supporting classless routing, complex software algorithm implementation, not very widely used, etc., to achieve the effect of saving memory, facilitating software programming, and saving quantity

Active Publication Date: 2012-07-11
FUJIAN SUNNADA NETWORK TECH CO LTD
View PDF6 Cites 24 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0034] However, the applicant did not find a routing method using the 256Trie tree algorithm in the public literature. It is understood that some companies also use the 256Trie tree algorithm in their current routing a

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
  • Rapid storage method of routing table entry
  • Rapid storage method of routing table entry
  • Rapid storage method of routing table entry

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0074] Please give an example to illustrate the above situation.

[0075] For example, if the user configures a default route: the index entry whose root node index value is 255 directly points to this default route entry.

Embodiment 2

[0077] Please give an example to illustrate the above case b

[0078] If a routing entry with a destination address / mask of 10.0.0.0 / 8 is configured, the index entry of the root node in the 256trie tree with an index value of 10 points to the second-level node, and the index value of the second-level node is 255 The index entry of the router points to this routing entry.

Embodiment 3

[0080] like Figure 4 As shown, the routing table has only the root node at the beginning, and the root node is not associated with any routing table entries; at this time, the user configures a route destination ip address and mask as: 192.168.12.23 / 15, then first match the index value of the root node The index entry is 192, and then see that the second byte of the ip address is 168, and the mask length is 15, that is, find two index entries with the second-level node index value of 168 and the prefix matching length of 7, that is, Two index entries with index values ​​of 168 and 169 are then associated, and at the same time, the second-level node is also associated with the routing item, according to the method described in the d situation in the above step (1) and through the third The 255 associated routing table items of the level node; after the routing table item is set, the 256Trie tree becomes as follows Figure 5 status shown. like Figure 6 As shown, if the user...

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 rapid storage method of a routing table entry. A 256tire tree structure is used for configuring the routing table entry, the height of the 256tire tree is four, and all the four nodes comprise 256 index table entries from 0 to 255, wherein the routing table entry directly pointed by the index table entry of the root node with the index value of 255 indicates a default route; the index table entry of the second node with the index value of 255 refers to the routing table entry which should be returned in case that the second nodes behind the matched root nodes are not matched during matching; the index table entry of the third node with the index value of 255 refers to the routing table entry which should be returned in case that the root nodes and the second nodes are matched and the third nodes are not matched during matching; and the index table entry of the fourth node with the index value of 255 refers to the routing table entry which should be returned in case that the root nodes, the second nodes and the third nodes are matched and the fourth nodes are not matched. The rapid storage method provided by the invention ensures the rapid routing searching and improves the routing searching efficiency, thereby the forwarding performance of a router is improved and the memory space is saved.

Description

【Technical field】 [0001] The invention relates to a communication technology, in particular to a method for storing routing table items, which not only makes routing lookup very fast, improves the efficiency of routing lookup, thereby improves the forwarding performance of routers, but also saves memory space. 【Background technique】 [0002] Due to the rapid development of the Internet, the increase in the number of network users, the application of multimedia networks is becoming more and more extensive, and the network traffic is showing an explosive growth trend. If the Internet wants to continue to provide better services, it is required that the core routers can forward more than several million packets per second, and the fast route lookup technology becomes the bottleneck of router packet forwarding. Therefore, how to realize the search and update of the high-speed routing table is a difficult point of research. [0003] 1. First understand a few concepts: [0004] ...

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/56H04L47/27
Inventor 林川黄海峰张媛
Owner FUJIAN SUNNADA NETWORK TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap