Method for protecting a firewall load balancer from a denial of service attack

Information

  • Patent Grant
  • 7131140
  • Patent Number
    7,131,140
  • Date Filed
    Monday, February 19, 2001
    23 years ago
  • Date Issued
    Tuesday, October 31, 2006
    18 years ago
Abstract
A method for protecting firewall load balancers from a denial of service attack is provided. Packets are received by the firewall load balancer. Each packet has a source and a destination. The firewall load balancer is equipped with a connection database that can contain entries about the packets. Upon receipt of a packet, the connection database is queried to determine whether or not there is an entry for the received packet. If an entry is found in the database, the packet is forwarded to its destination. Otherwise, if the packet was received from a firewall, then a new connection entry for the packet is built and is saved to the connection database and the packet is forwarded on to its destination. If the packet does not have an entry (match) in the connection database and the packet was not received from a firewall, then the packet is forwarded to a firewall.
Description
TECHNICAL FIELD OF THE INVENTION

The present invention is related to the security of networked computers. More specifically, the present invention is related to a method for protecting the devices that balance the workload among multiple firewalls in a computer network.


BACKGROUND OF THE INVENTION

The Internet has experienced, and will continue to experience, explosive growth. As originally designed, the Internet was to provide a means for communicating information between public institutions, particularly universities, in a semi-secure manner to facilitate the transfer of research information. However, with the development and provision of user-friendly tools for accessing the Internet, such as the World Wide Web (the Web), the public at large is increasingly turning to the Internet as a source of information and as a means for communicating.


Because of the growth of the Internet and corporate intranets, the services provided over networks have become more diverse and sophisticated. As a result, increasingly complex schemes have been developed to respond to client generated network traffic and to service client requests. In some of these schemes, a single device is placed on the network that is responsible to direct packets to other devices or to filter packets that are bound for a number of other devices for some purpose such as security or load balancing. Such devices, when implemented, are critical to the operation of a network because they often represent a single point of failure that may prevent either the entire network or a substantial portion of the network from functioning.


Provision of a Web home page involves establishing a user accessible file at a Web site. The Web site can be established either on a computing system on the premises of the business or institution that providing the home page, or by contracting to have the home page built and supported on the computing facilities of an Internet Service Provider (ISP).


Use of a company's computing system for support of a publicly accessible system, such as a Web site, can present a threat to the company's internal systems that share the same computing platform or are connected to the publicly accessible computing platform. Furthermore, in cases where sensitive information is transmitted over the Internet to a company, such information is usually stored on the same computing system that is used for running the on-line Internet system. Handling of such information over a public network such as the Internet requires some measure of security to prevent the information from being intercepted. However, a more important consideration is maintaining the security of such information once it is received and stored in a computing system that is connected to the Internet.


Most computer crime is not in the form of data interception, but involves a network intruder, or “cracker” entering a publicly accessible computing system and subverting security systems to access stored information. In the recent past, there have been several publicized cases where crackers have stolen proprietary information from purportedly secure computers over the Internet.


In many cases where a publicly accessible application, such as a Web home page, is set up on a business or institution's premises, it is grafted onto an existing computing system. The existing system also may contain other computing resources, such as databases and/or internal network systems that are not intended for public access. Provision of a publicly accessible on-line system, such as a Web server, on such a system can provide a scenario that can be exploited by network intruders who may attempt to reach systems beyond the Web server using it, or other systems bundled on the computing platform, as access paths. A company or institution may attempt to protect these surrounding systems by password protecting them or by concealing them from the public with a system called a firewall.


The term “firewall” was coined in the computer network art to describe a system for isolating an internal network, and/or computers, from access through a public network to which the internal network or computers are attached. An example of a firewall system is described in U.S. Pat. No. 6,061,797. The purpose of a firewall is to allow network elements to be attached to, and thereby to access, a public network without rendering the network elements susceptible to access from the public network. A successful firewall allows for the network elements to communicate and transact with the public network elements without rendering the network elements susceptible to attack or unauthorized inquiry over the public network.


