Dense mode coding scheme

Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S351000

Reexamination Certificate

active

07346009

ABSTRACT:
A lookup table for searching for a longest prefix match for a key is disclosed. The lookup table provides a match for a key in a single search cycle. The number of matches stored in the lookup table is maximized by storing each match in only one location in the lookup table. The binary tree is divided into a plurality of levels and each level has a plurality of subtrees. A subtree descriptor stored for a subtree includes a field for each node in the subtree. The state of the field indicates whether an entry for the node is stored in the table. The bit vector allows indexing of the single match stored for the key.

REFERENCES:
patent: 6691218 (2004-02-01), Brown
patent: 6985960 (2006-01-01), Takashima et al.
patent: 2003/0189930 (2003-10-01), Terrell et al.
patent: WO 99/14906 (1999-03-01), None
Degermark, M., et al., “Small Forwarding Tables for Fast Routing Lookups,” Deparment of Computer Science and Electrical Engineering, Luleå University of Technology, S-971 Luleå, Sweden, pp. 3-14.
P. Gupta, et al., “Routing Lookups in Hardware at Memory Access Speeds,”IEEE, pp. 1240-1247 (1998).
Miguel Á. Ruiz-Sánchez, et al., “Survey and Taxonomy of IP Address Lookup Algorithms,”IEEE Network, pp. 8-23 (2001).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dense mode coding scheme does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dense mode coding scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dense mode coding scheme will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2798473

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.