Systems and methods for determining a flow of data

CA 02642844 2015-03-12

64725-1190

SYSTEMS AND METHODS FOR DETERMINING A FLOW OF DATA

BAKCGROUND OF THE INVENTION

[0001] This invention relates generally to computer networks and more particularly to systems and methods for determining a flow of data.

[0002] Conventional rule-based computer security firewalls are based upon varyingly complex sets of rules, or “rule bases”. Data packets that enter such a firewall are compared to information in, and rules of, one or more rule bases to determine whether the data packets should be allowed to pass through the firewall. Rule bases are structured around concepts of logical comparisons, such as Boolean logic, and sequential rule flow through a list of rules.

As rule bases become more complex, they require more system and processor overhead. Consequently, organizations that use firewalls often compromise between rule base complexity and perceived required data throughput, sacrificing some amount of security in favor of perfonnance.

BRIEF DESCRIPTION OF THE INVENTION

[0003] In one aspect, a method for determining a flow of data is described. The method includes determining whether a packet including a first number of at least one bit within a first set is assigned a classification value based on the at least one bit within the first set and determining a result to be applied to the packet upon determining that the packet is assigned the classification value. The method further includes analyzing, by a processor, at least one bit of a second number within a second set of the packet upon determining that the packet cannot be assigned the classification value based on the first number of at least one bit of the packet.

[0004] In another aspect, a processor is described. The processor is configured to determine whether a packet including a first number of at least one bit within a first set is assigned a classification value based on the at least one bit within the first set and determine a result to be applied to the packet upon determining that the packet is assigned the

CA 02642844 2015-03-12

64725-1190 classification value. The processor is further configured to analyze at least one bit of a second number within a second set of the packet upon determining that the packet cannot be assigned the classification value based on the first number of at least one bit of the packet.

[0005] In yet another aspect, a computer-readable medium is described. The computer-readable medium is encoded within a computer program configured to determine whether a packet including a first number of at least one bit within a first set is assigned a classification value based on the at least one bit within the first set, determine a result to be applied to the packet upon determining that the packet is assigned the classification value, and analyze at least one bit of a second number within a second set of the packet upon determining that the packet cannot be assigned the classification value based on the first number of at least one bit of the packet.

[0006] In still one aspect, a method for determining a flow of data is described. The method includes generating a graphical user interface including a map, receiving a selection of a point on the map, displaying a plurality of results upon receiving the selection of the point, receiving a selection of one of the results, and assigning the one of the results to the point.

[0006a] There is also provided a method for determining a flow of data, said method comprising: receiving a data packet; accessing one or more tables, each of the one or more tables being populated with finite number of listed bit sets, each listed bit set having an equal number of bits as a set of bits previously designated for extraction from the packet and each listed bit set in the one or more tables being associated with either a predetermined classification value assignable to a packet or a designation that the packet cannot be classified; analyzing by a processor the packet including a previously identified first set of at least one bit to determine whether the packet is assigned a classification value based on extracting the previously identified first set of at least one bit and comparing the first set of at least one bit with the finite number of listed bit sets in the one or more tables to determine whether the first set of at least one bit matches a listed bit set in the one or more tables; determining a result to be applied to the packet upon determining that the packet is assigned the classification value

CA 02642844 2015-03-12

64725-1190 based on the first set; upon determining that the packet cannot be assigned a classification value based on the first set continuing to sequentially analyze one or more other previously identified sets of at least one bit of the packet to determine whether the packet is assigned a classification value based upon an analyzed set of bits, the sequential analysis continuing until such time that the packet is assigned a classification value or all of the one more other previously identified sets of bits have been analyzed; and determining a result to be applied to the packet upon determining that the packet is assigned the classification value based upon an analyzed set of the one or more other previously identified sets of bits.

[0006b] Another aspect of the present disclosure provides a processor configured to: receive a data packet; access one or more tables, each of the one or more tables being populated with finite number of listed bit sets, each listed bit set having an equal number of bits as a set of bits previously designated for extraction from the packet and each listed bit set in the one or more tables being associated with either a predetermined classification value assignable to a packet or a designation that the packet cannot be classified; determine whether the packet including a first set of at least one bit is assigned a classification value based on extracting the previously identified first set of at least one bit and comparing the first set of at least one bit with the finite number of listed bit sets in the one or more tables to determine whether the first set of at least one bit matches a listed bit set in the one or more tables, the first set of at least one bit being previously identified; determine a result to be applied to the packet upon determining that the packet is assigned the classification value; and sequentially analyze one or more other previously identified sets of at least one bit of the packet upon determining that the packet cannot be assigned the classification value based on the first set of at least one bit of the packet.

[0006c] According to a further aspect, there is provided a computer-readable medium having recorded thereon computer-executable instructions that when executed by a computer perform steps to: receive a data packet; access one or more tables, each of the one or more tables being populated with finite number of listed bit sets, each listed bit set having an equal number of bits as a set of bits previously designated for extraction from the packet and each

2a

CA 02642844 2015-03-12

64725-1190 listed bit set in the one or more tables being associated with either a predetermined classification value assignable to a packet or a designation that the packet cannot be classified; determine whether the packet including a first set of at least one bit is assigned a classification value based on extracting the previously identified first set of at least one bit and comparing the first set of at least one bit with the finite number of listed bit sets in the one or more tables to determine whether the first set of at least one bit matches a listed bit set in the one or more tables, the first set of at least one bit being previously identified; determine a result to be applied to the packet upon determining that the packet is assigned the classification value; apply the determined result to the packet; and sequentially analyze one or more other previously identified sets of at least one bit within the packet upon determining that the packet cannot be assigned the classification value based on the first set of at least one bit of the packet until such point that a previously identified set of at least one bit matches a bit set listed in the one or more tables that has an assigned classification value or all previously identified sets of bits in the packet have been compared to at least one of the one or more tables.