Firewalls have become an integral part of a network that is connected to the Internet or other wide-area network (WAN). As mentioned before, as network traffic increases—and the increased economic importance of that traffic—so does the need for increased security. To alleviate the demand on any one machine, and to prevent any single device from being a single point of failure, firewalls have been duplicated to form a firewall “bank.” Multiple firewall machines can be operative within the firewall bank in order to distribute the firewall workload among multiple machines in order to increase performance.


Firewall banks have created a need for methods and devices that balance the workload among the elements of the firewall bank. These devices are called firewall load balancers. In a typical configuration, there are firewall load balancers on either side of the firewall bank. The firewall load balancer that sits outside (i.e., on the Internet side) of the firewall is used to balance incoming traffic among the firewalls within the firewall bank. Similarly, the firewall load balancer that sits on the inside portion of the firewall is used to balance the load emanating from the servers that are servicing the requests originating from outside the firewall.


Crackers have been known to inundate a port, such as a telnet, http, or ftp port, with large numbers of slightly varying access requests in order to consume available memory and CPU cycles on the attacked device. This method of attack is known as a “denial of service attack.” Specifically, the attacked device is inundated with requests that consume its resources and either cause it to crash or otherwise to slow down to the point where it cannot service legitimate requests. A more comprehensive discussion of denial of service attacks is presented by the CERT Coordination Center and is available on the Internet at <http://www.cert.org/tech_tips/denial_of_service.html>. The typical response to a denial of service attack is to have the operating system (OS) shut down the targeted port for a period of time, thereby denying the service of that port both to the attacker and, unfortunately, to legitimate customers. This defensive response is necessitated by the inefficiency of conventional port processing. The chain of processes associated with monitoring, managing, and verifying port connections is very inefficient. Consequently, the conventional defense is to have the OS shut down the port for a period of time. This security technique prevents entry into a system through that port and restores the availability of system resources to the remaining ports. This defensive measure is unacceptable because it concedes defeat (i.e., the denial of service) to the attacker.


Aside from the packet flooding tactic, other denial of service attacks entail the disruption or overwhelming of components within a computer system. Firewalls can become a target of the attacker as well because if the firewalls are disabled, the connection to the wide-area network is also disabled. From an attacker's standpoint, this is equally as effective as disabling the servers. As firewalls are vulnerable to the denial of service attack, so too are their load balancers. The firewall load balancers also may be inundated with the denial of service's packets and exhaust their resources. There is, therefore, a need in the art for a firewall load balancer that can operate effectively while conserving resources so that it can withstand a denial of service attack.


SUMMARY OF THE INVENTION

The present invention solves the problems inherent in the prior art by providing a method for protecting firewall load balancers from a denial of service attack. Packets are received by the firewall load balancer. Each packet has a source and a destination. The firewall load balancer is equipped with a connection database that can contain entries about the packets. Upon receipt of a packet, the connection database is queried to determine whether or not there is an entry for the received packet. If an entry is found in the database, the packet is forwarded to its destination. Otherwise, if the packet was received from a firewall, then a new connection entry for the packet is built and is saved to the connection database, and the packet is forwarded on to its destination. If the packet does not have an entry (match) in the connection database and the packet was not received from a firewall, then the packet is forwarded to a firewall.


Alternate embodiments of the present invention further discriminate the origin and destination of the packet or, in the alternative, modify the order of the discrimination in order to enhance security and/or performance of the overall system.


Other and further objects, features, and advantages will be apparent from the following description of presently preferred embodiments of the invention, given for the purpose of disclosure and taken in conjunction with the accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention and its advantages, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which:



FIG. 1 is a block diagram of the system configuration of the present invention;



FIG. 2 is a flowchart illustrating an embodiment of the method of the present invention;



FIG. 3 is a flowchart illustrating an alternate embodiment of the method of the present invention;



FIG. 4 is a flowchart illustrating an alternate embodiment of the method of the present invention;



