Methods for performing packet classification

• US 20060221967A1
• Filed: 03/31/2005
• Published: 10/05/2006
• Est. Priority Date: 03/31/2005
• Status: Abandoned Application

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Kumar, Alok, Narayan, Harsha L.
• Application Number:
  US11/096,960
• Publication Number:
  US 20060221967A1
• Time in Patent Office: Days
• US Class Current: 370/392
• CPC Class Codes: H04L 2101/604 Address structures or formats
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/54 Organization of routing tables
• CPC Class Codes: H04L 45/74591 using content-addressable memories [CAM]
• CPC Class Codes: H04L 63/101 Access control lists [ACL]

Abstract

Methods for performing packet classification via partitioned bit vectors. Rules in an access control list (ACL) are partitioned into a plurality of partitions, wherein each partition is defined by a meta-rule comprising a set of filter dimension ranges and/or values covering the rules in that partition. Filter data structures comprising rule bit vectors are then built, each including multiple filter entries defining packet header filter criteria corresponding to one or more filter dimensions. Partition bit vectors identifying, for each filter entry, any partition having a meta-rule defining a filter dimension range or value that covers that entry'"'"'s packet header filter criteria are also generated and stored in a corresponding data structure.

Claims

1. A method, comprising:

partitioning rules in an access control list (ACL) into a plurality of partitions, each partition defined by a meta-rule comprising a set of filter dimension ranges and/or values covering the rules in that partition;

building a plurality of filter data structures, each including a plurality of filter entries defining packet header filter criteria corresponding to one or more filter dimensions; and

storing partition data identifying, for each filter entry, any partition having a meta-rule defining a filter dimension range or value that covers that entry'"'"'s packet header filter criteria.

2. The method of claim 1, wherein the plurality of filter data structures comprise recursive flow classification (RFC) chunks.

3. The method of claim 1, wherein the plurality of filter data structures comprise trie data structures.

4. The method of claim 1, wherein a first portion of the plurality of filter data structures comprise recursive flow classification (RFC) chunks, and a second portion of the plurality of filter data structure comprise trie data structures.

5. The method of claim 1, further comprising:

defining a plurality of partition bit vectors, each partition bit vector including a string of bits, each bit position in the string associated with a corresponding partition; and

storing the partition bit vectors in a manner that links each filter entry to a corresponding partition bit vector.

6. The method of claim 5, further comprising:

defining a rule map containing a plurality of entries, each entry mapping a pseudo rule index to a corresponding rule in the ACL; and

storing the rule map in a data structure.

7. The method of claim 1, further comprising:

identifying a potential partitioning that may be implemented by partitioning along a dimension range at a depth below a covering range comprising one of a source prefix range or destination prefix range;

removing the covering range; and

employing the dimension range to partition along to form a plurality of partitions.

8. The method of claim 7, further comprising:

replicating rules across at least one partition boundary used to form the plurality of partitions.

9. The method of claim 1, wherein at least one partition is defined by a prefix pair comprising a source prefix range or value and a destination prefix range or value.

10. The method of claim 1, further comprising:

storing the filter data structures and the partition data in at least one file.

11. The method of claim 1, further comprising:

defining a plurality of rule bit vectors, each rule bit vector including a string of bits, each bit position in the string associated with a corresponding rule; and

storing the rule bit vectors in a manner that links each filter entry to a corresponding rule bit vector.

12. A method comprising:

extracting header data from a packet based on filter dimension criteria defined by an access control list (ACL) employed for packet classification;

for each filter dimension in the filter dimension criteria,

employing header data that is extracted corresponding to that filter dimension to identify an applicable entry in a corresponding filter data structure including a set of ranges and/or values corresponding to the filter dimension; and

retrieving a partition bit vector corresponding to the entry, the partition bit vector including a string of bits, each bit position in the string associated with a corresponding partition for the ACL;

logically ANDing the partition bit vectors together to identify one or more partitions to be searched;

for each entry that is identified,

retrieving portions of a rule bit vector associated with that entry, the portions corresponding to the one or more partitions to be searched;

for each of the one or more partitions,

logically ANDing the bit vector portions corresponding to that partition to identify a highest-priority rule for that partition; and

comparing the highest-priority rules to identify a rule with the highest priority.

13. The method of claim 12, wherein the filter data structures comprise reverse flow classification (RFC) chunks, and the header data corresponding to a given filter dimension is employed as an index into a corresponding RFC chunk that locates the applicable entry.

14. The method of claim 12, wherein the filter data structures comprise trie data structures, and the header data corresponding to a given filter dimension is used to perform a longest match lookup into a corresponding trie data structure that locates the applicable entry.