[0006d] There is also provided a method for determining a flow of data, the method comprising: a. receiving a data packet; b. providing a memory device containing one or more tables, each one or more table being populated with a finite number of listed bit sets, each listed bit set having an equal number of bits as a set of bits previously designated for extraction from the packet and each listed bit set in the one or more tables being associated with either a predetermined classification value assignable to the packet or a designation that the packet cannot be classified; the set of bits previously designated for extraction from the packet being: (1) one set among a plurality of sets of bits designated for extraction from the packet; and (2) comprising one or more bits, none of which bits are included in any other set of bits designated for extraction from the packet; c. extracting from the packet a first set of bits designated for extraction; d. inputting the extracted first set of bits designated for extraction into the memory device and comparing the extracted first set of bits with the finite number of listed bit sets in a table to determine whether the extracted first set of bits matches a listed bit set in the table; e. determining whether the packet receives a predetermined

2b

CA 02642844 2015-03-12

64725-1190 classification value or a designation that the packet cannot be classified based upon which listed bit set in the table the extracted first set of bits matches; and f. applying a predetermined result or procedure to the packet upon determining that the packet can be assigned a classification value from the table or continuing to sequentially process the remaining sets of bits designated for extraction by repeating procedures c-e until such point that an extracted set of bits matches a bit set listed in a table that has an assigned classification value or all sets of bits in the packet designated for extraction have been extracted and compared to the entries of at least one table.

BRIEF DESCRIPTION OF THE DRAWINGS

[0007] Figure 1 is a block diagram of an embodiment of a system for determining a flow of data.

[0008] Figure 2 is a detailed block diagram of an embodiment of a system for determining a flow of data.

[0009] Figure 3 is a block diagram of another embodiment of a system for detennining a flow of data.

2c

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313

[0010] Figure 4 is a diagram of an embodiment of a packet of data received by a processor of the system of Figure 3.

[0011] Figure 5 is a flowchart of an embodiment of a method for determining a flow of data.

[0012] Figure 6 is an embodiment of a graphical user interface (GUI) used to create a plurality of tables.

DETAILED DESCRIPTION OF THE INVENTION

[0013] Figure 1 is a block diagram of an embodiment of a system 10 for determining a flow of data. System 10 includes a server system 12 and a plurality of user devices 14 connected to server system 12. As used herein, the term server is not limited to just those integrated circuits referred to in the art as a computer, but broadly refers to a processor, a microcontroller, a microcomputer, a programmable logic controller, an application specific integrated circuit, any other programmable circuit, and any combination of hardware and software, and these terms are used interchangeably herein. In one embodiment, user devices 14 are computers including a web browser, and server system 12 is accessible to user devices 14 via a network, such as, a local area network (LAN) and a wide area network (WAN). The LAN may include an Intranet and the WAN may include the Internet.

[0014] User devices 14 are interconnected to the network through many interfaces including dial-in-connections, cable modems, and high-speed integrated services digital network (ISDN) lines. Alternatively, user devices 14 include a web-based phone or other web-based connectable equipment, which arc capable of interconnecting to the network. Server system 12 includes a database server 16 connected to a centralized database 18 that includes a method for determining a flow of data.

[0015] In one embodiment, centralized database 18 is stored on database server 16 and can be accessed by potential users at one of user devices 14 by

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 logging onto server system 12 through one of user devices 14. In one embodiment, centralized database 18 is stored remotely from server system 12.

[0016] Figure 2 is a detailed block diagram of an embodiment of a system 22 for determining a flow of data. System 22 includes a server system 23. Server system 23 is an example of server system 12. Server system 23 includes database server 16, an application server 24, a web server 26, a fax server 28, a directory server 30, and a mail server 32. A disk storage unit 34, which is a single database, is coupled to database server 16 and directory server 30.

[0017] Servers 16, 24, 26, 28, 30, and 32 are coupled in a local area network (LAN) 36. Alternatively, a WAN could be used in place of LAN 36. In addition, a system administrator work station 38, a user work station 40, and a supervisor work station 42 are coupled to LAN 36. Each work station 38, 40, and 42 is a personal computer having a web browser.

[0018] Server system 23 is communicatively coupled to various workstations 52 and 54, which are operated by individuals or employees. A person or user operating work station 52 can access server system 23. Work stations 52 and 54 are personal computers having a web browser. Work station 54 is located at a remote location. Server system 23 is also communicatively coupled to a workstation 46 via an Internet service provider (ISP) connection 48.

[0019] Furthermore, fax server 28 communicates with workstation 52 and any remotely located user system, including a workstation 56 via a telephone link. Each workstation 38, 40, 42, 46, 52, 54, and 56 is an example of user device 14. Fax server 28 communicates with other work stations 38, 40, and 42 as well. Server system 23 executes methods, described herein, for determining a flow of data.

[0020] The communication in the exemplary embodiment is illustrated as being performed via the Internet, however, any other wide area network (WAN) type communication can be utilized in other embodiments. Systems and methods for determining a flow of data are not limited to being practiced via Internet.

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313

In one embodiment, methods for determining a flow of data are stored in disk storage unit 34, which is an example of a computer-readable medium, and are executed by any of servers 16, 24, 26, 28, 30, and 32. Other examples of a computer readable medium include a floppy disk, a compact disc-read only memory (CD-ROM), and a digital video disk (DVD).

[0021] Figure 3 is a block diagram of an embodiment of a system 100 for determining a flow of data. System 100 includes a processor 102, a memory device 104, an input device 106, and an output device 108. Processor 102 may be either an x86 architecture operating a Linux™ operating system or an x86_64 architecture operating the Linux™ operating system. The x86 architecture is available from Intel™ corporation and the x86_64 architecture is available from Advanced Micro Devices™ (AMD) corporation. Examples of memory device 104 include a random access memory (RAM) and a read-only memory (ROM). Examples of input device 106 include a mouse and a keyboard. Examples of output device 108 include a cathode ray tube (CRT) and a liquid crystal display (LCD). As used herein, the term processor is not limited to just those integrated circuits referred to in the art as a processor, but broadly refers to a computer, a microcontroller, a microcomputer, a programmable logic controller, an application specific integrated circuit, and any other programmable circuit.

