|Publication number||US7480299 B2|
|Application number||US 11/064,227|
|Publication date||Jan 20, 2009|
|Filing date||Feb 22, 2005|
|Priority date||Nov 3, 2004|
|Also published as||US20060092947|
|Publication number||064227, 11064227, US 7480299 B2, US 7480299B2, US-B2-7480299, US7480299 B2, US7480299B2|
|Inventors||Daniel Martin O'Keeffe, Eugene O'Neill, Edele O'Malley, Kam Choi|
|Original Assignee||3Com Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (9), Referenced by (18), Classifications (16), Legal Events (9)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This invention relates to packet-based communication networks, particularly those which incorporate a transmission protocol such as TCP (Transmission Control Protocol). The invention particularly relates to the use of access control lists in and by network units such as switches and routers and to a rules engine employing such lists.
Packet-based communication systems such as those based on Ethernet standards and others include network units, which can be both hardware and software based, but usually are a mixture of hardware and software processing, and which, among other actions, perform a lookup on fields including address fields within a packet to obtain ‘forwarding data’ to determine so far as that unit is concerned at least one destination for the packet. Usually the forwarding data is in the form of a bit mask which indicates the port or ports from which the packet or a copy thereof should be sent. The lookup may be based on either ‘layer 2’ (media access control) addresses or ‘layer 3’ (network or IP addresses) or both.
Before a packet is forwarded from a switch it may be necessary to perform other processing operations which may affect the forwarding of the packet and/or copies thereof. For example, the destination port bitmask may need modification in view of VLAN membership rules, spanning tree rules, or trunking rules. The rules are administered by respective ‘engines’ and a final ‘post-processing engine’ coupled to the various processing engines and the lookup engine produces a final port bit mask.
In addition to the use of addressing of data packets, network systems usually employ a transmission protocol which is intended, with the aid of a handshake routine and subsequent codified commands and acknowledgements, reliable data transfer, because an address protocol such as IP does not in itself guarantee the deliver of any particular packet. As is indicated above, one such protocol is TCP, which is implemented as far as a network unit is concerned by means of segments encapsulated within packets. A TCP segment normally includes ‘source port’ and destination port’ numbers which provide connection to processes within a sending host and a receiving host, a sequence number, which is the byte stream number of the first byte in the data sent in the segment, an acknowledgement number, which indicates the sequence number of the next byte that the respective host is expecting from the other host, various other fields including one bit ACK, SYN and FIN flags, a header length field and user data.
Network units are usually realized by means of an application-specific integrated circuit (ASIC) which has appropriate terminals or pins for coupling to ports and other external connecting elements. Memory space on an ASIC is necessarily limited and it is usual for the ASIC to supplement a comparatively small internal memory by a substantially larger external, off-chip’ memory, either a static random access memory (SRAM) or a content addressable memory (CAM).
Access Control Lists
Access control lists (ACLs) refer at least in part to protocol data at a higher level than the network layer and represent an additional processing feature which may be used for checking the security of transmission of data and other purposes. If ACL lists are used, then an ACL search has to be performed on each packet to determine whether there is an ACL match. If there is a match then the forwarding action which is determined by the ACL match must be performed instead of the forwarding action determined by the address lookup (as modified as the case may be by the actions of the other processing engines).
An access control list (ACL) may simply consist of a basic ACL, which when relating to TCP normally consists of five fields identifying the IP destination address (IPDA), the IP source address (IPSA), the TCP destination port number, the TCP source port number and the Protocol. However, other ACLs may comprise the basic 5-tuple ACL along with other flags, such as the SYN, FIN, RST flags or other flags or fields. It is preferable to provide at least one ACL per TCP flow direction and desirable to provide a multiplicity of ACLs per flow direction. Each ACL requires an entry in a database, and a basic ACL is quite long; source port and destination port numbers are (currently) two bytes each, network addresses are four bytes each for IPv4 and 16 bytes each for IPv6. Thus it will be apparent that, since memory space is inevitably limited, the more ACLs are required or desirable per flow, the fewer flows with ACLs can be supported.
The present invention has a general object of making the use of access control lists more versatile and efficient and a particular object of reducing the memory space required for access control lists.
In a preferred embodiment of the invention, a ‘basic’ rule may stored in an respective database, i.e. an ‘off-chip’ database and search is made for any other fields using a smaller ‘internal’ (on-chip) database. Rules, conveniently termed ‘extension rules’, may be stored in a different, preferably internal, database and are each uniquely identified by an identifier called herein ‘ruleID’. An ACL entry contains an identifier, preferably a pointer, called herein an ‘extACLID’, which is a pointer to at least one of the extension rules. When a packet comes into the system, both the databases are searched. The search may provide an ACL match in the ACL database, and a rule match in the extension rule database. If the extACLID of the matched ACL corresponds to the ruleID of the matched extension rule, then a chained rule is formed. This allows an ACL to chain with an extension rule, creating an ‘Extended ACL’. If the same ruleID is used for multiple ‘extension’ rules, and there is a match with that ruleID, the respective ACL is now pointing to multiple ‘extension’ rules and thereby creates a multiplicity of ‘Extended ACLs’.
Since the search for extension rules is generally a search for small fields (such as TCP flags) in a packet, the entries identifying the extension rules consume much less memory than a 5-tuple ACL. Therefore, chaining one ACL to multiple extension rules to form multiple ACLs per TCP flow is much less memory intensive as storing multiple ACLs per TCP flow.
Other features of the invention will become apparent from the following description with reference to the accompanying drawings.
The unit has a multiplicity of external ports 10 by which the unit can receive addressed data packets and from which addressed data packets can be forwarded. It includes an internal communication system, herein simply represented by a bus 11, by which packets, control signals and commands are conveyed across the unit. The unit includes a main memory 12 which receives packets while they are processed before being forwarded, or in some cases, discarded. When a packet is received, address fields in its header are examined by a lookup engine 13 which determines, with the aid of a lookup or forwarding database (not shown) forwarding data for the packet. As is well known to those skilled in the art, forwarding data for the destination specified in the packet may not exist and therefore the unit may need to perform an address resolution protocol to obtain one. This and other customary features of a unit such as a switch or router will not be described.
The unit usually includes other processing engines 14 which, as indicated earlier may modify or supplement the forwarding data obtained by the lookup (LU) engine. The actions prescribed by the engines 13 and 14 are collated by a post-processing engine 15 which will (in the absence of any other consideration) produce a final forwarding action based on the forwarding data and in particular produce a ‘final’ bit mask so that the packet can be sent from the port or ports determined by the forwarding action.
The unit includes a central processor 16 which has a variety of tasks not directly relevant to the invention; among other tasks it controls the establishment of a TCP flow within the unit in a manner to be described.
The unit's memory may be partly constituted by on-chip memory and partly by off-chip memory. This not only allows for expansion but is a consequence of network working. A switch may have thousands of addresses to store but only a few may be active at any one time. Since space is always limited and valuable, it is usual for the on-chip memory to be comparatively small and the off-chip memory to be much larger.
As thus far described the unit operates on known principles.
Although the reference data (such as source port and destination port numbers) in a TCP segment are not necessary for the operation of a switch as such, since the switch operates primarily in accordance with network or link layer address data, it is nevertheless useful to provide, as a security feature or otherwise, processing which has recourse to access control lists that refer at least in part to transmission protocol fields in a packet.
Access Control Lists (ACLs) have to be set up in accordance with a TCP flow, and there needs to be an entry in an ACL table (i.e. memory) for each of the two directions of a TCP flow.
When a TCP flow is initiated from one host to another, then as previously mentioned, a packet is sent with a TCP segment of which the TCP SYN flag is set (to 1). The unit which is on the path between the hosts will have the ACL list facility enabled, and a packet which has the TCP SYN flag set will be diverted to the CPU so that that it can examine the packet in more detail. On determining that the packet is secure, the packet is forwarded onto the destination host, and the details of the flow are put into the ACL table. If the destination host is willing to accept communication from the original source host, then a packet is sent back with the TCP ACK flag set. Again the unit intercepts the packet, checks its integrity, and if the packet secure, updates the ACL table for the flow in the direction of the destination host to source host. The packet is allowed to continue on its path. Some more control packets may be required to establish the TCP flow fully, and the CPU may intercept these to guarantee their integrity. Finally, the flow is fully established and the ACL table has an ACL entry for both directions of the flow.
It is convenient to define a ‘basic’ ACL for a particular flow direction. For a TCP flow, such a basic ACL is preferably a five field (often termed 5-tuple) ACL comprising the IP destination address (IPDA), the IP source address (IPSA), the TCP destination port number, the TCP source port number and the Protocol. Other ACLs may consist of the basic 5-tuple ACL, along with other fields such as one or more TCP flags (such as SYN, FIN or RST). It is conceivable to have at least three ACLs per flow. As each ACL consumes an entry in the ACL database, the more ACLs per flow, the fewer the number of flows the system can support.
Therefore, not only is it quite inefficient to store each of these ACLs, the system is inflexible. More particularly, a lookup engine which searches the external database is typically looking at certain fields in a packet and it is usual to customize the engine accordingly. Therefore, if the external lookup engine is designed to search for the basic ACL and also the TCP flags, it may not be possible to search for a new field if there arise a new requirement for that field.
The present invention is based on the storage of the basic ACL in a respective database, which may be the ‘external’ memory and the storage of extension ‘rules’ in a separate table, which may be held within a smaller internal memory. These rules will prescribe particular values for a selected field. The results of the two searches are chained together.
The operation of the rules engine 17 is shown in
The ‘ruleID’ 26 is a number or pointer which uniquely identifies the respective rule. The basic rule 22 in the ACL table entry will, for example, specify a particular value for a respective basic 5-tuple ACL. It will have been entered as noted above when a respective ‘flow’ has been established. The extACLID 24 is a pointer to at least one of the internal rules in the rule table 25. It may identify a single extension rule 27 uniquely but may point to a range of extension rules in table 25.
When a packet comes into the unit, both tables are searched. Suppose first that the relevant fields in the packet produce a match in both the ACL table 21 and the extension rule table 25. The match will of course ‘return’ the relevant extACLID pointer and the relevant ruleID pointer respectively. These are compared, as shown by block 29 and decision 30. If the extACLID 24 of the matched ACL rule 22 equals the ruleID 26 of the matched extension rule 27, then a ‘chain rule’ is formed and the action to be executed (block 31) will be the action 28 specified for the matched extension rule from the rule table 25. If there is no match between the extACLID and the ruleID, the prescribed action to be executed (block 32) will be the action 23 that is specified in the ACL entry.
As mentioned, the extACLID can match with more than one ruleID, so that a single basic ACL rule can thereby form a multiplicity of chained rules. Thus different actions may be executed for a matched ACL depending on the actions specified in the rules table for the different extension rules that can be chained to the common ACL rule.
Because the search engine for the rule table 25 is normally searching for small fields (such as TCP flags), the entries in the rule table 25 consume much less memory than a 5-tuple ACL. Therefore, chaining one ACL to multiple extension rules to form multiple ACLs per TCP flow is much less memory intensive as storing a corresponding multiplicity of ACLs per TCP flow. Furthermore since an action prescribed by an extension rule in the rule table 25 will generally be the same regardless of which ACL points to it (usually an instruction to copy a packet or to redirect it to a management port), then these extension rules can be shared between multiple ACLs. This is again another saving on costly memory.
In a first example suppose that a Packet A is searched against the external ACL table 21, and matches against an entry ACL #1. The ACL match has a extACLID pointing to extension Rule #5 (which merely for the sake of example is ‘TCP SYN flag set’). The packet is also searched against the extension rule table 25, but does not match against any rule therein. Then the extACLID of the matched ACL does not match any ruleID, and so the action 23 of the matched ACL is executed.
In a second example a packet B is searched against the ACL table, and matches against an ACL rule, say ACL #2. The matched entry has a extACLID pointing to extension rule #5 (TCP SYN flag set) in the extension rule table 25. The packet is also searched against the extension Rule table, and matches against extension rule #5. As the extACLID of the matched ACL is equal to the ruleID of the matched extension rule, a chained rule (Extended ACL) is formed and the action 28 of extension rule #5 must be used. This action could be to redirect the packet to a management port.
These two examples show two different packets, matching against two different ACLs, but both pointing to the same extension rule. As the required action (redirect to management port) is the same for both packets, the technique allows the internal rule to be shared between the two ACLs.
Accordingly the invention allows a more efficient use of memory as well as the combination of a scaleable search engine (for the ACL table) with the versatility of extension rules. The use of an ‘internal’ engine for the ‘extension’ rules renders the system more versatile because it is much more feasible to accommodate new rules or new fields.
The result (if any) of the searching of the ACL table and the extension rules table is an action, either a chain rule action 28 or an ACL action 23, which will be executed by the post-processing engine rather than the action prescribed by the lookup or other processing engines.
Of course, if the search of the ACL table produces no match, no instruction will be given to the post-processing engine, which will cause the forwarding of the packet using the forwarding data obtained from the lookup engine, as possibly modified by the other processing engines.
The invention has been particularly described with reference to TCP but is applicable to other possible transmission protocols which could be used to define a flow.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US6377577 *||Jun 30, 1998||Apr 23, 2002||Cisco Technology, Inc.||Access control list processing in hardware|
|US6651096 *||Apr 20, 1999||Nov 18, 2003||Cisco Technology, Inc.||Method and apparatus for organizing, storing and evaluating access control lists|
|US6658002 *||Jun 17, 1999||Dec 2, 2003||Cisco Technology, Inc.||Logical operation unit for packet processing|
|US6763394 *||Aug 22, 2001||Jul 13, 2004||Pluris, Inc.||Virtual egress packet classification at ingress|
|US6778530 *||Nov 8, 1999||Aug 17, 2004||Juniper Networks, Inc.||Method and apparatus for multiple field matching in network device|
|US7024515 *||Nov 15, 2002||Apr 4, 2006||Cisco Technology, Inc.||Methods and apparatus for performing continue actions using an associative memory which might be particularly useful for implementing access control list and quality of service features|
|US7227842 *||Apr 23, 2002||Jun 5, 2007||Tensilica, Inc.||Fast IP packet classification with configurable processor|
|US20040258043 *||May 21, 2004||Dec 23, 2004||International Business Machines Corporation||Packet classification|
|US20060221967 *||Mar 31, 2005||Oct 5, 2006||Narayan Harsha L||Methods for performing packet classification|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8132248 *||Jun 15, 2008||Mar 6, 2012||Trend Micro Incorporated||Managing configurations of a firewall|
|US8222822||Oct 27, 2009||Jul 17, 2012||Tyco Healthcare Group Lp||Inductively-coupled plasma device|
|US8327431||Oct 28, 2011||Dec 4, 2012||Trend Micro Incorporated||Managing configurations of a firewall|
|US8575843||May 29, 2009||Nov 5, 2013||Colorado State University Research Foundation||System, method and apparatus for generating plasma|
|US8878434||Jul 2, 2012||Nov 4, 2014||Covidien Lp||Inductively-coupled plasma device|
|US8994270||Sep 27, 2010||Mar 31, 2015||Colorado State University Research Foundation||System and methods for plasma application|
|US9028656||Mar 31, 2010||May 12, 2015||Colorado State University Research Foundation||Liquid-gas interface plasma device|
|US9225644||Sep 14, 2012||Dec 29, 2015||International Business Machines Corporation||Using special-case hardware units for facilitating access control lists on a networking element|
|US9272359||Mar 31, 2010||Mar 1, 2016||Colorado State University Research Foundation||Liquid-gas interface plasma device|
|US9287091||Mar 26, 2015||Mar 15, 2016||Colorado State University Research Foundation||System and methods for plasma application|
|US9288886||May 29, 2009||Mar 15, 2016||Colorado State University Research Foundation||Plasma-based chemical source device and method of use thereof|
|US9306848||Feb 18, 2013||Apr 5, 2016||International Business Machines Corporation||Using special-case hardware units for facilitating access control lists on a networking element|
|US9532826||Jan 21, 2014||Jan 3, 2017||Covidien Lp||System and method for sinus surgery|
|US9555145||Jan 13, 2014||Jan 31, 2017||Covidien Lp||System and method for biofilm remediation|
|US20090025077 *||Jun 15, 2008||Jan 22, 2009||Bart Trojanowski||Managing configurations of a firewall|
|US20110139751 *||May 29, 2009||Jun 16, 2011||Colorado State Univeristy Research Foundation||Plasma-based chemical source device and method of use thereof|
|US20110140607 *||May 29, 2009||Jun 16, 2011||Colorado State University Research Foundation||System, method and apparatus for generating plasma|
|CN104486240A *||Dec 8, 2014||Apr 1, 2015||福建星网锐捷网络有限公司||Method and device for classifying data packets|
|U.S. Classification||370/392, 726/3|
|International Classification||H04L12/813, H04L12/743, H04L12/701, H04L12/773, G06F7/04, H04L12/28|
|Cooperative Classification||H04L45/60, H04L45/7453, H04L47/20, H04L45/00|
|European Classification||H04L45/60, H04L45/00, H04L47/20, H04L45/7453|
|Feb 22, 2005||AS||Assignment|
Owner name: 3COM CORPORATION, MASSACHUSETTS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:O KEEFFE, DANIEL M.;O NEILL, EUGENE;O MALLEY, EDELE;AND OTHERS;REEL/FRAME:016338/0379;SIGNING DATES FROM 20041215 TO 20050118
|Jul 6, 2010||AS||Assignment|
Owner name: HEWLETT-PACKARD COMPANY, CALIFORNIA
Free format text: MERGER;ASSIGNOR:3COM CORPORATION;REEL/FRAME:024630/0820
Effective date: 20100428
|Jul 15, 2010||AS||Assignment|
Owner name: HEWLETT-PACKARD COMPANY, CALIFORNIA
Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE SEE ATTACHED;ASSIGNOR:3COM CORPORATION;REEL/FRAME:025039/0844
Effective date: 20100428
|Dec 6, 2011||AS||Assignment|
Owner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P., TEXAS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HEWLETT-PACKARD COMPANY;REEL/FRAME:027329/0044
Effective date: 20030131
|May 1, 2012||AS||Assignment|
Owner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P., TEXAS
Free format text: CORRECTIVE ASSIGNMENT PREVIUOSLY RECORDED ON REEL 027329 FRAME 0001 AND 0044;ASSIGNOR:HEWLETT-PACKARD COMPANY;REEL/FRAME:028911/0846
Effective date: 20111010
|Jul 20, 2012||FPAY||Fee payment|
Year of fee payment: 4
|Nov 9, 2015||AS||Assignment|
Owner name: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP, TEXAS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.;REEL/FRAME:037079/0001
Effective date: 20151027
|Jul 28, 2016||FPAY||Fee payment|
Year of fee payment: 8
|Jul 28, 2016||SULP||Surcharge for late payment|
Year of fee payment: 7