Dense mode coding scheme

Details Dense mode coding scheme Dense mode coding scheme

2008-03-18

2008-03-18

Sam, Phirin (Department: 2619)

Multiplex communications

Network configuration determination

Using a particular learning algorithm or technique

C370S351000

Reexamination Certificate

active

10262643

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).

Affiliated with

Also associated with

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

Comments { 0 }

Profile ID: LFUS-PAI-O-3918299