[0022] Processor 102 executes the methods for determining a flow of data. In one embodiment, processor 102 is a firewall that prevents communication of packets of data between two networks, such as Internet and an Intranet, based on a security policy.

[0023] Figure 4 is a diagram of an embodiment of a packet 150 of data received by processor 102. Packet 150 includes a version 152, an Internet protocol (IP) network address, and data 156. Examples of version 152 include an IPv4 version and an IPv6 version of IP network addresses. Examples of the IP network address of packet 150 include either a source address or a destination address. The source address is an address of a source of sender, such as workstation 52, of packet

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313

150. The destination address includes an address of a receiver or a destination, such as workstation 38 or 40, of packet 150. In one embodiment, packet 150 also includes a header length of a header of packet 150, a type of service to be provided to packet 150, a total length of packet 150, a header checksum that is used by processor 102 to determine whether all bits of the header are valid, a time to live of packet 150, a plurality of flags used to determine whether to fragment packet 150, and a fragment offset used by processor 102 to determine whether packet 150 is a portion of an IP datagram. In the embodiment, if IP network address of packet 150 is the source address, packet 150 further includes the destination address and if IP network address of packet 150 is the destination address, packet 150 includes the source address.

[0024] Figure 5 is a flowchart of an embodiment of a method 200 for determining a flow of data. Processor 102 receives 202 packet 150 and obtains 204 or extracts N bits from packet 150. Example of N includes 3, 4, 6, 8, or 10. Another example of N bits includes less than 32 bits of the IP'network address of packet 150. Yet other example of N includes less than 128 bits of the IP network address of packet 150. Still other example of N bits includes 2 bits of other than 3 most significant bits (MSBs) and 3 least significant bits (LSBs) of 8 MSBs of the IP network address of packet 150. Other example of N includes 2 LSBs of 8 MSBs of the IP network address of packet 150. Processor 102 determines that the IP network address of packet 150 is located after a bit a and before a bit β of packet 150 based on version 152 of packet 150, and extracts N bits between the bit a and the bit β from the IP network address of packet 150. As another example, processor 102 determines that data 156 is located after a bit γ and before a bit η of packet 150 based on version 152 of packet 150 and extracts N bits from the data 156 between the γ and η bits. As yet another example, processor 102 determines that a port address is located after a bit σ and before a bit ω of packet 150 based on based on version 152 of packet 150 and extracts N bits between the σ and ω bits from port address. An example of the port address includes a source port address, such as a transmission control protocol (TCP) or a user datagram protocol (UDP) port number, of a source computer application executed by the source and a destination port address, such as a TCP or a UDP port number, of a destination

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 computer application executed by the destination. As another example, processor 102 extracted some of N bits from the IP network address of packet 150 and the remaining of the N bits from the port address.

[0025] Processor 102 determines 206 whether packet 150 can be classified based on N bits of packet 150. Processor 102 determines 206 whether packet 150 can be classified by comparing N bits with a table 1 provided, via input device 106, by the user to memory device 104.

<td> Row Number</td><td> Sub-ranges</td><td> Classification Values</td><td> Results</td>

<td> 1</td><td> R1-R2</td><td> Cl</td><td> SI</td>

<td> 2</td><td> R3-R4</td><td> C2</td><td> S2</td>

<td> 3</td><td> R5-R6</td><td></td><td></td>

<td> 4</td><td> R7-R8</td><td></td><td></td>

<td> 5</td><td> R9-R10</td><td></td><td></td>

<td> 6</td><td> R11-R12</td><td></td><td></td>

Tabic I

[0026] The sub-ranges R1-R2, R3-R4, R5-R6, R7-R8, R9-R10, and RI 1-R12 within table I form a finite set, such as a set of M bits of port addresses, a set of M bits of authorization data, such as user names and passwords, a set of M bits of IP network addresses, and a set of M bits of a combination of IP network addresses and port addresses. Examples of the classification values Cl and C2 include a set of country codes identifying a plurality of countries, a set of sub-region codes identifying a plurality of sub-regions, a set of hacker codes identifying a plurality of computer hackers, a set of spammer codes identifying a plurality of computer spammers, a set of virus codes identifying a plurality of computer viruses, a set of Trojan codes identifying a plurality of Trojans, a set of worm codes identifying a plurality of computer worms, a plurality of phishing codes identifying a plurality of phishers, a set of intruder codes identifying a plurality of intruders that gain access to a computer network connected to processor 102 via a backdoor, a set of North Atlantic treaty organization (NATO) country codes identifying a plurality of NATO countries, a set of corporation codes identifying a plurality of corporations, a set of government agency

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 codes identifying a plurality of government agencies, a set of Internet service provider (ISP) codes identifying a plurality of ISPs, a set of industrial sector codes identifying a plurality of industrial sectors, and a set of Department of Defense (DoD) codes identifying a plurality of DoDs. For example, Cl is a country code for Canada and C2 is a country code for United States of America (U.SA.). Examples of the industry sectors include an oil industry, an airplane industry, a computer software industry, and a gaming and entertainment industry.

[0027] Examples of the results or procedures SI and S2 include an acceptance or denial of packet 150 by processor 102. Other example of the results SI and S2 include assigning a priority or not assigning a priority to packet 150. Yet other examples of the results include assigning a Quality of Service (QoS) to packet 150. Example of QoS includes that packet 150 is not dropped in reaching the destination. Other example of QoS includes that packet 150 is not delayed in reaching the destination. The acceptance of packet 150 by processor 102 includes allowance of packet 150 to pass through the firewall from one computer network to another computer network to reach the destination. An example of the denial of packet 150 by processor 102 includes sending, by processor 102, packet 150 for applying one of the procedures to a honeypot that masquerades as system 100 to trap either an attacker, such as a spammer of a hacker, to determine a characteristic of the attacker and represent the characteristic of the attacker to a Law Enforcement Agency. An example of the denial of packet 150 includes deleting packet 150 to prevent packet 150 from further proceeding through a network. Yet another example of the denial of packet 150 by processor 102 includes not allowing packet 150 to pass through the firewall to reach the destination. As still another example, the denial of packet 150 by processor 102 includes shunting, by processor 102, packet 150 to another processor 102 for performing at least one of a “Whois” query, an American Registry of International Numbers (AKIN) lookup of packet 150, and tracing a route of packet 150 within a computer network to determine the attacker that sent packet 150. Upon determining the attacker, processor 102 reports the attacker to the Law Enforcement Agency.

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313