FIG. 5 is a block diagram of a 5-tuple element of the connection database of the present invention; and



FIG. 6 is a flowchart illustrating a decision tree of the method of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

The present invention deals with the routing of messages on a network. To prevent delay, buffer overflows, or congestion, long messages are broken into shorter bit strings called packets. These packets can then be transmitted though the network as individual entities and reassembled into messages at the destination. Thus, packets have a source (the device that generated the packet) and a destination.


The configuration of the present invention is illustrated in FIG. 1. As shown in FIG. 1, an array of servers 20 are used to service requests from clients 30, 32, and 34. In general, messages in the form of one or more inbound packets are transmitted from, for example, client 30 through the wide-area network 28 to the inbound firewall load balancer 26. Depending upon the workload of the various firewalls 24 that make up the firewall bank, the inbound firewall load balancer will direct the inbound packet to one of the firewalls 24. The firewall will perform its functions and forward the inbound packet to the outbound firewall load balancer 22, which will then forward the inbound packet to one of the servers 20 for processing.


Once the request has been serviced, the response is transmitted from the server to the client as follows. The response, in the form of one or more outbound packets, is transmitted first to the outbound firewall load balancer 22. From there, the outbound packets will typically be forwarded to the same firewall 24 that serviced the packets of the inbound request. Once processed by the firewall 24, the outbound packet will be forwarded to the inbound firewall load balancer 26 and then on to the wide-area network 28 (such as the Internet) and arrives at the client machine 30.


Both firewall load balancers of the present invention have their own connection databases. Specifically, the outbound firewall load balancer 22 is in operative communication with the outbound connection databases 23 and the inbound connection database 27 is in operative communication with the inbound firewall load balancer 26. These databases are used in conjunction with the method of the present invention (described below). It should be noted that the two connection databases 23 and 27 can be consolidated into a single database. However, in doing so, one may have to breach the security provided by the firewalls 24 that protect the servers 20 because the same connection database would have to service both the outbound firewall load balancer 22 and the inbound firewall load balancer 26 which are on opposite sides of the firewall. Security would not necessarily be breached, however, if only very specific signals are sent to/from the single connection database.


While the methods of the present invention can be implemented entirely in software, it is understood by those skilled in the art that the methods of the present can be implemented in either hardware or software, or any combination thereof. For instance, the apparatus of the present invention can be logic that is encoded in media which is operable with the various processors and other subsystems of the apparatus of the present invention to implement the methods of the present invention. Similarly, application specific integrated circuits (ASICs) can be used to implement various steps of the methods of the present invention.


For purposes of this disclosure, “packets” are intended to have their normal meaning, for example, a unit of information that is transmitted in a packet switched network. Typically, each packet has a packet header within which are recorded routing information in the form of, e.g., an origin IP address and a destination IP address. A “flow” is a series of packets that are sent from one entity (such as a server) to another entity (such as a client). Finally, a “connection” designates two flows, one in each direction, between the same two entities. The connection databases 23 and 27 of the present invention record the connections made between various entities.


There are various packet destination scenarios that should be considered when using the method and apparatus of the present invention. When a packet comes to a firewall loadbalancer, it is desirable to know the direction of the packet (either to or from a firewall) and if there have been other packets for this particular flow. The connection database is queried to determine whether or not other packets for that flow have been processed previously. There are four separate scenarios that must be addressed. The various scenarios depend upon whether the packet is going to or coming from a firewall and whether or not there is a record of the flow in the connection database. These scenarios, and the action needed, are summarized in Table 1.











TABLE 1





Packet
Flow Recorded



From
in Connection


Firewall?
Database?
Action Needed







No
No
Forward the packet to a firewall




that is determined by a stateless




firewall loadbalancing algorithm.


No
Yes
Forward the packet as defined by




the connection object in the




connection database.


Yes
No
Build a connection object in the




connection database and forward




the packet towards the destination




IP address in the packet.


Yes
Yes
Forward the packet as defined by




the connection object in the




connection database.









