Abstract:
The present invention relates to a method and network element for classification of bit strings such as data packets on a per-flow basis, wherein a plurality of classification fields are searched for in respective search trees based on a matching procedure in which an index value is obtained in a leaf node of a search tree for each classification field. Index values obtained in said searching step are used to derive a policy to be applied to said data packet, wherein the number of index values is reduced by combining intermediate results of the searching step or the deriving step. Thereby, computational efficiency can be improved and memory requirements reduced.

Description:
FIELD OF THE INVENTION  
         [0001]    The present invention relates to a method and system for classification of binary strings, such as Internet Protocol (IP) packets or addresses or any other bit strings or parts thereof having a specific meaning.  
         BACKGROUND OF THE INVENTION  
         [0002]    The invention presented is motivated by the twin goals of increasing the capacity and the flexibility of the Internet. The Internet is comprised of packet-processing nodes, called routers, that route packets towards their destinations, and physical links that transport packets from one router to another. Owing to advances in optical technologies, such as Wavelength Division Multiplexing, the data rates of links have increased rapidly over the years. However, routers have failed to keep up with this pace because they must perform expensive per-packet processing operations. Every router is required to perform a forwarding decision on an incoming packet to determine the packet&#39;s next-hop router. This is achieved by looking up the destination address of the incoming packet in a forwarding table. Besides increased packet arrival rates because of higher speed links, the complexity of the forwarding lookup mechanism and the large size of forwarding tables have made routing lookups a bottleneck in the routers. The invention attempts to overcome this bottleneck.  
           [0003]    The invention concerns itself with increasing the flexibility and functionality of the Internet. Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination identically, and servicing them in a first-come-first-served manner. However, in differentiated service models, Internet Service Providers are seeking ways to provide differentiated or value-added services (on the same network infrastructure) to different users and/or user applications based on their different requirements and expectations of quality from the Internet, i.e. Service Level Agreements (SLAs). For this, routers need to have the capability to distinguish and isolate traffic belonging to different users and user flows, where a user can be a single individual or a group of individuals with common denominator (e.g., all people in a company), and user flow can be the data associated with one or a group of applications with a common denominator (e.g., voice, web browsing, e-mail) of a user. The ability to classify each incoming packet to determine the flow it belongs to is called packet classification, and could be based on an arbitrary number of fields, i.e. classification fields, in the packet header.  
           [0004]    As mentioned, routers may optionally classify packets into flows for special processing. In the following, it is described why some routers are flow-aware, and how they use packet classification to recognize flows. It is also provided a brief overview of the architecture of flow-aware routers. Then, the background leading to the formal definition of the packet classification problem is discussed.  
           [0005]    One main reason for the existence of flow-aware routers stems from an ISP&#39;s (ISP=Internet Service Provider) desire to have the capability of providing value-added services to its users. As mentioned, the Internet provides only a “best-effort” service, treating all packets at every forwarding point in the network identically, and servicing them in a first-come-first-served manner. However, the rapid growth of the Internet has caused increasing congestion and packet loss at intermediate routers. As a result, some users are willing to pay a premium price in return for better service for all or a group of applications from the network. To maximize their revenue, the ISPs also wish to provide different levels of service at different prices to users based on their requirements, while still deploying one common network infrastructure. In order to provide differentiated services, routers require additional mechanisms. These optional mechanisms—admission control, conditioning (metering, marking, shaping, and policing), resource reservation, queue management and fair scheduling (such as weighted fair queueing) or any other mechanism deemed suitable in any combination of a set or subset of these—require, first of all, the capability to distinguish and isolate traffic belonging to different user(groups) and/or applications based on service agreements negotiated between the ISP and its customer. This has led to demand for flow-aware routers that negotiate these service agreements, express them in terms of rules or policies configured on incoming packets, and isolate incoming traffic according to these rules. The functionality that specifies the policy that applies to a packet (e.g., to which flow a packet belongs) is a packet classifier (flow classifier) or simply classifier. The collection of policies is the network policy. Once classified, the policy (action to be taken) is executed. So a policy consists of a definition part (policy definition, implemented in the classifier) and an action (policy action). Each policy specifies a flow that a packet may belong to based on some criteria on the contents of the packet. This does not have to be limited to the header. E.g., for firewall functionality the system administrator also wants to look into the user data to check on the existence of viruses (typical user data). All packets belonging to the same flow are treated in a similar manner. The identified flow of an incoming packet specifies an action to be applied to the packet. For example, a firewall router may carry out the action of either denying or allowing access to a protected network. The determination of this action is called packet classification—the capability of routers to identify the action associated with the “best” policy an incoming packet matches. Packet classification allows ISPs to differentiate from their competition and gain additional revenue by providing different value-added services to different customers.  
           [0006]    A flow-aware router is able to check for every incoming packet if it belongs to a flow for which the action is already determined. This is done by checking a bit pattern of a predetermined number (N fld ) of classification fields (in IPv6: flow label or any field or combination thereof). The router checks if the bit pattern is present in a so-called flow table (this can be done via e.g. hashing), and if so, executes the actions specified for that flow. If the bit pattern is not found in the flow table, normal classification occurs, and optionally the packet bit pattern may be put in the flow table, together with the policy action to be applied for this flow.  
           [0007]    Packet classification enables a number of additional, non-best-effort network services other than the provisioning of value-added services. One of the well-known applications of packet classification is a firewall. Other network services that require packet classification include policy-based routing, traffic rate-limiting and policing, traffic shaping, and billing. In each case, it is necessary to determine which flow an arriving packet belongs to so as to determine—for example—whether to forward or filter it, where to forward it to, what type of service it should receive, or how much should be charged for transporting it. With the introduction of QoS (Quality of Service) in networks, classification of IP-packets in access routers has become more important than ever. In the differentiated service model, the value for the differentiated service code point (DSCP) in IP packets is based on the classification of the flow in the access points. Similarly, in a Multi-Protocol Label-Switched (MPLS) domain the packet flows have to be assigned to a specific Label-Switched Path (LSP) at the access point. Hence efficient classification methods are of high importance to router vendors.  
           [0008]    With the above background, the problem of packet classification can be described:  
           [0009]    In practice, a policy may have several components, wherein a policy component is not a general regular expression—often limited by syntax to a simple address/mask or operator/number(s) specification. In an address/mask specification, a “0” at bit position x in the mask denotes that the corresponding bit in the address is a “don&#39;t care” bit. Similarly, a “1” at bit position x in the mask denotes that the corresponding bit in the address is a significant bit. For instance, the first and third most significant bytes in a packet field matching the specification 171.4.3.4/255.0.255.0 must be equal to 171 and 3, respectively, while the second and fourth bytes can have any value, due to the fact that the mask bits of the first and third mask bytes are all set to “1” (i.e. “255” corresponds to “11111111”) and the mask bits of the second and fourth mask bytes are all set to “0”. Examples of operator/number(s) specifications are e.g. 1232 and range 34-9339, which specify that the matching field value of an incoming packet must be equal to 1232 in the former specification and can have any value between 34 and 9339 (both inclusive) in the latter specification. Note that a route-prefix of a length l can be specified as an address/mask pair where the mask is contiguous—i.e., all bits with value “1” appear to the left of (i.e., are more significant than) bits with value 0 in the mask. For instance, the mask for an 8-bit prefix is 255.0.0.0. A route-prefix of length l can also be specified as a range of width equal to 2 t  where t=32-l. In fact, most of the commonly occurring specifications in practice can be viewed as range specifications.  
           [0010]    In the following the background of search trees shall be briefly described:  
           [0011]    A radix trie, or simply a trie (the name trie comes from retrieval, but is pronounced “try”) is a binary tree that has labeled branches, and that is traversed during a search operation using individual bits of the search key. The left branch of a node is labeled “0” and the right-branch is labeled “1”. A node, v, represents a bit-string formed by concatenating the labels of all branches in the path from the root node to v. A prefix, p, is stored in the node that represents the bit-string p. For example, the prefix 0* is stored in the left child of the root node. A trie for W-bit prefixes has a maximum depth of W nodes. The longest prefix search operation on a given destination address proceeds bitwise starting from the root node of the trie. The left (right) branch of the root node is taken if the first bit of the address is “0” (“1”). The remaining bits of the address determine the path of traversal in a similar manner. The search algorithm keeps track of the prefix encountered most recently on the path. When the search ends at a null pointer, this most recently encountered prefix is the longest prefix matching the key.  
           [0012]    Therefore, finding the longest matching prefix using a trie takes W memory accesses in the worst case, i.e., has time complexity. The insertion operation proceeds by using the same bit-by-bit traversal algorithm as above. Branches and internal nodes that do not already exist in the trie are created as the trie is traversed from the root node to the node representing the new prefix. Hence, insertion of a new prefix can lead to the addition of at most other trie nodes. The storage complexity of a W-bit trie with N prefixes is thus O(NW). A significant amount of storage space is wasted in such a trie in the form of pointers that are null, and that are on chains—paths with 1-degree nodes, i.e., that have only one child.  
           [0013]    A Patricia tree (Patricia is an abbreviation for “Practical Algorithm To Retrieve Information Coded In Alphanumeric”, in the following referred as to “Patricia”) is a variation of a trie data structure, with the difference that it has no 1-degree nodes. Each chain is compressed to a single node in a Patricia tree. Hence, the traversal algorithm may not necessarily inspect all bits of the address consecutively, skipping over bits that formed part of the label of some previous trie chain. Each node now stores an additional field denoting the bit-position in the address that determines the next branch to be taken at this node. The original Patricia tree (see D. R. Morrison. “PATRICIA—practical algorithm to retrieve information coded in alphanumeric,” Journal of the ACM, Vol. 15, No. 14, pages 514-34, October 1968) did not have support for prefixes.  
           [0014]    However, prefixes can be concatenated with trailing zeros and added to a Patricia tree. Since a Patricia tree is a complete binary tree (i.e., has nodes of degree either 0 or 2), it has N exactly external nodes (leaves) and N−1 internal nodes. The space complexity of a Patricia tree is thus O(N). Prefixes are stored in the leaves of a Patricia tree. A leaf node may have to keep a linear list of prefixes, because prefixes are concatenated with trailing zeroes. The lookup algorithm descends the tree from the root node to a leaf node similar to that in a trie. At each node, it probes the address for the bit indicated by the bit-position field in the node. The value of this bit determines the branch to be taken out of the node. When the algorithm reaches a leaf, it attempts to match the address with the prefix stored at the leaf. This prefix is the desired answer if a match is found. Otherwise, the algorithm has to recursively backtrack and continue the search in the other branch of this leaf&#39;s parent node. Hence, the lookup complexity in a Patricia tree is quite high, and can reach O(W 2 ) in the worst case.  
           [0015]    A bit pattern of d fields has a total length of W(1)+W(2) . . . W(d)==W. We now have d tries. Prefix w(j) is now defined by bits W(1)+W(2)+ . . . +W(j−1)+1 to W(1)+W(2)+ . . . +W(j−1)+W(j), and the depth of trie j is W(j). The algorithm searches for a match in each of the trees in increasing order of prefix-lengths. For a Longest Prefix Match (LPM) of a string of w bit, w=W(1)+W(2)+ . . . +W(k−1)+k&lt;W(k), it requires an exact match for the first k−1 bit strings over the full length W(j) (j=1 . . . k−1) and an LPM for trie W(k). The first match found for all k tries yields the longest prefix matching the given address. For an Exact Match (EM) of a string of w=W bits, it requires and exact match for all d tries. Since one exact match operation on a Patricia tree of length W(j) takes O(W(j)) time, the complete matching operation has complexity O(W 2 (1))+O(W 2 (2)) . . . O(W 2 (d))&lt;=O(W 2 ) (sequential execution) or O(max(W 2 (j)) (parallel execution)  
           [0016]    It should be pointed out that the method is not limited to Patricia tree data structure; other forms of binary trie structures such as the level-compressed trie can be used as well (Andersson and Nilsson, Information Processing Letters, 46:295-300, 1993; Nilsson and Tikkanen, 2nd Workshop on Algorithm Engineering (WAE &#39;98), 1998). The main requirement is that the trie-structure allows for backtracking if a LPM is required (this is not required for RM ↑  and EM). Moreover, wherever an exact match is required, other algorithms than trie searches (linear search, hashing) can be used as well.  
         SUMMARY OF THE INVENTION  
         [0017]    It is an object of this invention to design efficient packet classification methods to enable routers to perform fast packet classification on multiple fields.  
           [0018]    This object is achieved by a method according to claim  1  or  15 .  
           [0019]    Advantageous developments are defined in the dependent claims.  
           [0020]    The method according to the invention is easy to implement in hardware, and contains several improvements that reduce memory requirements and increase computational efficiency. The improvements are based on using as much previous and future knowledge of the possible filters, i.e. searching is made context-sensitive. The improvements are  
           [0021]    1) Discontiguous value ranges x 1  and x 2  normally require two policies P 1  and P 2  that may refer to the same action P act . In the present formulation the policies P 1  and P 2  can be written as one policy P act (x 1  OR x 2 ). The method can be applied for all data sets U that co-determine the exact policy. The method reduces memory requirements by merging filters, wherein a filter F(x, y, z) classifies a packet and associates it with a policy P(x, y, z).  
           [0022]    2) Policies P that contain wild cards, i.e. P(x 1 ,*) normally require n identical policies P(x 1 ,y 1 ), P(x 1 ,y 2 ) . . . P(x 1 ,y n ) as there may be another policy P(x 2 ,y 1 ). The method is able to store all policies P(x 1 ,y 1 ), P(x 1 ,y 2 ) . . . P(x 1 ,y n ) in one table entry, and does not parse the data set y at all, i.e. certain parsing phrases can be skipped. The same applies for policies P(*,y 1 ) or policies P(x 1 ,*,z 1 ) in one table entry. This approach improves computational efficiency and reduces memory requirements.  
           [0023]    3) To efficiently search combinations P(x 1 ,y 1 ,z 1 ) lists are maintained in y 1  containing the value x 1 , and z 1  contains the tuplet (x 1 ,y 1 ). If there is a policy P(x1,y1,z 2 ) and z 1  is a descendant of z 2 , it follows P(x1,y1,z 1 )=P(x1,y1,z 2 ). The tuplet (x 1  ,y 1 ) is not stored in z 1 , but the policy is derived from backtracking to z 2  that contains the tuplet (x 1 ,y 1 ). This is modestly slower, but memory requirements are considerably lower. Defining a special bit in the data, policies P(x1,y1,z2) and P(x1,y2,z1) can be stored in one table entry P(x1,(y1 OR y2, z1) OR (y1, z1 OR z2)), even for EM and RM. For example, the protocol-dport-sport ranges (TCP,80 or 8080,*) (TCP,*,80 or 8080) all refer to HTTP flows. An additional property has been developed. It states:  
           [0024]    i) To reduce the size of lists, flags are carried in the lists indicating if a field should be considered in the comparison or not. If policy P(x1,y1,z2) is different from P(x1,y1,*)=P(x1,*,z1), the following applies. The list belonging to y=y1 contains the entry x1 plus a flag indicating that parsing z can be skipped. If y&lt;&gt;y1, z has to be parsed. If z=z1, z1 would contain a list containing all tuples (x1,y&lt;&gt;y1). However, the list belonging to z1 has the entry (x1,0x0) with the switch indicating that the value for y is irrelevant. Hence policies can be efficiently represented.  
           [0025]    ii) In case backtracking is not allowed (range matches, exact matches), policies of the type P(x1,*,z1) all have to be implemented in case there is a policy P(x1,y1,z2). If x=x1, a partial result is defined.  
           [0026]    4) Although the method is described for sequential implementation, parallel implementations are also possible without changing the data structure.  
           [0027]    The invention provides a new variant for Patricia tree and an optimized information structure. The new method provides a search method with several wild cards and regular expressions in traditional Patricia trees which is not possible in the prior art methods. Moreover, the inventive method minimizes the amount of needed searches and keeps the memory requirements reasonable, although still providing all needed functions. The data structure and the method that enable these optimizations are given below. The concept can be implemented in sequential or parallel codes.  
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0028]    In the following, the present invention will be described in greater detail based on preferred embodiments partly with reference to the accompanying drawing figures, in which:  
         [0029]    [0029]FIG. 1 shows a schematic block diagram of a forwarding path of an IP router in which the present invention can be implemented;  
         [0030]    [0030]FIG. 2 shows a flow diagram of a list search procedure according to the preferred embodiment;  
         [0031]    [0031]FIG. 3 shows a flow diagram of a search operation in the first search tree according to the preferred embodiment;  
         [0032]    [0032]FIG. 4 shows a flow diagram of a search operation in the second to fifth search tree according to the preferred embodiment; and  
         [0033]    [0033]FIG. 5 shows a flow diagram of a search operation in the final result search tree according to the preferred embodiment. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT  
       [0034]    The preferred embodiment of the present invention will now be described based on a classification example which may be implemented e.g. in the forwarding path of an IP router, as shown in FIG. 1. In this example, each of N fld  classification fields (e.g. N fld =5 in case of simple IP packet classification) are searched for in the appropriate tree of each field, either by an exact or range match (protocol, ports) or longest prefix match. A Range Match (RM) is a match of a bit string on a number of contiguous, ordered bitstrings. E.g. let the range R 1  be defined as 10-18 (decimal), there are no other ranges defined that are overlapping ranges such as 10-12. A possible search procedure for a RM is an LPM without backtracking. Each matching procedure for the field value s ends in a leaf S n  (s is member of set s n , sεs n ) with an index ind(s n ) of B ind  bit.  
         [0035]    As described in the IETF specification RFC 1633, an IP router may have two broad functional divisions: the forwarding path and a background code. The forwarding path is executed for every IP packet and therefore has to be highly optimized. The forwarding path may be divided into three sections: input driver  22 , Internet forwarder  24 , and output driver  28 . The Internet forwarder  24  interprets the Internet working protocol header appropriate to the protocol suite, e.g. The IP header for TCP/IP, or the CLNP header for OSI. For each packet, the Internet forwarder  24  executes a suite-dependent classification in a classifier  26  and then passes the packet and its class to the output driver  28 . The output driver  28  implements a packet scheduler which is largely independent of the detailed mechanics of the interface. The background code is simply loaded into a router memory and executed by a general-purpose central processing unit (CPU). These background routines create data structures used for controlling the forwarding path. If an admission control function accepts a new request, appropriate changes are made to databases of the classifier  26  and the packet scheduler e.g. to implement the desired quality of service (QoS).  
         [0036]    The general idea of the classification procedure according to the present invention is to reduce the number of indices by mapping intermediate results as much as possible onto one value using knowledge of previous searches. This is equivalent with after every step reducing the full set of possible policies as much as possible. Future knowledge is incorporated as much as possible using logicals. The classification algorithm described below is designed to optimize speed and reduce memory requirements as much as possible. However, since these requirements are often confliction, a trade-off has to be made in the design phase. Moreover, the algorithm assumes that another algorithm compatible with the search algorithm has generated the appropriate tree. The description of the tree generation algorithm will be omitted here for reasons of simplicity. To find the policy that applies to a packet characterized by the five classification fields (u,v,w,x,y) a combination of the following procedures can be applied.  
         [0037]    In a concatenation and hashing procedure, all indices ind(u i ), ind(v j ), ind(w k ), ind(x l ), and ind(y m ) are concatenated to one tuple (ind(u i ),ind(v j ),ind(w k ),ind(x l ),ind(y m )) of N fld  indices. One tuple is N fld ×B ind  bit long and is later denoted as Index Key Register (IKR), and the associated policy is found via hashing of the tuple. Any standard hashing procedure can be used. This method is very fast, but has high memory requirements due to the large redundancy (in general there are more field combinations than policies) and the fact that for efficient hashing a sparse hash table is required. Instead of hashing any regular tree search (binary, Patricia) of the tuple in a predefined final tree can be used as well.  
         [0038]    In a subsequent mapping and concatenation procedure, only one entry is required if the leafs u 1  and u 2  in the tree U resulting in the same policy for each set tuple (v j ,w k ,x l ,y m ) of the other fields (P(u 1 ,v j ,w k ,x l ,y m )=P(u 2 , v j ,w k ,x l ,y m )) are given the same index value ind(u 1 ). This is equivalent with P(u 1  OR u 2 ,v j ,w k ,x l ,y m ).  
         [0039]    In the following, an exact match function for mapping and matching during the search is described.  
         [0040]    If a policy exists for the tuple (uεu 1 ,vεv 1 ), store the index (tuple) ind(u 1 ) during the build-up in a list attached to leaf v 1  with index ind(v 1 ). If the search for the field v ends in leaf v 1 , search for the tuple ind(u 1 ) in the list of v 1 . If found, the subset of all policies (u 1 ,v 1 ,*,*,*) is found, and the result of the second search is the tuple (ind(u 1 ),ind(v 1 )). Any standard list search method can be used, as well as an exact match procedure using a patricia trie structure instead of a list. This procedure can be applied for all subsequent trees that are searched. For example, if there exists a policy for the set (u 1 ,v 1 ,w 1 ) the tuple (ind(u 1 ),ind(v 1 )) is stored in the leaf of w 1  with tuple ind(w 1 ). The search for the third field w ends in leaf w 1 , and the tuple (ind(u 1 ),ind(v 1 )) is searched in the list attached to w 1 . If found, the result of the first three searches is the tuple (ind(u 1 ),ind(v 1 ),ind(w 1 )). If a tuple (ind(u 1 ),ind(v 2 )) is not found in the list of leaf w 1 , there is no valid policy (exept the reject policy) for the field set (uεu 1 ,vεv 2 ,wεw 1 ) and the search stops.  
         [0041]    This procedure uses knowledge of the previous phases of the search more efficiently, and reduces thereby the memory requirements  
         [0042]    The above procedure can also be applied if instead of an exact match in subsequent trees a longest prefix match is required. If the policy that applies to the field tuple (uεu 1 ,vεv 1 ,wεw 1 ) is the same as for (uεu 1 ,vεv 1 ,wεsubset(w 1 )) (but policies (uεu 1 ,vεv 1 ,wεsubset(w 1 )) and (uεu 1 ,vεv 2 ,wεsubset(w 1 )) are different), the following optimization can be made using the fact that backtracking in LPM is allowed. If the search for w ends in subset(w 1 ) we search for the tuple (ind(u 1 ),ind(v 1 )) in the list attached to leaf subset(w 1 ). However, since w also belongs to w 1  and the associated policies are the same, it is sufficient to store the index tuple (ind(u 1  ),ind(v 1 )) in the list of leaf w 1  provided a backtracking operation is performed and it is searched for the index tuple (ind(u 1 ),ind(v 1 )) in the parent set of subset(w 1 ), i.e. w 1 . This optional memory optimization comes at the cost of modest lower performance due to the backtracking operation.  
         [0043]    Assume that, in addition to the index, a set of logicals is defined in each leaf, say (L U ,L V ,L W ,L X ,L Y ), and similarly in each list entry. Assume now that the policy that applies for the field tuple (uεu 1 ,vεv 1 ,wεw 1 ,xεx 1 ,yεy 1 ) is independent of the values of v, w, x and y, i.e. P(uεu 1 ,vεv 1 ,wεw 1 ,xεx 1 ,yεy 1 )=P(uεu 1 ,*,*,*,*). In this case, the logicals can be set to (L U ,L V ,L W ,L X ,L Y )=(T,F,F,F,F), where “T” denotes the binary value “true”, and “F” denotes the binary value “false”. This indicates that the subsequent trees V, W, X, and Y do not have to be searched, as the policy is sufficiently defined. A similar procedure can be applied for P(*,vεv 1 ,*,*,*). By masking the index ind(u 1 ) (i.e., mapping to a default value ind(u 0 )), all policies P(uεu 1 ,vεv 1 ,*,*,*)=P(uεu 2 ,vεv 1 *,*,*)=P(*,vεv 1 ,*,*,*) have only one entry. Since the end result is independent of the first result, the leaf logicals (L U ,L V ,L W ,L X ,L Y ) are set to (F,T,F,F,F) which increases speed and reduces memory requirements as no list is required in the leaf v 1 .  
         [0044]    The same can be applied for policies of the type P(uεu 1 ,vεv 1 ,*,*,*), P(uεu 1 ,*,w 1 ,*,*) or P(uεu 1 ,*,w 1 ,x 1 ,*) etc. For the policy P(uεu 1 ,vεv 1 ,*,*,*) the logicals (L U ,L V ,L W ,L X ,L Y ) of list entry ind(u 1 ) of leaf v 1  are set to (T,T,F,F,F). The result of the search at this phase is the tuple (ind(u 1 ),ind(v 1 )), and further searches are unnecessary. For the policy P(uεu 1 ,*,wεw 1 ,*,*) the logicals (L U ,L V ,L W ,L X ,L Y ) of list entry (ind(u 1 ),ind(v 1 )) of leaf w 1  are set to (T,F,T,F,F). Index ind(v1) is masked and the result of the complete search is the tuple (ind(u 1 ),ind(v 0 ),ind(w 1 )). For the policy P(uεu 1 ,*,wεw 1 ,*,*) the logicals (L U ,L V ,L W ,L X ,L Y ) of list entry (ind(u 1 ),ind(v 1 )) of leaf w 1  are set to (T,F,T,T,F) (as above), the result after searching the third tree is (ind(u 1 ),ind(v 0 ),ind(w 1 )). The list of leaf x 1  has an entry (ind(u 1 ),ind(v 0 ),ind(w 1 )), and the final result (ind(u 1 ),ind(v 0 ),ind(w 1 ),ind(x 1 )). The procedure outlined in the previous steps can again be applied to the entry (ind(u 1 ),ind(v 0 ),ind(w 1 )) of leaf x 1 , resulting in e.g. a tuple value (ind(u 1 ),ind(v 0 ),ind(w 0 ),ind(x 1 )).  
         [0045]    In case the number of policies of the above type is large, both memory requirements and performance will improve considerable.  
         [0046]    A further optimization can be obtained if a policy is sufficiently defined by either ind(v1) or ind(w1), i.e. P(uεu 1 ,vεv 1 ,*,xεx 1 ,yεy 1 ) OR P(uεu 1 ,*,wεw 1 ,xεx 1 ,yεy 1 ). This can be for example the case for HTTP applications, where either the source or destination port defines the flow as an HTTP-flow. A partial result bit L prt  is defined, which is set to “T” in leaf u 1 . In the list of v 1  the entry ind(u1) the L prt  is set to “F”, L W =F and the search continues with the remaining fields x and y. If v∉v 1 , the field w has to be inspected. To prevent listing all possible tuples (ind(u 1 ),ind(v n )≠ind(v 1 )) in the list of leaf w 1  which would map to the same policy P(uεu 1 ,vεv 1 ,*,xεx 1 ,yεy 1 )=P(uεu 1 ,*,wεw 1 ,xεx 1 ,yεy 1 ), listing the tuples (ind(u 1 ),ind(v n )≠ind(v 1 )) is omitted in the list of leaf w 1 . This results in a search failure (in case field w requires an exact match), but since L prt =T, we accept the result and the policy is P(uεu 1 ,*,wεw 1 ,xεx 1 ,yεy 1 ) (=P(uεu 1 ,vεv 1 ,*,xεx 1 ,yεy 1 )). This reduces memory requirements of leaf w 1  and speeds up the search procedure.  
         [0047]    In addition to the six logicals defined before, an additional logical L rst  may be defined which is set as soon as the policy is completely defined. This logical is an extra verification of successful completion of the search rather than a further optimization.  
         [0048]    In the present formulation there may still be cases in which two identical policies P(uεu 1 ,vεv 1 ,wεw 1 ,xεx 1 ,yεy 1 ) and P(uεu 2 ,vεv 1 ,wεw 1 ,xεx 1 ,yεy 1 ) have two entries (ind(u 1 ),ind(v 1 ),ind(w 1 ),ind(x 1 ),ind(y 1 )) and (ind(u 2 ),ind(v 1 ),ind(w 1 ),ind(x 1 ),ind(y 1 )). This can be prevented by mapping after each search the partial result (here: after tree V the tuples (ind(u 1 ),ind(v 1 )) and (ind(u 2 ),ind(v 1 ))) onto one tuple value (ind(u 1 ),ind(v 1 )). This reduces the number of list entries of subsequent trees even further.  
         [0049]    For tree searches the following rules may be applied:  
         [0050]    1. exact matches are commutative, i.e. (EM(a),EM(b))=(EM(b),EM(a))  
         [0051]    2. range matches are commutative, i.e. (RM(a),RM(b))=(RM(b),RM(a))  
         [0052]    3. an exact match and a range match are commutative, i.e. (EM(a),RM(b))=(RM(b),EM(a))  
         [0053]    4. an exact match and a longest prefix match are commutative, i.e. (EM(a),LPM(b))=(LPM(b),EM(a))  
         [0054]    5. A range match and a longest prefix match are commutative, i.e. (RM(a),LPM(b))=(LPM(b),RM(a))  
         [0055]    6. longest prefix matches are not commutative, i.e. (LPM(a),LPM(b))≈(LPM(b),LPM(a))  
         [0056]    7. all matches are associative, i.e. (xM(a),xM(b),xM(c))=(xM(a),(xM(b),xM(c))) where x is either E (exact), R (range) or LP (longest prefix).  
         [0057]    This allows to optimize the classification even further. The associative property permits the search to be executed in parallel. All optimizations can be used, except for the use of the partial result flag. This may be achieved e.g. by changing the order to protocol—source port—destination port—source address—destination address.  
         [0058]    As regards the hardware implementation, the classification can be done as a series of longest prefix or exact matches to find a condition key for each of the selectors. The relevant selectors are the source address, destination address, the carried protocol and for certain protocols the source and destination port numbers.  
         [0059]    An ACR (Algorithm Control Register) status register indicates which searches are needed and defines corresponding flag values. In the present case of five classification fields (N fld =5), each of the possible 5 searches adds a N-bit index to the 5×N-(N may be different for different fields: here we assume N=8 for all classification fields) bit IKR (Index Key Register). The final search is done on the 5×N -bit IKR classification result search tree. The classification result search returns the classification result vector address. If any tree failures exist, an error flag status bit is set.  
         [0060]    In the following, possible structures of the tree leaf data are described.  
         [0061]    The 16-bit leaf data of the first tree may be arranged as indicated in Table 1.  
                           TABLE 1                                   Index   Index value of the search.                           Logicals   L U , L V , L W , L X , L Y , L rst , L prt                 L U  = Logical indicating if U-tree has to be searched,               T: search, F: do not search               L V  = Logical indicating if V-tree has to be searched.               T: search, F: do not search               L W  = Logical indicating if W-tree has to be searched.               T: search, F: do not search               L X  = Logical indicating it X-tree has to be searched.               T: search, F: do not search               L Y  = Logical indicating if Y-tree has to be searched.               T: search, F: do not search               L rst  = Logical if final result is obtained. T: yes, goto               final tree; F: go to next tree               L prt  = Partial result logical                      
 
         [0062]    Furthermore, the 32-bit leaf data of the second to fifth tree may be arranged as indicated in Table 2.  
                   TABLE 2                       Index   Index value of the search.                   Logicals   L U  = Logical indicating if U-tree has to be searched           T: search, F: do not search           L V  = Logical indicating if V-tree has to be searched.           T: search, F: do not search           L W  = Logical indicating if W-tree has to be searched.           T: search, F: do not search           L X  = Logical indicating if X-tree has to be searched.           T: search, F: do not search           L Y  = Logical indicating if Y-tree has to be searched.           T: search, F: do not search           L rst  = Logical if final result is obtained. T: yes, goto final           tree: F: go to next tree           L prt  = Partial result logical       ListAddr[15:0]   Pointer to list containing indices of previous searches.                  
 
         [0063]    Additionally, the 16-bit leaf data of the final result tree may be arranged as indicated in Table 3.  
                   TABLE 3                           ResultAddress]   Address of action to be applied to the classified packet           (policy action)                  
 
         [0064]    [0064]FIG. 2 shows a flow diagram of a list search procedure according to the preferred embodiment.  
         [0065]    All list searches may be done by a linear search. Based on a list address from the leaf, a first list entry is obtained. Then, a masked list index field (LIF) is generated using the list flag field (LFF). The flags of the LFF can be used to mask any byte of the index of the LIF from being compared to the IKR (Index Key Register). The masked value of List index field is then compared to the 40-bit IKR starting from the MSB of the IKR. If the masked LIF is identical with the content of the IKR, a fully successful search result is indicated. If it is not identical, the list entry field (LEF) is checked. If the LEF is “1”, the next list entry is processed. If the LEF is “0”, the Exact Match (EM) field (EF) in the leaf is checked. If it is “1” or the concerned node is a top tree node, the L prt  is checked in the ACR. If L prt =“1”, a partially successful search result is indicated. On the other hand, if L prt =“0”, a failure is indicated as the search result. If the EF is “0” and the concerned node is not a top tree node, backtrack is indicated as the search result. The above lists can be stored in a search tree memory in continuous byte memory locations.  
         [0066]    There may be the following four types of list searches provided:  
         [0067]    i) a 2 nd  list search (i.e. list search done during 2 nd  tree search) may be done with a list structure as shown in Table 4.  
                                   TABLE 4                       Index key                           register (IKR)   Bits[39:32]   Bits[31:24]   Bits[23:16]   Bits[15:8]   Bits[7:0]                   List Index   Index from   0   0   0   0           search in           U-tree       List Flag (for mask)   L U     L V     L W     L X     L Y                            
 
         [0068]    ii) a 3 rd  list search (i.e. list search done during 3 rd  tree search) may be done with a list structure as shown in Table 5.  
                                   TABLE 5                       Index key                           register   Bits[39:32]   Bits[31:24]   Bits[23:16]   Bits[15:8]   Bits[7:0]                   List Index   Index from   Index   0   0   0           search in   from           U-tree   search in               V-tree       List Flag (for mask)   Flags[6]   Flags[5]   Flags[4]   Flags[3]   Flags[2]                  
 
         [0069]    iii) a 4 th  list search (i.e. list search done during 4 th  tree search) may be done with a list structure as shown in Table 6.  
                                   TABLE 6                       Index key   Bits   Bits   Bits   Bits   Bits       register   (5N-1..4N)   (4N-1..3N)   (3N-1..2N)   (2N-1..N)   (N-1..0)                   List Index   Index from   Index   Index   0   0           search in   from   from           U-tree   search in   search in               V-tree   W-tree       List Flag (for mask)   Flags[6]   Flags[5]   Flags[4]   Flags[3]   Flags[2]                  
 
         [0070]    iv) a 5 th  list search (i.e. list search done during 5 th  tree search) may be done with a list structure as shown in Table 7.  
                                   TABLE 7                       Index key   Bits   Bits   Bits   Bits   Bits       register   (5N-1..4N)   (4N-1..3N)   (3N-1..2N)   (2N-1..N)   (N-1..0)                   List Index   Index from   Index from   Index   Index   0           search in   search in   from   from           U-tree   V-tree   search in   search                   W-tree   in X-tree                       Index[7:0]       List Flag (for mask)   Flags[6]   Flags[5]   Flags[4]   Flags[3]   Flags[2]                  
 
         [0071]    Table 8 shows an example for a list and a corresponding list search.  
                           TABLE 8                               List                   Index[15:0]               List   (=3 rd  list   Index Key       Entry   Flag[6:2]   search)   Register(=12AB000000)                   ‘1’   “11000”   0x10A0   0x10A0xxxxxx ≠ 0x12ABxxxxxx       ‘1’   “11000”   0x11AB   0x11ABxxxxxx ≠ 0x12ABxxxxxx       ‘1’   “10000”   0x1000   0x10xxxxxxxx ≠ 0x12xxxxxxxx       ‘0’   “01000”   0x00AB   0xxABxxxxxx = 0xxABxxxxxx       (=Last           (Match found!)       entry of       list)                  
 
         [0072]    In the example shown in Table 8, a hexadecimal value “12AB000000” is contained in the IKR, wherein the hexadecimal values “A” to “F” correspond to the bit patterns or tuples “1010” to “1111”, respectively. Thus, the 40-bit IKR contains the bit patterns “0001 0010 1010 1011 0000 0000 0000 0000 0000 0000”. The List Index is selected according to the 3 rd  tree search, i.e. The index bit pattern comprises bits 0 to 15 (16 bits). This List Index is masked with the List Flag (bits 6 to 2), wherein each bit of the List Flag can be used for masking a corresponding bit pattern of 8 bits of the List Index. In the upper three rows of Table 8, the result of the comparison of the masked List Index with the IKR does not lead to a match, while in the case of the last table row a match between the List Index and the IKR is found.  
         [0073]    [0073]FIG. 3 shows a flow diagram of a procedure corresponding to a 1 st  classifier tree search of the classification algorithm. This algorithm is straightforward because there is no list search present. If match is not found in LPM case the index value is set to zero (i.e. IKR bits 5N−1 . . . 4N are set to zero). If the search was an Exact Match (EM) case and there was no match, the search fails. There are control flags that selects which of the five possible search keys is used in the 1 st  search (e.g. source address (SA), destination address (DA), protocol, source port number or destination port number). This selection may be done with a control register. According to FIG. 3, the search key is selected with the control bits of the control register. If the selection indicates a 1 st  tree search, the ACR is set to “1111100” and the IKR is set to zero, i.e. “0x0”. Then, a modified Patricia search is performed in the classifier U-tree. If the search was not successful, the status register is set to #1 tree failure. Furthermore, a search failure may indicated, preferably only an EM failure or an invalid top node. If the search was successful, the Index Field is copied to the IKR bits 5N−1 . . . 4N, the Flag Field is copied to the ACR, and the procedure moves on to the classifier #2 tree search (2 nd  tree).  
         [0074]    [0074]FIG. 4 shows a flow diagram indicating a procedure corresponding to the 2 nd , 3 rd , 4 th  and 5 th  search tree part of the classification, which is more complicated. First a normal search is done in the search tree and if match is found the linear list search is done in list which start address was returned as search result during tree search. There are control bits that select which of the five possible search keys is used in the search (e.g. source address (SA), destination address (DA), protocol, source port or destination port). This selection may be done with control registers. Initially, based on the bits of the ACR, a final result search or a modified Patricia search in a selected one (#n) of the search trees is initiated, while the ACR register is not changed in the latter case. If the search was not successful, a search failure is indicated, only for EM failure or an invalid top node, the status register is set to a #n tree failure. If the search was successful, the flag L tree-n  of the corresponding tree is checked. If it is set to “1”, a linear search according to FIG. 2 is performed in the list of the n th  tree. If the flag is set to “0”, the ACR is set to “0000010”, the IKR is set to “0x0” and the flow proceeds to the next (i.e. (n+1 ) th ) tree if n&lt;5. If n=5, the final result search is selected.  
         [0075]    Based on the result of the linear search in the list (i.e. list search), the procedure branches to the modified Patricia search if a backtrack is determined, indicates a search failure, copies the Index Field and masked List Index Field to the respective IKR bits and the List Flag Field to the ACR register if the search was fully successful, or sets the respective IKR bits to “0x0” and the L prt  bit of the ACR to “0” if the search was only partially successful.  
         [0076]    [0076]FIG. 5 shows a flow diagram of a procedure according to the final result search which is done after restructuring of the IKR is ready (i.e. after all or some of the possible classifier tree #1-5 searches have been done). Final result search is an exact match search. Out, is not relevant for the invention  
         [0077]    According to FIG. 5, a check is initially performed as to whether the IKR is set to zero, i.e. The ACR is set to “0000010”. If so, the status register is set correspondingly and the packet is dropped. Otherwise, the L rst  bit of the ACR is checked. If it is not set to “1”, a search failure is determined and the status register is set correspondingly, i.e. final tree failure.  
         [0078]    IPSec part is not relevant for the invention. Hence, in FIG. 5 everything after the diamond “Search oke” is to be scrapped.  
         [0079]    It is noted that the present invention is not restricted to the specific features of the above preferred embodiments, but can be applied to any classification in a classifier or forwarder (i.e. 1-dimensional classifier) of any area of application of data strings where classification on a number of classification fields each comprising at least one bit of the data strings is required Thus, the present invention may vary within the scope of the attached claims.