[0028] Processor 102 compares N bits of packet 150 with M Bits of each of sub-ranges R1-R2, R3-R4, R5-R6, R7-R8, R9-R10, and R11-R12 of table 1 to determine whether one of the sub-ranges have the M bits that match the N bits. It is noted that M is equal to N. Upon determining that one of the sub-ranges, such as RlR2, has M bits that match N bits, processor 102 assigns one of the corresponding classification values, such as Cl, to packet 150. As an example, upon determining that N bits match M bits of the sub-range R3-R4, processor 102 assigns the classification value C2 to packet 150. If processor 102 determines that one of the classification values within table I exist corresponding to one of the sub-ranges R1-R2, R3-R4, R5R6, R7-R8, R9-R10, and R11-R12, of tabic I, having M bits that match the N bits, processor 102 determines that packet 150 is classified. On the other hand, if processor 102 determines that one of the classification values, within table I, corresponding to one of the sub-ranges R1-R2, R3-R4, R5-R6, R7-R8, R9-R10, and Rl 1-R12, of table I, having M bits that match the N bits does not exist, processor 102 determines that packet 150 cannot be classified. For example, upon comparing M and N bits, processor 102 determines that the N bits of packet 150 match the M bits within the sub-range R5-R6 that does not correspond to one of the classification values Cl and C2. In the example, upon determining, by processor 102, that the N bits do not correspond to one of the classification values Cl and C2, processor 102 determines that packet 150 cannot be classified.

[0029] Upon determining that packet 150 is classified, processor 102 either provides 208 a procedure or one of the results SI and S2 corresponding to one of the classification values or sends packet 150 to another processor 102, such as one included within workstation 52, that applies the one of the results to packet 150. As an example, upon determining that packet 150 is classified under the classification value Cl, processor 102 applies the result SI to packet 150. As another example, upon determining by processor 102 that packet 150 has the classification value C2, processor 102 sends packet 150 to another processor, such as one included within workstation 54, that applies the result S2 to packet 150. Upon determining that packet 150 is classified, processor 102 does not examine bits of packet 150 other than N bits

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313

[0030] A table II, provided below, is an example of table I.

<td> ROW NUMBER</td><td> IP NETWORK ADDRESS SUBRANGES</td><td> COUNTRY CODES</td><td> COUNTRIES</td><td> RESULTS</td>

<td> 1</td><td> 0</td><td> 148</td><td> Reserved</td><td> Accept</td>

<td> 2</td><td> 1-2</td><td> 199</td><td> Unassigned</td><td> Deny</td>

<td> 3</td><td> 3-4</td><td> 189</td><td> United States</td><td> Accept</td>

<td> 4</td><td> 5-9</td><td> 199</td><td> Unassigned</td><td> Deny</td>

<td> 5</td><td> 10-22</td><td> 148/189</td><td> Reserved, United States</td><td> Accept</td>

<td> 6</td><td> 23</td><td> 199</td><td> Unassigned</td><td> Deny</td>

<td> 7</td><td> 24</td><td></td><td></td><td></td>

<td> 8</td><td> 25</td><td> 188</td><td> United Kingdom</td><td> Accept</td>

<td> 9</td><td></td><td> ...</td><td></td><td> ...</td>

<td> 10</td><td> 43</td><td> 88</td><td> Japan</td><td> Accept</td>

<td> 11</td><td> ...</td><td> • .</td><td> ...</td><td> ...</td>

<td> 12</td><td> 47</td><td> 36</td><td> Canada</td><td> Accept</td>

<td> 13</td><td></td><td> ...</td><td></td><td> • · ·</td>

<td> 14</td><td> 53</td><td> 66</td><td> Germany</td><td> Deny</td>

<td> 15</td><td> 54-56</td><td> 189</td><td> United States</td><td> Accept</td>

<td> 16</td><td> 57</td><td> 61</td><td> France</td><td> Deny</td>

<td> 17</td><td> ...</td><td> ...</td><td></td><td></td>

<td> 18</td><td> 80-88</td><td></td><td></td><td></td>

<td> 19</td><td> 89-124</td><td> 199</td><td> Unassigned</td><td> Deny</td>

<td> 20</td><td></td><td> ...</td><td></td><td></td>

<td> 21</td><td> 216-223</td><td></td><td></td><td></td>

<td> 22</td><td> 224 - 255</td><td> 148</td><td> Reserved</td><td> Accept</td>

Table II

IP network address sub-ranges of table II are an example of the subranges of table I, country codes of table II are an example of classification values of table I, and results of table II are an example of the results of table I. For example, each IP network address sub-range, such as 54 or 57, are MSBs of an IP network address within the finite set.

[0031] Processor 102 compares N bits of packet 150 with each of the IP network address sub-ranges of table II and determines one of the IP network address sub-ranges having M bits that match the N bits. For example, upon determining by

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 network addresses 47.0.0.0 - 47.255.255.255 of table II matches N bits of packet 150, processor 102 assigns a country code 36 of table 11 to packet 150 and determines that packet 150 is sent from Canada. Upon determining that packet 150 is sent from Canada, processor 102 determines to accept packet 150 based on table II. As another example, upon determining by processor 102 that M bits of IP network address subrange 23 of table II matches N bits of packet 150, processor 102 assigns a country code 199 of table II to packet 150 and determines that packet 150 is sent from an unassigned region. Upon determining that packet 150 is sent from the unassigned region, processor 102 determines to deny packet 150 as shown in table II. As yet another example, upon determining by processor 102 that M bits of IP network address subrange 227 of a plurality of IP network addresses 224.0.0.0 — 255.255.255.255 of table II matches N bits of packet 150, processor 102 assigns a country code 148 of table II to packet 150 and determines that packet 150 is sent from a reserved region. Upon determining that packet 150 is sent from the reserved region, processor 102 determines to accept packet 150 based on table TI. As still another example, upon determining by processor 102 that M bits of IP network address sub-range 216-223 matches N bits of packet 150, processor 102 determines that packet 150 cannot be classified based on a classification value.