The scenarios of Table 1 can be illustrated more fully by the flowchart of FIG. 6. Specifically, FIG. 6 illustrates a decision tree method that is explained below. As shown in FIG. 6, the method starts at step 602. The first decision is taken at step 604, where a determination is made if the packet in question has been processed by a firewall. If so, then execution continues to step 606 where a determination is made whether the flow to which the packet is a part has been recorded in the connection database. This determination is accomplished by querying the connection database for a connection object matching various parameters contained within the packet header. If so, then the packet is forwarded as defined by the relevant connection object that was found in the connection database query, step 608, and the method is terminated at step 618.


If the packet has not been processed by a firewall (i.e., the result of step 604 is no), then execution jumps to step 612, where a determination is made if the flow to which the packet is a part has been recorded in the connection database. If so, then execution continues to step 614 where the packet is forwarded as defined by the connection object in the connection database. If not, then the packet is labeled as “stateless loadbalance” and the packet is forwarded to a firewall, step 616. Step 616 is generally taken when a packet is received from the wide-area network 28 (of FIG. 1) for the first time. In an embodiment of the present, a stateless algorithm is used to designate a particular firewall that will handle not only the packet in question, but all packets of the flow pertaining to that packet. The stateless algorithm is a load balancing algorithm that does not require the loadbalancer to store information about assigned connections. Any subsequent packets on these connections will produce the same loadbalancing result. Specifically, when the first packet (of a flow) is received from the Internet, the stateless algorithm is used for choosing the firewall that will be used for this and subsequent packets in the same flow. The stateless algorithm of the present invention bases its choice of firewall only on the information that is contained within the packet. The stateless algorithm of this embodiment of the present invention uses either 1) the source and destination IP addresses or 2) the source and destination IP addresses as well as the source and destination port numbers. It is important to note that this information is not saved or recorded. Consequently, no storage space is devoted to packets that get rejected by the firewall. Moreover, once the connection has been recorded (by creation of a connection object within the connection database), few resources are devoted to additional packets for that connection. It is these features that enable the firewall load balancers of the present invention to conserve resources and thus diminish and mitigate the effects of a denial of service (DoS) attack.


