Pointer management and content matching packet classification

• US 20020163913A1
• Filed: 05/07/2001
• Published: 11/07/2002
• Est. Priority Date: 05/07/2001
• Status: Abandoned Application

• Current Assignee: Jintae Oh
• Original Assignee: Jintae Oh
• Inventors: Oh, Jintae
• Application Number:
  US09/850,881
• Publication Number:
  US 20020163913A1
• Time in Patent Office: Days
• US Class Current: 370/392
• CPC Class Codes: H04L 45/742 Route cache; Operation thereof
• CPC Class Codes: H04L 69/22 Parsing or analysis of headers
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

The present invention performs the series of table lookups in a radically different way than conventional systems. Specifically, the present invention performs the first table lookup conventionally to match a table entry with header information (say a first byte of header information), and assigns a first pointer to the matching first table lookup entry. For a byte, the first table lookup has 2⁸ entries (256 entries). Then, departing from conventional systems, the present invention provides additional memory to the first pointer. The second byte of header information is stored in memory, the significant bit information of the second byte is stored in memory, and a logic operator (“=” or “<”) is stored in memory. The second table lookup has only two entries, true or false. The correct entry is matched with the information that has been stored in memory with the first pointer, and a second pointer is established. Again, with the second pointer, additional memory is allocated to store the third byte of header information, the significant bit information of the third byte, and a logic operator (“=” or “<”). This process is repeated for all of the header information.

Claims

1. A method of handling information packets comprising:

receiving an information packet;

reading a plurality of bytes of information in the packet relating to packet source or packet destination;

matching the first byte of information to a first matching entry in a first lookup table;

assigning a first pointer to said first matching entry;

storing in memory a second byte of information and associating said second byte of information with said first pointer;

storing in memory a first logic operator associated with said second byte of information and associating said first logic operator with both said first pointer and said second byte of information.

2. A method of handling information packets according to claim 1, wherein the information relating to packet source includes source Internet Protocol address.

3. A method of handling information packets according to claim 1, wherein the information relating to packet source includes source port number

4. A method of handling information packets according to claim 1, wherein the information relating to packet destination includes destination Internet Protocol address.

5. A method of handling information packets according to claim 1, wherein the information relating to packet destination includes destination port number.

6. A method of handling information packets according to claim 1, wherein the information relating to packet source or packet destination is Layer 3 and Layer 4 information.

7. A method of handling information packets according to claim 1, further comprising:

storing in memory information about significant bit length of the second byte of information and associating said significant bit length information with said first pointer, said second byte of information, and said logic operator.

8. A method of handling information packets according to claim 7, further comprising:

matching the information stored in memory in association with said first pointer, with a second matching entry in a second table lookup.

9. A method of handling information packets according to claim 8, further comprising:

assigning a second pointer to said second matching entry;

storing in memory a third byte of information and associating said third byte of information with said second pointer;

storing in memory a second logic operator associated with said third byte of information and associating said second logic operator with both said second pointer and said third byte of information; and

storing in memory information about significant bit length of the third byte of information and associating said significant bit length information with said second pointer, said third byte of information, and said second logic operator.

10. A method of handling information packets according to claim 8, wherein said second lookup table comprises a true-false table.

11. A method of handling information packets comprising:

providing a first lookup table having 2⁸ entries for a first byte of information;

when the second byte of information has significant bits of information, providing a second lookup table having only 2 entries

when the second byte of information has no significant bits of information, providing a second lookup table having 1 entry;

linking said first lookup table to said second lookup table using a pointer.