[0032] A table TTT, provided below, is another example of table T.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 0-127</td><td> Allow</td>

<td> 128-160</td><td> Deny</td>

<td> 161-163</td><td> Allow</td>

<td> 164-167</td><td> Deny</td>

<td> 168-191</td><td> Allow</td>

<td> 192-207</td><td> Deny</td>

<td> 208-255</td><td> Allow</td>

Table III

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313

IP network address sub-ranges of table III are 8 MSBs, which are an example of M bits, of IP network address sub-ranges, within the finite set, of table 1. Moreover, results of table III are an example of results of table L

[0033] Processor 102 receives N bits of packet 150, compares the N bits with M bits of each IP network address sub-ranges of table III to determine one of the IP network address sub-ranges having M bits that match the N hits. Upon determining that N bits of packet 150 match with M bits within any of the IP network address sub-ranges 0-127, 161-163, 168-191, and 208-255, processor 102 determines that packet 150 is allowed to pass through the firewall. On the other hand, upon determining that N bits of packet 150 match M bits within any of IP network address sub-ranges 128-160, 164-167, and 192-207, processor 102 determines to deny passage of packet 150 through the firewall.

[0034] A table IV, shown below, is yet another example of table I.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> MSBs of IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 0-127</td><td> 0</td><td> Allow</td>

<td> 128-255</td><td> 1</td><td></td>

Table IV

IP network address sub-ranges of table IV are an example of subranges of table I and results of table IV are an example of results of table I.

[0035] Processor 102 compares an MSB, which is an example of N, of the IP network address of packet 150 with an MSB, which is an example of M, of each of IP network address sub-ranges of table IV to determine whether the MSB of packet 150 matches either bit 1 or bit 0. Upon determining that MSB of the IP network address of packet 150 matches bit 0, which is an MSB of IP network address sub-range 0-127 of table IV, processor 102 determines, based on the results of table IV, to allow passage of packet 150 via the firewall. On the other hand, upon determining that MSB of the IP network address of packet 150 matches bit 1, which is an MSB of IP network address sub-range 128-255 of table IV, processor 102 determines, based on the results

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 of table IV, that packet 150 cannot he classified and does not provide a result to packet 150.

[0036] Upon determining that packet 150 cannot be classified based on N bits of packet 150, processor 102 obtains 210 G bits other than the N bits from packet 150. Upon determining that packet 150 cannot be classified by comparing N bits with M bits of sub-ranges of table 1, processor 102 obtains G bits from packet 150. As an example, processor 102 determines that packet 150 is an IPv4 packet 150 and extracts 7 bits sequentially following MSB of the IP network address of packet 150, where the MSB is N^th bit of the IP network address of packet 150. As yet another example, processor 102 determines that packet 150 is an IPv4 packet 150 and extracts 3 MSBs of 8 MSBs of the IP network address of packet 150, where 2 bits other than the 3 MSBs and 3 LSBs of the IP network address are N bits of the IP network address of packet 150. As yet another example, processor 102 determines that packet 150 is an IPv6 packet 150 and extracts 4 LSBs from 16 MSBs of the IP network address of packet 150, where 12 MSBs are N bits of the IP network address of packet 150. An example of G includes bits other than N bits of 8 MSBs of the IP network address of packet 150. Another example of G includes 15 bits consecutively following an MSB of 16 MSBs of the IP network address of packet 150, where the MSB is Ν^Λ bit of the IP network address of packet 150.

[0037] Processor 102 determines 206 whether packet 150 can be classified based on the G bits of packet 150. Processor 102 applies table V, shown below, stored in memory device 104 by the user to determine whether packet 150 can be classified based on the G bits of packet 150.

<td> SUB- RANGES</td><td> CLASSIFICATION VALUES</td><td> RESULTS</td>

<td> SR1-SR2</td><td> C3</td><td> S3</td>

<td> SR3-SR4</td><td> C4</td><td> S4</td>

<td> SR5-SR6</td><td></td><td></td>

<td> SR7-SR8</td><td></td><td></td>

Table V

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313

[0038] The sub-ranges SR1-SR2, SR3-SR4, SR5-SR6, and SR7-SR8 within table V form a finite set, such as such as a set of G bits of port addresses, a set of G bits of authorization data, a set of G bits of IP network addresses, and a set of G bits of a combination of IP network addresses and port addresses. Example of the classification values C3 and C4 include a set of country codes identifying a plurality of countries, a set of sub-region codes identifying a plurality of sub-regions, a set of hacker codes identifying a plurality of computer hackers, a set of spammer codes identifying a plurality of computer spammers, a set of virus codes identifying a plurality of computer viruses, a set of Trojan codes identifying a plurality of Trojans, a set of worm codes identifying a plurality of computer worms, a plurality of phishing codes identifying a plurality of phishers, a set of intruder codes identifying a plurality of intruders that gain access to a computer network connected to processor 102 via a backdoor, a set of NATO country codes identifying a plurality of NATO countries, a set of corporation codes identifying a plurality of corporations, a set of government agency codes identifying a plurality of government agencies, a set of ISP codes identifying a plurality of ISPs, a set of industrial sector codes identifying a plurality of industrial sectors, and a set of DoD codes identifying a plurality of DoDs. Examples of the results S3 and S4 include an acceptance or denial of packet 150 by processor 102. Other examples of the results S3 and S4 include assigning a priority or not assigning a priority to packet 150. It is noted that G is equal to H.