The connection databases 23 and 27 can use a wide variety of database engines. The best ones for the intended purpose will have fast performance and require relatively modest storage requirements. The databases will have to have the capacity to retain the desired number of 5-tuple values. The database can optionally use the 5-tuple values as a database key for database queries. The five elements of the 5-tuple consist of, for example, a source address, a destination address, a source port number, a destination port number, and a protocol identifier. Additional values can be stored to expand the functionality of the present invention. Likewise, the 5-tuple value can be reduced for increased performance and/or increased storage capacity by eliminating some of the values like, for instance, the destination port number and the source port number (although this isn't recommended). The latter embodiment is useful for specific functions where the port numbers can be assumed with confidence, albeit with reduced flexibility. For example, standard web port numbers typically are 80 (http) for non-secure web requests mail and 443 (https) for secure web requests. A web request is an example of a “sticky” transaction. A sticky transaction is one that is opened by the client, such as, an inbound request to a server and a corresponding outbound response to the client that sent that request. Thus, in the latter example, a 2-tuple value can be used because the protocol and port numbers are presumed and only the source and destination addresses need be retained.


The structure of the 5-tuple value that is the preferred embodiment of the value of the present invention is illustrated in FIG. 5. The tuple value 500 contains a source address 502, a destination address 504, a source port 506, a destination port 508, and a protocol element 510. The 5-tuple value yields maximum utility with a minimum amount of information. Unlike the 2-tuple value mentioned previously, the 5-tuple value enables dynamic port addressing and the use of multiple protocols (e.g., TCP and UDP). The size or storage capacity of the various elements can be modified to suit the situation. It is recommended, however, that some extra space be included to accommodate future growth as addresses are expected to get longer as more and more traffic and nodes are added to the Internet and the conversion from IPv4 to IPv6 takes place.


In some embodiments of the present invention, it is necessary only to know if the packet came from a firewall before it arrived at the firewall load balancer of the present invention. In alternate embodiments, it is important to know if the packet is destined for a firewall after leaving the firewall load balancer. Consequently, in several embodiments of the present invention, checks are made to determine whether or not the packet has been processed from a firewall or is destined for a firewall. In this case, if a firewall has previously processed the packet in question, then that packet is deemed to have had a “firewall origin,” even though the device that created the packet may not be a firewall. Similarly, if a packet has a routing header such that either a firewall is its next or subsequent hop, then the packet is considered to have a “firewall destination,” even though the ultimate destination of the packet may not be a firewall.


An embodiment of the method of the present invention is summarized in FIG. 4. Referring to FIG. 4, the process starts at step 402. A packet is received by the firewall load balancer in step 404. A check is made to determine if the packet has been processed previously by one of the system's firewalls in step 406, i.e., a check is made to determine if the packet has a “firewall origin.” Note, this check applies regardless of whether or not the source of the packet originated from one of the system's own servers or from a source outside of the firewall. If the packet has not yet been serviced by a firewall, the packet is sent to a firewall in step 414. Otherwise, a second check by the firewall load balancer is made to determine whether or not an entry (5-tuple value) has been made in the firewall load balancer's connection database for the packet in step 408. If an entry for the packet has not been found in the connection database, an entry is made in the firewall load balancer's connection database in step 410. If an entry for the packet existed, or if the entry was just created (step 410), then the packet is forwarded to its destination (i.e., to the next hop or to the destination), step 412. After either step 412 or step 414, the process ends in step 416. The rationale for making the database entry only after a firewall has had a chance to process the packet is that if the firewall drops the packet (for whatever reason), the firewall load balancer would be relieved of the need to devote resources (memory and execution cycles) for the packet in the connection database. It is this relief that provides the firewall load balancer a measure of protection from a denial of service attack.


An alternative method of the present invention is illustrated in FIG. 2. Referring to FIG. 2, the process starts at step 202. A packet is received by the firewall load balancer at step 204. Thereafter, the firewall load balancer makes a check during step 206 to determine if there is an entry in the connection database for the packet. If an entry exists (i.e., the packet has been through a firewall at least once), then execution skips to step 214 and the packet is sent to its destination or to the next hop. Otherwise, step 208 is performed wherein a check is made to determine if the packet was sent from a firewall (if the packet has a firewall origin). If it has a firewall origin, then an entry is made for the packet in the firewall load balancer's connection database, step 210, and the packet is thereafter sent to its destination or to the next hop in step 214. However, if the packet was not sent from a firewall, and there is no entry in the firewall load balancer's connection database, then the packet is directed to a firewall in step 212. Execution ends in step 216 as illustrated in FIG. 2.


An alternative method of the present invention is illustrated in FIG. 3. Referring to FIG. 3, the process begins at step 302. In this case, the packet is received from a common packet filter (“CPF”) or from switching vectors in step 304. If the packet has a match in the connection database, step 306, then no further processing is needed and the packet is sent to the firewall or to the outside network in step 320. However, if the packet doesn't have a matching entry in the connection database, then a determination is made whether or not the packet is either going to, or coming from, a firewall, step 308. If the packet did not come from a firewall (meaning that the packet does not have a firewall origin) and it is not destined for a firewall, then the packet is routed normally in step 318. Otherwise, a determination is made whether the packet came from a firewall, i.e., whether the packet has a firewall origin in step 310. If the packet did not come from a firewall, then step 312 is performed where a hash or sticky is made to the firewall connection database and the packet is thereafter sent to the firewall or to the outside network in step 320. If the packet did come from a firewall, then a check is made to determine if the media access control (“MAC”) address of the firewall was resolved, step 314. If so, then a connection object is created and stored in the connection database, step 316, and the packet is sent off to the outside network, step 320. If the MAC address of the firewall was not resolved, then the packet is routed normally, step 318. In any case, execution ends in step 322.


The present invention, therefore, is well adapted to carry out the objects and attain both the ends and the advantages mentioned, as well as other benefits inherent therein. While the present invention has been depicted, described, and defined by reference to particular preferred embodiments of the invention, such references do not imply a limitation on the invention, and no such limitation is to be inferred. The invention is capable of considerable modification, alternation, alteration, and equivalents in form and/or function, as will occur to those of ordinary skill in the pertinent arts. The depicted and described preferred embodiments of the invention are exemplary only and are not exhaustive of the scope of the invention. Consequently, the invention is intended to be limited only by the spirit and scope of the appended claims, giving full cognizance to equivalents in all respects.

Claims
  • 1. A method comprising: receiving a packet at an outbound firewall load balancer;determining whether the packet is associated with an open connection such that resources are being consumed as reflected by an entry in an outbound connection database, wherein if the entry is not present in the outbound connection database then a new entry is not recorded for the outbound firewall load balancer; andforwarding the packet to a selected one of a plurality of firewalls coupled to the outbound firewall load balancer in the case where the entry is present in the outbound connection database, wherein the packet may be received by the selected firewall and then communicated to an inbound firewall load balancer, wherein the inbound firewall load balancer is operable to generate a new entry for the packet once it has received it from the selected firewall, the new entry being provided in an inbound connection database such that resources for the inbound firewall load balancer are then being consumed for an open flow associated with the packet.
  • 2. The method of claim 1, wherein the selected firewall is operable to determine if the packet is associated with malicious traffic and to discard the packet such that it is not communicated to the inbound firewall load balancer in a case where the packet is associated with malicious traffic.
  • 3. The method of claim 1, wherein the outbound firewall load balancer is coupled to one or more servers that are operable to deliver content to the outbound firewall load balancer.
  • 4. The method of claim 1, wherein the inbound firewall load balancer is operable to deliver the packet to a computer that is operable to respond to the packet and that is associated with the open connection.
  • 5. The method of claim 1, wherein if the packet is not associated with an open connection, the outbound firewall load balancer is operable to select one of the firewalls to direct the packet to based on a hash algorithm.
  • 6. The method of claim 1, wherein the inbound firewall load balancer is operable to receive an additional packet from one or more computers that are coupled to the inbound firewall load balancer, the inbound firewall load balancer being coupled to an inbound connection database.
  • 7. The method of claim 6, wherein the inbound firewall load balancer is operable to access the inbound connection database in order to see if there is an open connection associated with the additional packet, and wherein if there is not an open connection for the additional packet then a new entry in the inbound connection database is not made.
  • 8. A method comprising: receiving a packet at an inbound firewall load balancer, the packet being generated by a client computer;determining whether the packet is associated with an open connection such that resources are being consumed as reflected by an entry in an inbound connection database, wherein if the entry is not present in the inbound connection database then a new entry is not recorded for the inbound firewall load balancer; andforwarding the packet to a selected one of a plurality of firewalls coupled to the inbound firewall load balancer in the case where the entry is present in the inbound connection database, wherein the packet may be received by the selected firewall and then communicated to an outbound firewall load balancer, wherein the outbound firewall load balancer is operable to generate a new entry for the packet once it has received it from the selected firewall, the new entry being provided in an outbound connection database such that resources for the outbound firewall load balancer are then being consumed for an open flow associated with the packet.
  • 9. The method of claim 8, wherein the selected firewall is operable to determine if the packet is associated with malicious traffic and to discard the packet such that it is not communicated to the outbound firewall load balancer in a case where the packet is associated with malicious traffic.
  • 10. The method of claim 8, wherein the outbound firewall load balancer is coupled to one or more servers that are operable to deliver content to the outbound firewall load balancer.
  • 11. The method of claim 8, wherein if the packet is not associated with an open connection, the inbound firewall load balancer is operable to select one of the firewalls to direct the packet to based on a hash algorithm.
  • 12. The method of claim 8, wherein the outbound firewall load balancer is operable to receive an additional packet from one or more servers that are coupled to the outbound firewall load balancer, the outbound firewall load balancer being operable to access an outbound connection database in order to see if there is an open connection associated with the additional packet, and wherein if there is not an open connection for the additional packet then a new entry in the outbound connection database is not made.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to and is a continuation of U.S. application Ser. No. 09/751,318, filed Dec. 29, 2000, now abandoned entitled “Method for Protecting a Firewall Load Balancer from a Denial of Service Attack.”

US Referenced Citations (65)
Number Name Date Kind
4857912 Everett, Jr. et al. Aug 1989 A
5511122 Atkinson Apr 1996 A
5627819 Dev et al. May 1997 A
5708659 Rostoker et al. Jan 1998 A
5740438 Ratcliff et al. Apr 1998 A
5774660 Brendel et al. Jun 1998 A
5835726 Shwed et al. Nov 1998 A
5892903 Klaus Apr 1999 A
5937159 Meyers et al. Aug 1999 A
5951694 Choquier et al. Sep 1999 A
6006264 Colby et al. Dec 1999 A
6016305 Borst et al. Jan 2000 A
6061798 Coley et al. May 2000 A
6101170 Doherty et al. Aug 2000 A
6128642 Doraswamy et al. Oct 2000 A
6128657 Okanoya et al. Oct 2000 A
6137777 Vaid et al. Oct 2000 A
6185619 Joffe et al. Feb 2001 B1
6201962 Sturniolo et al. Mar 2001 B1
6212558 Antur et al. Apr 2001 B1
6243360 Basilico Jun 2001 B1
6249801 Zisapel et al. Jun 2001 B1
6253337 Maloney et al. Jun 2001 B1
6256773 Bowman-Amuah Jul 2001 B1
6263368 Martin Jul 2001 B1
6298383 Gutman et al. Oct 2001 B1
6304262 Maloney et al. Oct 2001 B1
6304973 Williams Oct 2001 B1
6321336 Applegate et al. Nov 2001 B1
6327622 Jindal et al. Dec 2001 B1
6330602 Law et al. Dec 2001 B1
6370573 Bowman-Amuah Apr 2002 B1
6377571 Tai Apr 2002 B1
6377982 Rai et al. Apr 2002 B1
6393458 Gigliotti et al. May 2002 B1
6393482 Rai et al. May 2002 B1
6400722 Chuah et al. Jun 2002 B1
6414950 Rai et al. Jul 2002 B1
6421714 Rai et al. Jul 2002 B1
6424621 Ramaswamy et al. Jul 2002 B1
6434618 Cohen et al. Aug 2002 B1
6442165 Sitaraman et al. Aug 2002 B1
6452915 Jorgensen Sep 2002 B1
6466571 Dynarski et al. Oct 2002 B1
6473802 Masters Oct 2002 B1
6484143 Swildens et al. Nov 2002 B1
6496935 Fink et al. Dec 2002 B1
6512754 Feder et al. Jan 2003 B1
6519703 Joyce Feb 2003 B1
6529501 Zhao et al. Mar 2003 B1
6536037 Guheen et al. Mar 2003 B1
6546423 Dutta et al. Apr 2003 B1
6549208 Maloney et al. Apr 2003 B1
6550012 Villa et al. Apr 2003 B1
6578147 Shanklin et al. Jun 2003 B1
6606316 Albert et al. Aug 2003 B1
6606744 Mikurak Aug 2003 B1
6615166 Guheen et al. Sep 2003 B1
6665702 Zisapel et al. Dec 2003 B1
6701374 Gupta et al. Mar 2004 B1
6742045 Albert et al. May 2004 B1
6775280 Ma et al. Aug 2004 B1
6792463 Lamberton et al. Sep 2004 B1
6880089 Bommareddy et al. Apr 2005 B1
20030229809 Wexler et al. Dec 2003 A1
Continuations (1)
Number Date Country
Parent 09751318 Dec 2000 US
Child 09788690 US