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

Recursively partioned static ip router tables

A purpose and address technology, applied in the field of IP routing tables, can solve the problems of increasing the number of memory accesses required for searching, increasing the total storage capacity, etc.

Inactive Publication Date: 2009-08-12
UNIV OF FLORIDA RES FOUNDATION INC
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although existing schemes are designed to keep the number of memory accesses required for updates to an acceptable level, they may increase the number of memory accesses required for worst-case lookups and also increase the total number of memory accesses required to store the structure. Storage capacity

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
  • Recursively partioned static ip router tables
  • Recursively partioned static ip router tables
  • Recursively partioned static ip router tables

Examples

Experimental program
Comparison scheme
Effect test

example 1-36

[0061] Example 1-36 bit design

[0062] In one implementation example, 36 bits are allocated for each hash entry. For IPv4, 8 bits are used for Q(N), 2 bits for the stride of the next level of segmentation, 8 bits for the mask, and 17 bits for the pointer. Although 8 bits are allocated for Q(N), strides are limited from five to eight. Therefore, two bits are sufficient to represent the next level of spanning. The use of 17-bit pointers enables indexing up to 9Mbits (2 17 ×72) SRAM. For IPv6, the corresponding bit assignments are 7, 2, 7, and 19, respectively. For IPv6, the span is limited from four to seven. So seven bits are enough for the Q(N) sum, and two bits are enough for the next level of stride. The 19-bit pointer is capable of indexing 36Mbit SRAM. For the next hop field, 12 bits are allocated for both IPv4 and IPv6. For the library structure, enhanced libraries were used with the end-node optimization (EBO) version of HSST, as they were shown to be the most e...

example 2-72

[0063] Example 2-72 bit design

[0064] In another implementation example, 72 bits are allocated for each hash table entry. For both IPv4 and IPv6, 17 bits are used for the Q(N), five bits for the stride of the next level of segmentation, 17 bits for the mask, and 19 bits for the pointer. The span is limited between 1 and 17. Also, for the stripped prefix in L(R) ＊ The next hop (if any) is stored in each hash table entry. Implement the partition such that at each node N, using the L(R) partition denoted EBO and the (full) hash table for the remaining partitions, and executing L(R)-{ ＊}, distributes these extended prefixes to the remaining splits, and then constructs a hash table for the modified set of splits. Type 1 nodes use designated bits to distinguish between the different hash table types they may point to.

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

A recursively partitioned static router-table, the data structure incorporating a first-level partition including subtries and an auxiliary trie. A node of the subtrie includes a path Q(N) from the root R of a trie T to a root N of the subtrie, a stride s for a next-level partition, a mask that characterizes a next-level perfect hash function, and a pointer to the hash table for the next-level partition. At least one of the trie T, the first-level partition, the auxiliary trie, and the next-level partition is represented by a base structure selected from the group consisting of MBT and HSST.

Description

[0001] Cross References to Related Applications [0002] This application claims priority to Provisional Application No. US 60 / 840,092, filed August 25, 2006 in its entirety. technical field [0003] The present invention relates generally to IP routing tables; more particularly, to a method for partitioning a large static routing table into smaller tables. Background technique [0004] Typically, incoming packets from several different networks are forwarded to their destinations by routers using information such as a prefix of the destination address and a routing table located in the incoming packets' packet headers. A routing table for each router contains records of the best paths to various network destinations in the form of addresses of devices connected to the router. The address of the next device connected to the router to which a router will direct an incoming packet in order for the packet to reach its final destination, known as the next hop. The next hop of ...

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 Applications(China)
IPC IPC(8): H04L12/28
CPCH04L45/54H04L45/00H04L45/745
Inventor 卢文成S·K·萨尼
Owner UNIV OF FLORIDA RES FOUNDATION INC
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