[0039] Upon determining that one of the sub-ranges SR1-SR2, SR3SR4, SR5-SR6, and SR7-SR8 of table V has H bits that match G bits of packet 150, processor 102 assigns one of the corresponding classification values, such as C3 and C4, to packet 150. As an example, upon determining that G bits match H bits of the sub-ranges SR3-SR4, processor 102 assigns the classification value C4 to packet 150. If processor 102 determines that one of the classification values within table V exists corresponding to one of the sub-ranges, of table V, having H bits that match G bits of packet 150, processor 102 determines that packet 150 is classified. On the other hand, if processor 102 determines that one of the classification values within table V does not exist corresponding to one of the sub-ranges, within table V, having H bits that match

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 upon comparing, by processor 102, of G bits of packet 150 with the sub-ranges of table V, processor 102 determines that G bits match H bits within the sub-range SR5-SR6 that does not correspond to one of the classification values C3 and C4. In the example, upon determining by processor 102 that G bits of packet 150 do not correspond to one of the classification values C3 and C4, processor 102 determines that packet 150 cannot be classified.

[0040] Upon determining that packet 150 is classified, processor 102 either provides 208 a procedure or one of the results S3 and S4 corresponding to one of the classification values of table V or sends packet 150 to another processor 102, such as one included within workstation 54, that provides 208 one of the results S3 and S4 to packet 150. As an example, upon determining that packet 150 is classified as having the classification value C3, processor 102 applies the results S3 to packet 150. As another example, upon determining by processor 102 that packet 150 has the classification value C2, processor 102 sends packet 150 to another processor 102 that applies the result S2 to packet 150. Upon determining that packet 150 is classified, processor 102 does not extract hits of packet 150 other than the G and N bits to determine whether packet 150 can be classified.

[0041] A tabic VI, shown below, is an example of table V.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> BITS THE IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 128-160</td><td> 00</td><td> Deny</td>

<td> 161-207</td><td> 01-10</td><td></td>

<td> 168-255</td><td> 11</td><td> Allow</td>

Table Vl

Bits of IP network address sub-ranges of table VI are an example of H bits of the sub-ranges of table V. For example, two, which is an example of H, bits 00 are second and third MSBs of 128 within IP network address sub-range 128-160 of table VI. As another example, bits 01 within table VI arc second and third MSBs of

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313

161 within IP network address sub-range 161-207 of table VI. Results of table VI are an example of results of table V.

[0042] Processor 102 receives G bits of packet 150, compares the G bits with H bits to determine whether packet 150 can be classified. For example, upon receiving G bits, processor 102 determines that G bits match 01 and determines that packet 150 cannot be classified and does not provide a result based on table VI. On the other hand, processor 102 receives G bits of packet 150, compares the G bits with bits 00 to determine that G bits are 00 and to deny passage of packet 150 through the firewall based on table VI. Moreover, processor 102 receives G bits of packet 150, compares the G bits with bits 11 within table VI to determine that the G bits are 11 and to determine to allow passage of packet 150 through the firewall as shown in table VI.

[0043] Upon determining that packet 150 cannot be classified based on the G and N bits of packet 150, processor 102 determines whether packet 150 can be classified by analyzing A bits of packet 150 other than the G and N bits. A tabic VII is shown below.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> BITS THE IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 192-207</td><td> 0</td><td> Deny</td>

<td> 208-223</td><td> 1</td><td> Allow</td>

Table VII

[0044] Processor 102 receives A bits, such as the 5^th LSB of 8 MSBs of the IP network address of packet 150, compares the A bits with B bits, such as the 5^th LSB of 8 MSBs of the each IP network address with the IP network address subranges of table VII, to determine whether packet 150 can be classified. For example, upon receiving A bits of packet 150, processor 102 determines that the A bits match 0, which is the 5^th LSB of 8MSBs of the IP network address sub-range 193 of an IP network address 193.0.0.0, determines that packet 150 can be classified, and denies passage of packet 150 via the firewall based on table VII. As another example, upon receiving A bits of packet 150, processor 102 determines that the A bits match bit 1,

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 which is the 5^th LSB of 8MSBs of the IP network address sub-range 210 of an IP network address 210.1.1.1, determines that packet 150 can be classified, and allows passage of packet 150 via the firewall based on table VII. It is noted that A is equal to B.

[0045] A table VIII, shown below, is an example of table V.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> BITS THE IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 160-168</td><td> 0</td><td></td>

<td> 191</td><td> 1</td><td> Allow</td>

Table VIII

IP network address sub-ranges of table VIII is another example of the sub-ranges of table V. Bits of the IP network address sub-ranges of table VI are another example of H bits of the sub-ranges of table V. For example, bit 0 is the 5^thLSB of each of 8 MSBs 160-168 of a plurality of IP network addresses with MSBs ranging from and including 160 to 168, and 160-168 is an example of the sub-range SR5-SR6. As another example, bit 1 is the 5^th LSB of 8 MSBs 191 of a plurality of IP network addresses with MSB 191, and 191 is the IP network address sub-range SR1SR2.

[0046] Processor 102 receives G bits of packet 150, compares the G bits with H bits of table VIII to determine whether packet 150 can be classified. For example, upon receiving G bits of packet 150, processor 102 determines that the G bits match 0 of IP network address sub-ranges 160-168 of table VIII, determines that the G bits cannot be classified, and does not provide a result to packet 150. As another example, upon receiving G bits of packet 150, processor 102 determines that the G bits match 1 of IP network address sub-range 191 to determine that packet 150 can be classified to allow packet 150 to pass through the firewall.

[0047] Upon determining that packet 150 cannot be classified based on comparing G bits of packet 150 with H bits, processor 102 determines whether

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 packet 150 can be classified based on comparing A bits of packet 150 with B bits. A table IX is shown below.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> BITS THE IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 160-167</td><td> 0</td><td></td>

<td> 168</td><td> 1</td><td> Allow</td>

Table IX