15. The method of claim 12, further comprising:

for each partition included in the one or more partitions to be searched,

determining a bit position of the highest priority rule identified for the partition;

determining a pseudo rule index based on the bit position and the partition;

indexing into a rule map using the pseudo rule index, the rule map mapping pseudo rule indexes to corresponding rules; and

employing the rule corresponding to the pseudo rule index has the highest priority rule for the partition.

16. The method of claim 12, wherein the filter dimensions comprise:

the first 16 bits of a source address;

the second 16 bits of the source address;

the first 16 bits of a destination address;

the second 16 bits of the destination address;

a source port value;

a destination port value; and

a protocol value.

17. A machine-readable medium, to store instructions that if executed perform operations comprising:

extracting header data including a source address, a destination address, a source port, and destination port, and a protocol field value from a packet;

for each dimension defined for a packet classification scheme employing a partitioned access control list (ACL) including a plurality of partitions, each partition including a corresponding set of rules for forwarding packets;

employing header data corresponding to the dimension as an input to a lookup process that locates a matching entry in a filter data structure corresponding to the dimension; and

retrieving a partition bit vector corresponding to the entry from memory, the partition bit vector including a string of bits, each bit position in the string associated with a corresponding partition for the ACL;

logically ANDing the partition bit vectors together to identify one or more partitions to be searched;

for each entry that is identified,

retrieving portions of a rule bit vector associated with that entry from memory, the portions corresponding to the one or more partitions to be searched;

for each of the one or more partitions,

logically ANDing the bit vector portions corresponding to that partition to identify a highest-priority rule for that partition; and

comparing the highest-priority rules to identify a rule with the highest priority.

18. The machine-readable medium of claim 17, wherein the filter data structures comprise recursive flow classification (RFC) chunks, and execution of the instructions performs further operations comprising:

calculating an index value based on the header data corresponding to a given filter dimension; and

employing the index value to locate the applicable entry corresponding to the header data in the RFC chunk.

19. The machine-readable medium of claim 17, wherein the filter data structures comprise trie data structures, and execution of the instructions performs further operations comprising:

identifying an applicable entry in a trie data structure corresponding to a given dimension by performing a longest match between the header data corresponding to that dimension and an entry in a corresponding trie data structure.

20. The machine-readable medium of claim 17, wherein execution of the instructions performs further operations comprising:

for each partition included in the one or more partitions to be searched,

determining a bit position of the highest priority rule identified for the partition;

determining a pseudo rule index based on the bit position and the partition;

indexing into a rule map using the pseudo rule index, the rule map mapping pseudo rule indexes to corresponding rules; and

employing the rule corresponding to the pseudo rule index as the highest priority rule for the partition.

21. A network line card, comprising:

a network processor,

a plurality of input/output (I/O) ports, communicatively-coupled to the network processor;

memory, communicatively-coupled to the network processor; and

a storage device, communicatively-coupled to the network processor, having instructions stored therein that if executed perform operations comprising;

extracting header data including a source address, a destination address, a source port, and destination port, and a protocol field value from a packet;

for each dimension defined for a packet classification scheme employing a partitioned access control list (ACL) including a plurality of partitions, each partition including a corresponding set of rules for forwarding packets;

employing header data corresponding to the dimension as an input to a lookup process that locates a matching entry in a filter data structure corresponding to the dimension; and

retrieving a partition bit vector corresponding to the entry from memory, the partition bit vector including a string of bits, each bit position in the string associated with a corresponding partition for the ACL;

logically ANDing the partition bit vectors together to identify one or more partitions to be searched;

for each entry that is identified,

retrieving portions of a rule bit vector associated with that entry from memory, the portions corresponding to the one or more partitions to be searched;

for each of the one or more partitions,

logically ANDing the bit vector portions corresponding to that partition to identify a highest-priority rule for that partition; and

comparing the highest-priority rules to identify a rule with the highest priority.

22. The network line card of claim 21, wherein the filter data structures comprise trie data structures, and execution of the instructions performs further operations comprising:

identifying an applicable entry in a trie data structure corresponding to a given dimension by performing a longest match between the header data corresponding to that dimension and an entry in a corresponding trie data structure.

23. The network line card of claim 21, wherein execution of the instructions performs further operations comprising:

for each partition included in the one or more partitions to be searched,

determining a bit position of the highest priority rule identified for the partition;

determining a pseudo rule index based on the bit position and the partition;

indexing into a rule map using the pseudo rule index, the rule map mapping pseudo rule indexes to corresponding rules; and

employing the rule corresponding to the pseudo rule index as the highest priority rule for the partition.