[0048] Processor 102 receives A bits of packet 150, compares the A bits with B bits, such as 4^th LSB of each of 8 MSBs 160-167 of a plurality of IP network addresses 160.0.0.0 - 167.255.255.255, to determine whether packet 150 can be classified. For example, upon receiving A bit of packet 150, processor 102 determines that the A bit matches bit 0, which is the 4^th LSB of each of 8 MSBs 160167, determines that packet 150 cannot be classified and cannot he provided a result. As another example, upon receiving A bit of packet 150, processor 102 determines that the A bit match bit 1, which is the 4^th LSB of 8 MSBs 168 of a plurality of IP network addresses 168.0.0.0 — 168.255.255.255, determines that packet 150 can be classified, and allows passage of packet 150 through the firewall.

[0049] Upon determining that packet 150 cannot be classified based on the N, G, and A bits of packet 150, processor 102 obtains C bits of packet 150 and determines whether packet 150 can be classified based on the C bits. A table X is shown below.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> BITS THE IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 160-163</td><td> 0</td><td></td>

<td> 164-167</td><td> 1</td><td> Deny</td>

<td> Ta</td><td colspan="2"> oleX</td>

As example of C bits of packet 150 includes 3^rd LSB of 8 MSBs of the IP network address of Dacket 150 that is an IPv4 packet 150. Another examnle nf C.

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 bits of packet 150 includes 4^th LSB of the IP network address of packet 150 of packet 150 that is an IPv6 packet 150.

[0050] Processor 102 receives C bits of packet 150, compares the C bits with D bits, such as the 3^rd LSB of each of 8MSBs of a plurality of IP network addresses 160.0.0.0 - 163.255.255.255, to determine whether packet 150 can be classified. For example, processor 102 compares C bits of packet 150 with bit 0, which is the 3^ld LSB of each of 8 MSBs 160-163 to determine that packet 150 cannot be classified and does not provide a result to packet 150. As another example, processor 102 compares C bit of packet 150 with bit 1, which is the 3^rd LSB of each of 8 MSBs 164-167 of a plurality of IP network addresses 164.0.0.0 — 167.255.255.255, to determine that packet 150 can be classified and to deny passage of packet 150 through the firewall. It is noted that C is equal to D.

[0051] Upon determining that packet 150 cannot be classified based on N, G, A, and C bits of packet 150, processor 102 obtains E bits of packet 150 and determines whether packet 150 can be classified based on the E bits. A table XI is shown below.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> BITS THE IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 160-161</td><td> 0</td><td></td>

<td> 163</td><td> 1</td><td> Allow</td>

Table XI

An example of E bits of packet 150 includes the 2^nd LSB of 8 MSBs of the IP network address of packet 150 that is an IPv4 packet. Another example of E bits of packet 150 includes the 5^th LSB of 8 MSBs of IP network address of packet 150 that is an IPv6 packet.

[0052] Processor 102 receives E bits of packet 150, compares the E bits with F bits, such as the 2^nd LSB of each of IP network address sub-ranges of table XI, to determine whether packet 150 can be classified. For example, processor 102

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 compares E bits of packet 150 with bit 0, which is the 2^nd LSB of each of 8 MSBs 160161 of a plurality of IP network addresses 160.0.0.0-161.255.255.255 to determine that packet 150 cannot be classified. As another example, processor 102 receives E bits of packet 150, compares the E bits with bit 1, which is the 2^Ild LSB of 8 MSBs 163 of a plurality of IP network addresses 163.0.0.0-163.255.255.255 to determine that packet 150 can be classified and to allow passage of packet 150 through the firewall. It is noted that E is equal to F.

[0053] Upon determining that packet 150 cannot he classified based on N, G, A, C, and E bits of packet 150, processor 102 obtains I bits other than the N, G, A, C, and E bits of packet 150 to determine whether packet 150 can be classified based on the I bits. A table XII is shown below.

<td> IP NETWORK ADDRESS SUB-RANGES</td><td> BITS THE IP NETWORK ADDRESS SUB-RANGES</td><td> RESULTS</td>

<td> 160</td><td> 0</td><td> Deny</td>

<td> 161</td><td> 1</td><td> Allow</td>

Table XII

[0054] An example of I bits of packet 150 includes the LSB of 8 MSBs of the IP network address of packet 150 that is an IPv4 packet. Another example of I bits of packet 150 includes the LSB of 16 MSBs of the IP network address of packet 150 that is an IPv6 packet.

[0055] Processor 102 receives I hits of packet 150, compares the I bits with J bits, such as the LSB of each of IP network address sub-ranges of table XII, to determine whether packet 150 can be classified. For example, processor 102 compares I bit of packet 150 with bit 0, which is the LSB of 160 of a plurality of IP network addresses 160.0.0.0 — 160.255.255.255 to determine that packet 150 can be classified and to deny passage of packet 150 through the firewall. As another example, upon receiving I bit of packet 150, processor 102 compares the I bit with bit 1, which is the LSB of 161 of a plurality of IP network addresses 161.0.0.0 — 161.255.255.255, to determine that packet 150 can be classified and to allow passage of packet 150 through

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 the firewall. Accordingly, processor 102 continues to compare additional bits of packet 150 with a plurality of tables, such as table V-Xll, until packet 150 can be classified. It is noted that I is equal to J.

[0056] Figure 6 is an embodiment of a graphical user interface (GUI) 250 used to create any of tables I-XII. Processor 102 displays, on output device 108, GUI 250 to the user. GUI 250 includes a map 252 of the world. Processor 102 associates or links a plurality of points 254, 256, and 258, on map 252, with one of the sub-ranges R1-R2, R3-R4, R5-R6, R7-R8, R9-R10, and R11-R12. For example, processor 102 associates point 254 with the sub-range R1-R2 of table I and associates point 256 the IP network address sub-range R5-R6 of table I. As another example, processor 102 associates point 254 with a port address of a port of a computer located within the U.S.A. and associates point 256 within a port address of a port of a computer located within Canada.

[0057] When the user selects, via input device 106, a point on map 252, processor 102 displays a plurality of results to the user. For example, when the user selects point 254, processor 102 displays a plurality of options including an allowance of packet 150, having N bits that match M bits of one of the sub-ranges RlR2, R3-R4, R5-R6, R7-R8, R9-RI0, and R11-R12 of an IP network address of a computer located at point 254, through the firewall, a denial of the packet 150, providing a priority to the packet 150, and not providing the priority to the packet 150. When the user selects one of the options, processor 102 associates the one of the options with a point on map 252. For example, when the user selects the allowance of packet 150, having N bits that match M bits of one of the sub-ranges R1-R2, R3-R4, R5-R6, R7-R8, R9-R10, and R11-R12, associated with point 254 through the firewall, processor 102 stores, within memory device 104, that packet 150, having N bits that match M bits of one of the sub-ranges R1-R2, R3-R4, R5-R6, R7-R8, R9-R10, and R11-R12, is to be allowed through the firewall. As another example, when the user selects providing a priority to packet 150, having N bits that match M bits of one of the sub-ranges R1-R2, R3-R4, R5-R6, R7-R8, R9-R10, and R11-R12, associated with

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 point 258, processor 102 stores, in memory device 104, that packet 150 having the one of the sub-ranges is to be provided the priority.

[0058] In one embodiment, processor 102 associates a plurality of points within a region, such as a country, a city, a state, a corporation, and a computer network, on map 252 with one of the results SI and S2 when the user selects once, such as by clicking a mouse once, any one of the points and selecting the one of the results. For example, when the user clicks for one time on point 254 within U.S.A. and selects allowance of packet 150, processor 102 associates all points within U.S.A. on map 252 with the allowance of packet 150 received from U.S.A. by processor 102. In the embodiment, processor 102 associates at least one point with a sub-region, such as a city, a government agency, an ISP, a corporation, a DoD, a computer, a port, located within the region with one of the results SI and S2 when the user selects for a number, such as twice, of times, one of the at least one point and selects the one of the results. For example, when the user double clicks on point 254 representing a city within U.S.A. and selects no priority by double-clicking on point 254, processor 102 associates packet 150 received from the city to have no priority. As another example, when the user double clicks on point 258 representing a computer network within Canada and selects denial of passage of packet 150 by double clicking on point 258, processor 102 associates point 258 with the denial, through the firewall, of passage of packet 150 received from the computer network.

[0059] It is noted that in one embodiment, the methods of Figures 5 and 6, and tables I-XII are a finite state machine (FSM) implemented within a set of logic gates and shift registers to implement the firewall. Tn another embodiment, instead of assigning a priority, packet 150 is assigned a high priority and instead of assigning no priority, packet 150 is assigned a low priority lower than the high priority. It is noted that the methods illustrated by Figures 5 and 6, and tables I-XII are implemented in either a mini, micro, or mainframe hardware. In yet another embodiment, methods illustrated by Figures 5 and 6, and tables I-XII are implemented within a field programmable gate array (FPGA). The herein described systems and methods for determining a flow of data nrovides a tree-based traversal structure that

CA 02642844 2008-08-15

WO 2007/098405

PCT/US2007/062313 allows an exponential execution of a plurality of rules or access control lists (ACLs). For example, processor 102 reaches a result by comparing 8 MSBs of IP address of packet 150 with either IP network address sub-range 3-4 of a plurality of IP addresses 3.0.0.0 — 4.255.255.255 in row 3 of table II or IP network address sub-range 5-9 of a plurality of IP addresses 5.0.0.0 - 9.255.255.255 in row 4 of table II as opposed to comparing all bits of packet 150 with the IP addresses 3.0.0.0 - 4.255.255.255 and 5.0.0.0 - 9.255.255.255. As another example, processor 102 provides a result exponentially faster than that provided by comparing all bits of packet 150 with a set of bits. In the example, processor 102 provides a result exponentially faster by comparing 2^nd and 3^rd MSBs of 8 MSBs of IP address of packet 150 with 2^nd and 3^rdMSBs of 8 MSBs 128-160, within table VI, of IP addresses 128.0.0.0160.255.255.255. The methods and systems for determining a flow of data described herein does not need to execute a floating point operation and therefore can run within a kernel space.

[0060] Systems and methods described herein achieve an isolation between two networks connected via the firewall by denying packet 150 from a region, such as a country, or alternatively from the sub-region. Moreover, systems and methods described herein allow passage of packet 150 through the firewall upon determining that packet 150 is received from an ally of a country in which the firewall is located. Additionally, the systems and methods described herein are used to deny packet 150 received from an entity other than a plurality of organizations within a group.

[0061] Systems and methods described herein are executed by reducing incidences of unsolicited emails or spam to improve Internet throughput. For example, processor 102 determines based on N bits of packet 150 and table II whether packet 150 is classified within a country code 66 of Germany. Upon determining that packet 150 has a classification value of 66, processor 102 determines to deny packet 150 that may include spam from Germany and increases throughput of Internet by reducing passage of spam through the firewall to a network. As another example, processor 102 determines based on N bits of packet 150 that packet 150 is assigned a

CA 02642844 2013-11-04

64725-1190 country code other than 189. Upon determining that packet 150 is assigned a country code other than 189, processor 102 denies passage of packet 150 through the firewall and the denial reduces reception, by a network coupled to the firewall, of spam from countries other than U.S. A. Moreover, in the example, by reducing to reception of spam from U.S. A., processor

102 makes it significantly easier to track spammers within U.S.A. In the example, processor

102 applies the methods for determining a flow of data to process packet 150, sent from U.S.A., significantly, such as ten times, faster than a communication speed of 9.6 gigabits per second (Gbps) of an optical carrier-192 (OC-192). The methods described herein are used to mitigate a wide variety of computer communication network security threats, such as, computer viruses sent by attackers. The methods provide scalability, adaptability, and performance characteristics used to adapt to an every-evolving scope of security problems.

The methods described herein can be implemented within numerous security products, such as data shunt devices, network simulation systems, biometric analysis systems, biometric anomaly analysis systems, security architecture design systems, network operation centers, virtual private networks (VPNs), and security information management systems.

[0062] While the invention has been described in terms of various specific embodiments, those skilled in the art will recognize that the invention can be practiced with modification within the scope of the claims. The scope of the claims should not be limited by the examples herein, but should be given the broadest interpretation consistent with the description as a whole.