Contained herein is material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction of the patent disclosure by any person as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all rights to the copyright whatsoever. Copyright© 2002-2007, Fortinet, Inc.
1. Field
Embodiments of the present invention generally relate to network packet steering, and more particularly to network packet steering from a network interface module to a processing resource, which is used to further route the network packet.
2. Description of the Related Art
In today's highly wired and connected computing environments, networks are often taken for granted by end-users. Yet, heterogeneous networks are often seamlessly and transparently interconnected and made available to the end-users. It is only when a network fails or is degraded that the end-users take notice of the importance associated with having efficient networks.
A network can be configured in many different manners. A Local Area Network (LAN) is a group of computing devices that share a common communications line. Computing and storage resources can be shared within a LAN. Moreover, a LAN can be as small as a few computing devices or as large as an entire enterprise (e.g., office building, office complex, and the like). Another network configuration is a Wide Area Network (WAN). A WAN is a geographically dispersed telecommunications network. A classic example of a well known WAN is the Internet. A third network configuration is a Metropolitan Area Network (MAN), where computing devices are connected in a geographic region or specific area that is larger than a LAN and smaller than the typical WAN. Also, in recent years a new type of Virtual Private Network (VPN) has emerged in the industry. A VPN is a private network that takes advantage of public telecommunications and maintains privacy through use of tunneling protocols and security procedures.
Moreover, networks can be characterized by the type of data transmission technology in use on the networks (e.g., Transmission Control Protocol/Internet Protocol (TCP/IP), and others). Furthermore, the type of data (e.g., voice versus data) that a network can carry can also distinguish the network. Networks are also classified as public or private, by the usual connection techniques used to access the networks (e.g., switched, dial-up, non-switched, dedicated, virtual, and the like), and by the type of physical links used to interface on the networks (fibre optic, coaxial cable, untwisted shielded pair, and the like).
Networks of different types can be interconnected through the use of backbones. A backbone is generally a larger transmission line that carries data gathered from smaller lines that interconnect with it. For example, a LAN may use a backbone to connect with a WAN or to span distances within a single LAN. Further, a WAN may use a backbone as a set of paths that local or regional networks connect to for long-distance interconnections.
When networks are interfaced with one another a number of issues arise. One such issue is how to properly route a received data packet between the networks, since each network may be associated with a different media transmission (e.g., Gigabit Ethernet (GigE), Frame Relay (FR), Time-Division Multiplexing (TDM), Asynchronous Transfer Mode (ATM), and others) and/or a different local data packet-addressing schemes or requirements. Another issue is how to maintain data packet throughput at the point where networks are interfaced with one another. For example, the data packet routing can quickly become a bottleneck in the performance of the network if conversion between disparate media transmissions or addressing schemes is not efficient, especially when a high volume of network traffic is occurring at the point where networks are interfaced together.
Accordingly, a number of software and/or hardware solutions have sought to increase network traffic throughput at the point where networks are interfaced together. Some of these solutions include routers that determine the next network point that a data packet should be forwarded to within a plurality of networks. Similarly, gateways act as network node that serves as an entrance into another network. Additionally, proxy servers and firewalls act as intermediaries between network connections. Hub devices and bridge devices are also used to collect and route data packets between networks.
Networks desiring better security and increased throughput of operation will often dedicate computing resources to house, process, and interconnect external and internal network connections. These computing resources use the solutions discussed above (e.g., routers, gateways, firewalls, proxy servers, hub devices, bridge devices and the like). Moreover, often a plurality of solutions is deployed within the dedicated computing resources.
Some networks that receive a high volume of network traffic often deploy or have computing devices custom developed and installed within the networks to increase operational throughput. For example, Internet Service Providers (ISPs) can have a large number of dedicated and custom developed hardware and software resources to process and route network traffic within the ISP's network. One such hardware and software resource is a high-density server or a blade server that includes physical network interface modules that receive packets from a network. The blade server also includes a switching fabric that passes any received network data packet along to a processing resource within the blade server. The processing resource then properly translates, routes, and/or forwards the received network packet to its destination. In some cases, the destination can be another processing resource within the system.
Conventionally, the dedicated hardware and software resources are hardwired or statically coded by vendors to meet the needs of a particular customer. Yet, when network traffic patterns for a customer's network change (e.g., decreases or increases), the customer cannot efficiently configure the dedicated hardware and software resources provided by the vendors. As a result, to solve network traffic problems, customers purchase additional hardware and software resources to better meet their then-existing needs. As one of ordinary skill in the art readily appreciates, this is inefficient since many times existing hardware and software resources may be underutilized by the customer in another area of the customer's network.
Therefore, there is a need for techniques that provide improved custom configurations of hardware and software resources, which are used to facilitate the throughput and to load balance network traffic.
Methods and systems are described for steering network packets. According to one embodiment, a unique identifier for a processing resource is received along with a mapping that associates the unique identifier with a network interface or with one or more components of the network interface. The mapping is provided to the network interface. Furthermore, the mapping is used by the network interface to steer the network packet when the network packet conforms to the mapping.
According to another embodiment, a network interface steering table data structure residing on a computer-readable medium is provided. The steering table data structure includes a plurality of interface identifiers, a plurality of sub-interface identifiers associated with each interface identifier. Furthermore, when a packet is received by a network interface, the packet is indexed into the data structure based on the interface identifier of the network interface receiving the packet and the sub-interface identifier associated with the line interface port of the network interface providing the packet. The indexed data structure provides an address to a processing resource where the packet is to be steered and a pointer to a specific process within the processing resource that is used to process the packet.
Other features of embodiments of the present invention will be apparent from the accompanying drawings and from the detailed description that follows.
Embodiments of the present invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
Methods and systems are described for steering network packets. In various embodiments of the present invention, conventional network interfaces (netmods) may be used in connection with the novel teachings, such as the load balancing architecture described herein and/or the more general configurable association of processing resources and netmods and/or line interface ports of the netmods. While embodiments of the present invention are described in the context of netmods that connect to telecommunications lines associated with network feeds, in various embodiments, the netmods may also be connected on the backend (e.g., the side opposite the network feed) to a switching fabric that is used to forward a network data packet received from the netmod to one or more processing resources. The processing resources include one or more processing elements and memory. Additionally, the processing resources may be used to translate, encrypt/decrypt, authenticate, forward and/or route any network data packets received from the switching fabric.
In one embodiment of the present invention, a plurality of netmods, a switching fabric, and a plurality of processing resources are assembled as a network routing/switching device, such as a blade server. The blade server is configured and distributed by Cosine Communications, Inc. of Redwood City, Calif. The system can be assembled with a plurality of additional blade servers that interface with one another. Of course as one of ordinary skill in the art readily appreciates, any hardware, firmware, and/or software configuration designed to achieve the tenets of the present disclosure can be used. Thus, all such configurations are intended to fall within the scope of the present invention.
Reference is made herein to the accompanying drawings that form a part hereof, and in which is shown by way of illustration specific embodiments in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present invention. It will be apparent, however, to one skilled in the art that embodiments of the present invention may be practiced without some of these specific details. In other instances, well-known structures and devices are shown in block diagram form.
Embodiments of the present invention include various steps, which will be described below. The steps may be performed by hardware components or may be embodied in machine-executable instructions, which may be used to cause a general-purpose or special-purpose processor programmed with the instructions to perform the steps. Alternatively, the steps may be performed by a combination of hardware, software, firmware and/or by human operators.
Embodiments of the present invention may be provided as a computer program product, which may include a machine-readable medium having stored thereon instructions, which may be used to program a computer (or other electronic devices) to perform a process. The machine-readable medium may include, but is not limited to, floppy diskettes, optical disks, compact disc read-only memories (CD-ROMs), and magneto-optical disks, ROMs, random access memories (RAMs), erasable programmable read-only memories (EPROMs), electrically erasable programmable read-only memories (EEPROMs), magnetic or optical cards, flash memory, or other type of media/machine-readable medium suitable for storing electronic instructions. Moreover, embodiments of the present invention may also be downloaded as a computer program product, wherein the program may be transferred from a remote computer to a requesting computer by way of data signals embodied in a carrier wave or other propagation medium via a communication link (e.g., a modem or network connection).
Terminology
Brief definitions of terms used throughout this application are given below.
The terms “connected” or “coupled” and related terms are used in an operational sense and are not necessarily limited to a direct connection or coupling.
The phrases “in one embodiment,” “according to one embodiment,” and the like generally mean the particular feature, structure, or characteristic following the phrase is included in at least one embodiment of the present invention, and may be included in more than one embodiment of the present invention. Importantly, such phases do not necessarily refer to the same embodiment.
If the specification states a component or feature “may”, “can”, “could”, or “might” be included or have a characteristic, that particular component or feature is not required to be included or have the characteristic.
As used herein, a “network interface” or “netmod” generally refers to a hardware and/or software computing device that connects to telecommunications lines associated with network feeds. Netmods are well known to one of ordinary skill in the art. Netmods come in a variety of configurations and are usually distinguished by the type and number of telecommunication lines that can physically connect to line interface ports of the netmod. Netmods may include firmware and/or software to process raw data being received on a line interface port. Furthermore, some software instructions may be processed within a volatile memory of the netmod. For example, some software instructions permit the recognition and separation of network data packets from a data stream being received over a line interface port.
The term “responsive” includes completely or partially responsive.
The netmods (e.g., 110 and 120) include memory and processing elements for receiving network data packets from the line interface ports or for sending network data packets out over the line interface ports. In some cases, the memory included within the netmods (e.g., 110 and 120) is Static Random Access Memory (SRAM), which is volatile memory permitting fast access to data. Moreover, the netmods (e.g., 110 and 120) are usually associated with a specific type of media channel (e.g., ATM, GigE, TDM, FR, and the like). Additionally, a netmod (e.g., 110 or 120) can be wireless. Thus, netmods (e.g., 110 and 120) need not be physically connected to a telecommunications line, but, rather, can be a transceiver for transmitting and receiving wireless (e.g., Radio Frequency (RF), Infrared (IR), Satellite, and the like) network data packets.
The switching fabric 112 may be hardware, firmware, and, in some instances, software instructions that receive forwarded network data packets from the netmods (e.g., 110 and 120) and rapidly transfer the packet to an appropriate processing resource. Conventionally, switching fabric is hardwired from a specific netmod to a processing resource. The switching fabric 112 can also receive network data packets from a processing resource (e.g., 124 and 126) and forward the network packets along to the appropriate netmod (e.g., 110 and 120).
The processing resources (e.g., 124 and 126) receive network data packets and perform a variety of translations/operations on the network data packets, such as forwarding, routing, encryption/decryption, authentication, and the like.
In one embodiment, the processing resources (e.g., 124 and 126) can be configured through a Graphical User Interface (GUI) application using a configuring software application. The GUI application permits an end-user to assign a unique identifier to a processing resource (e.g., 124 or 126). Moreover, the GUI application permits the end-user to visualize each netmod (e.g., 110 and 120) and each line interface port assigned to each of the netmods (e.g., 110 and 120). The GUI application then permits the end-user to make an association between a uniquely identified processing resource (e.g., 124 or 126) and a netmod (e.g., 110 or 120) or a particular line interface port or a sub-interface associated with a particular netmod module (e.g., 110 or 120).
In one embodiment, the GUI application also permits the end-user to visually inspect the processing and memory capabilities of a particular processing resource (e.g., 124 or 126). Thus, the end-user can intelligently make associations between processing resources (e.g., 124 and 126) and netmods (e.g., 110 and 120) or line interface ports. Moreover, associations can be altered as the network traffic changes to accommodate future needs of the end-user's network. Unlike conventional techniques, the associations between the processing resources (e.g., 124 and 126) and the netmods (e.g., 110 and 120) or line interface ports are not static and hardwired. Rather, with the present invention the associations are dynamic, virtual, and configurable.
Once the associations are made, the processing resource (e.g., 124 or 126) that is being assigned pushes the association as a data structure to the volatile memory (e.g., SRAM) of the appropriate netmod (e.g., 110 or 120). In some embodiments, the data structure is a steering table that includes the identifiers or addresses for the assigned processing resource (e.g., 124 or 126), the assigned netmod (e.g., 110 or 120), and any assigned line interface port identifiers or sub-interface identifiers associated with each netmod (e.g., 110 or 120). When a network data packet is then received on the assigned netmod (e.g., 110 or 120), the table is indexed to determine the assigned processing resource (e.g., 124 or 126) and the processing resource's (e.g., 124 or 126) identifier/address is provided to the switching fabric 112 in order to rapidly steer the network data packet along to the assigned processing resource (e.g., 124 or 126).
In one embodiment, the table also includes a pointer or identifier to a specific process residing on the processing resource (e.g., 124 or 126). The pointer is then automatically used by the processing resource (e.g., 124 or 126) when the network data packet is steered to the processing resource (e.g., 124 or 126) to cause the network data packet to be processed by the specific resource.
In some embodiments, a single processing resource (e.g., 124 or 126) can push multiple associations to multiple netmods (e.g., 110 and 120). Therefore, a single processing resource (e.g., 124 or 126) is capable of receiving and processing network data packets from a plurality of disparate netmods (e.g., 124 and 126) that are associated with disparate media channels (e.g., ATM, GigE, TDM, FR, wireless, and the like).
As one of ordinary skill in the art readily appreciates, this provides tremendous flexibility to a network design since with the teachings of the present disclosure, processing resources (e.g., 124 and 126) can be fully utilized and processing can be more easily load balanced. Therefore, an enterprise can dynamically configure or alter the steering system 100 of the present invention to accommodate changes in the enterprise's network traffic without the need to purchase additional expensive hardware and software solutions.
In some embodiments of the present disclosure, the steering table can be more complex and used to have the netmods (e.g., 110 and 120) perform filter operations on any received network data packet. These filter operations can be used to determine the context (e.g., state) of a netmod (e.g., 110 or 120) when a network data packet is received, determine the present volume of traffic on a netmod (e.g., 110 or 120), and determine the content (e.g., media type) of a network packet. Of course a variety of additional filter operations can be identified in the steering table and processed by the netmods (e.g., 110 and 120). All such filter operations are intended to fall within the broad scope of the present disclosure.
The steering system 100 depicted in
In 210, a unique identifier is received by a processing resource. The unique identifier is used to distinguish the processing resource from other processing resources. The processing resource is used to route, forward, authenticate, encrypt/decrypt, or perform other operations against a network packet. In one embodiment, the unique identifier is received from a GUI application interfaced with the processing resource. Moreover, the unique identifier is modifiable and configurable by the GUI application. Of course any software application, including command line interfaces, can be used to provide the processing resource with the unique identifier.
Additionally, a mapping, in 220, is received by the processing resource. The mapping logically associates the unique identifier of the processing resource with a netmod or with one or more components of the netmod. In one embodiment, the components represent line interface ports embodied in the netmod. The netmod receives and transmits network packets from and to other computing devices.
The mapping, in one embodiment, is received from the GUI application. Further, as depicted in 222, and in some cases, the mapping is represented as a table data structure (e.g., steering table) in the memory of the processing resource. The mapping, mapping in some embodiments, includes an identifier/address of the processing resource, an identifier for the netmod, a plurality of identifiers for line interface ports or sub-interfaces included on the netmod, and a pointer to a specific process that resides on the processing resource and is used to process any steered network packets. Additionally, the GUI application can be used to publish to an end-user the processing and memory capabilities of the processing resource. Therefore, the end-user can intelligently create and dynamically alter the mapping based on the end-user's network traffic patterns.
In 230, the mapping is provided by the processing resource to the netmod. In one instance, the mapping is provided as an in RAM (e.g., SRAM, depicted in 232) table data structure to the netmod for more efficient processing by the netmod. Moreover, the mapping can be dynamically pushed to the netmod from the processing resource. In this way, the mapping is configurable and easily altered as network traffic patterns change.
Once the netmod has the mapping, then, in 240, when the netmod receives a network packet, the mapping can be accessed or inspected in 250. Upon inspecting the mapping, the netmod associates the unique identifier/address of the assigned processing resource and any process pointer with the network packet and passes the information off to the switching fabric, which rapidly steers the network packet to the processing resource in 260 and automatically performs any process against the network packet, which was identified by any process pointer.
Therefore, unlike conventional hardwired network switches, the mapping of the present invention represents a virtual switch that permits the netmod to perform Layer 1 and Layer 2 steering on incoming network packets. Moreover, the virtual switch is easily altered and configured to meet the needs of changing network traffic patterns.
The processing resources (e.g., 330 and 340) are configurable, uniquely identified, and assigned to a number of the netmods (e.g., 310 and 320) or to a number of the line interface ports (e.g., 312, 314, 322, and 324). In one embodiment, configuration of the processing resources (e.g., 330 and 340) occurs through a GUI application communicating with the processing resources (e.g., 330 and 340). The GUI application permits dynamic modification to the configured assignment. Moreover, the configured assignment can be intelligently made by an end-user of the GUI application when the processing and memory capabilities of the processing resources (e.g., 330 and 340) are visualized and published through the GUI application to the end-user.
Configured assignments made within the processing resources (e.g., 330 and 340) are pushed from the respective processing resources (e.g., 330 and 340) to the corresponding netmods (e.g., 310 and 320). The configured assignments can be represented as a steering table inside the netmod's (e.g., 310 and 320) volatile memory (e.g., SRAM). The netmods (e.g., 310 and 320) use the configured assignments when receiving an incoming network packet and the unique identifier associated with the appropriate processing resource (e.g., 330 or 340) in order to steer the incoming network packet to the designated processing resource (e.g., 330 or 340).
One technique to access the steering table is to index the incoming network packet into the table by the incoming network packet's channel identifier to acquire the appropriate unique identifier for the processing resource (e.g., 330 or 340). Once the unique identifier is associated with the incoming packet it is readily steered to the designated processing resource (e.g., 330 or 340). Corresponding, the identifier, in some embodiments, is an address for the appropriate processing resource (e.g., 330 or 340). Moreover, in one embodiment, the configured assignment also identifies a pointer to a specific process on the appropriate processing resource (e.g., 330 or 340), which is used to automatically process the incoming packet on the appropriate processing resource (e.g., 330 or 340).
In some instances, the configured assignments can also be used to identify one or more filter operations that the processing resource (e.g., 330 or 340) wants the netmods (e.g., 310 and 320) to perform on the incoming network packet before steering the incoming network packet. Some example filter operations can include, detecting and communicating a current volume of network traffic, detecting and communicating a content format (e.g., media format) of the incoming packet, and detecting and communicating a context (e.g., processing state) associated with the netmods (e.g., 310 and 320) when the incoming network packet is received.
Methods and systems detailed above permit improved network packet steering. In various embodiments, these methods and systems facilitate the creation of virtual switches. In contrast, traditional approaches have relied on hardwired and static implementations of switches. Accordingly, embodiments of the present invention permits better utilization and load balancing of an enterprise's network resources.
Furthermore, the virtual switches of embodiments of the present invention are dynamically configurable to meet the changing needs of an enterprise's network traffic. In some embodiments, the configuration of the virtual switches can be altered using a GUI application in communication with a processing resource. Moreover, the processing and memory capabilities of the processing resource can be published and made available within the GUI application. In this way, an enterprise can monitor and alter network traffic as needed in accordance with the teachings of various embodiments of the present invention, without the need to acquire additional hardware and software resources.
The foregoing description of specific embodiments reveals the general nature of the invention sufficiently that others can, by applying current knowledge, readily modify and/or adapt it for various applications without departing from the generic concept. Therefore such adaptations and modifications are within the meaning and range of equivalents of the disclosed embodiments. The phraseology or terminology employed herein is for the purpose of description and not of limitation. Accordingly, the invention embraces all such alternatives, modifications, equivalents and variations as fall within the spirit and scope of the appended claims.
This application is a continuation of U.S. application Ser. No. 10/163,261 filed on Jun. 4, 2002, now U.S. Pat. No. 7,203,192, which is hereby incorporated by reference for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
4590468 | Stieglitz | May 1986 | A |
4667287 | Allen et al. | May 1987 | A |
5201049 | Shorter | Apr 1993 | A |
5371852 | Attanasion et al. | Dec 1994 | A |
5473599 | Li et al. | Dec 1995 | A |
5490252 | Macera et al. | Feb 1996 | A |
5550816 | Hardwick et al. | Aug 1996 | A |
5581705 | Passint et al. | Dec 1996 | A |
5633866 | Callon | May 1997 | A |
5745778 | Alfieri | Apr 1998 | A |
5825772 | Dobbins et al. | Oct 1998 | A |
5841973 | Kessler et al. | Nov 1998 | A |
5841990 | Picazzo et al. | Nov 1998 | A |
5875290 | Bartfai et al. | Feb 1999 | A |
5892924 | Lyon et al. | Apr 1999 | A |
5920705 | Lyon et al. | Jul 1999 | A |
5963555 | Takase et al. | Oct 1999 | A |
5964847 | Booth et al. | Oct 1999 | A |
5987521 | Arrowood et al. | Nov 1999 | A |
6014382 | Takihiro et al. | Jan 2000 | A |
6014669 | Slaughter et al. | Jan 2000 | A |
6032193 | Sullivan | Feb 2000 | A |
6047330 | Stracke | Apr 2000 | A |
6069895 | Ayandeh | May 2000 | A |
6085238 | Yuasa et al. | Jul 2000 | A |
6098110 | Witkowski et al. | Aug 2000 | A |
6108699 | Molin | Aug 2000 | A |
6118791 | Fichou et al. | Sep 2000 | A |
6137777 | Vaid et al. | Oct 2000 | A |
6169739 | Isoyama | Jan 2001 | B1 |
6169793 | Godwin et al. | Jan 2001 | B1 |
6175867 | Taghadoss | Jan 2001 | B1 |
6192051 | Lipman et al. | Feb 2001 | B1 |
6220768 | Barroux | Apr 2001 | B1 |
6226788 | Schoening et al. | May 2001 | B1 |
6243580 | Garner | Jun 2001 | B1 |
6246682 | Roy et al. | Jun 2001 | B1 |
6249519 | Rangachar | Jun 2001 | B1 |
6256295 | Callon | Jul 2001 | B1 |
6260072 | Rodriguez | Jul 2001 | B1 |
6260073 | Walker et al. | Jul 2001 | B1 |
6266695 | Huang et al. | Jul 2001 | B1 |
6278708 | Von Hammerstein et al. | Aug 2001 | B1 |
6286038 | Reichmeyer et al. | Sep 2001 | B1 |
6295297 | Lee | Sep 2001 | B1 |
6298130 | Galvin | Oct 2001 | B1 |
6330602 | Law et al. | Dec 2001 | B1 |
6338092 | Chao et al. | Jan 2002 | B1 |
6343083 | Mendelson et al. | Jan 2002 | B1 |
6405262 | Vogel et al. | Jun 2002 | B1 |
6414595 | Scrandis et al. | Jul 2002 | B1 |
6434619 | Lim et al. | Aug 2002 | B1 |
6438612 | Ylonen et al. | Aug 2002 | B1 |
6449650 | Westfall et al. | Sep 2002 | B1 |
6453406 | Sarnikowski et al. | Sep 2002 | B1 |
6463061 | Rekhter et al. | Oct 2002 | B1 |
6466976 | Alles et al. | Oct 2002 | B1 |
6493349 | Casey | Dec 2002 | B1 |
6496935 | Fink et al. | Dec 2002 | B1 |
6526056 | Rekhter et al. | Feb 2003 | B1 |
6532088 | Dantu | Mar 2003 | B1 |
6542466 | Pashtan et al. | Apr 2003 | B1 |
6542502 | Herring et al. | Apr 2003 | B1 |
6542515 | Kumar et al. | Apr 2003 | B1 |
6553423 | Chen | Apr 2003 | B1 |
6556544 | Lee | Apr 2003 | B1 |
6608816 | Nichols | Aug 2003 | B1 |
6609153 | Salkewicz | Aug 2003 | B1 |
6611498 | Baker et al. | Aug 2003 | B1 |
6611522 | Zheng et al. | Aug 2003 | B1 |
6625169 | Tofano | Sep 2003 | B1 |
6633571 | Sakamoto et al. | Oct 2003 | B1 |
6636516 | Yamano | Oct 2003 | B1 |
6639897 | Shiomoto et al. | Oct 2003 | B1 |
6640248 | Jorgensen | Oct 2003 | B1 |
6654787 | Aronson et al. | Nov 2003 | B1 |
6658013 | de Boer et al. | Dec 2003 | B1 |
6668282 | Booth et al. | Dec 2003 | B1 |
6680922 | Jorgensen | Jan 2004 | B1 |
6694437 | Pao et al. | Feb 2004 | B1 |
6697359 | George | Feb 2004 | B1 |
6697360 | Gai et al. | Feb 2004 | B1 |
6732314 | Borella et al. | May 2004 | B1 |
6738371 | Ayres | May 2004 | B1 |
6738821 | Wilson et al. | May 2004 | B1 |
6763236 | Siren | Jul 2004 | B2 |
6769124 | Schoening et al. | Jul 2004 | B1 |
6775267 | Kung | Aug 2004 | B1 |
6775284 | Calvignac et al. | Aug 2004 | B1 |
6778502 | Ricciulli | Aug 2004 | B2 |
6785224 | Uematsu et al. | Aug 2004 | B2 |
6807181 | Weschler | Oct 2004 | B1 |
6816462 | Booth et al. | Nov 2004 | B1 |
6820210 | Daruwalla et al. | Nov 2004 | B1 |
6822958 | Branth et al. | Nov 2004 | B1 |
6868082 | Allen et al. | Mar 2005 | B1 |
6883170 | Garcia | Apr 2005 | B1 |
6894994 | Grob et al. | May 2005 | B1 |
6907039 | Shen | Jun 2005 | B2 |
6920146 | Johnson et al. | Jul 2005 | B1 |
6938097 | Vincent | Aug 2005 | B1 |
6944128 | Nichols | Sep 2005 | B2 |
6944168 | Paatela et al. | Sep 2005 | B2 |
6954429 | Horton et al. | Oct 2005 | B2 |
6959194 | Brouwer et al. | Oct 2005 | B2 |
6982984 | Asayesh | Jan 2006 | B1 |
6985438 | Tschudin | Jan 2006 | B1 |
6985956 | Luke et al. | Jan 2006 | B2 |
6990103 | Gollamundi | Jan 2006 | B1 |
7020143 | Zdan | Mar 2006 | B2 |
7028333 | Tuomenoksa et al. | Apr 2006 | B2 |
7042843 | Ni | May 2006 | B2 |
7042848 | Santiago et al. | May 2006 | B2 |
7054311 | Norman et al. | May 2006 | B2 |
7062642 | Langrind et al. | Jun 2006 | B1 |
7068656 | Sainomoto et al. | Jun 2006 | B2 |
7089293 | Grosner et al. | Aug 2006 | B2 |
7096383 | Talaugon | Aug 2006 | B2 |
7111072 | Matthews | Sep 2006 | B1 |
7116665 | Balay | Oct 2006 | B2 |
7159031 | Larkin et al. | Jan 2007 | B1 |
7159035 | Garcia-Luna Aceves et al. | Jan 2007 | B2 |
7161904 | Hussain | Jan 2007 | B2 |
7174372 | Sarkar | Feb 2007 | B1 |
7177311 | Hussain | Feb 2007 | B1 |
7181547 | Millet | Feb 2007 | B1 |
7181766 | Bendinelli et al. | Feb 2007 | B2 |
7187676 | DiMambro | Mar 2007 | B2 |
7197553 | Roberts et al. | Mar 2007 | B2 |
7203192 | Desai | Apr 2007 | B2 |
7221945 | Milford et al. | May 2007 | B2 |
7263106 | Matthews | Aug 2007 | B2 |
7266120 | Cheng et al. | Sep 2007 | B2 |
7272643 | Sarkar | Sep 2007 | B1 |
7278055 | Talaugon | Oct 2007 | B2 |
7313614 | Considine et al. | Dec 2007 | B2 |
7316029 | Parker et al. | Jan 2008 | B1 |
7324489 | Iyer | Jan 2008 | B1 |
7337221 | Radi et al. | Feb 2008 | B2 |
7340535 | Alam | Mar 2008 | B1 |
7376125 | Hussain | May 2008 | B1 |
7376827 | Jiao | May 2008 | B1 |
7386010 | Solomon et al. | Jun 2008 | B2 |
7389358 | Matthews | Jun 2008 | B1 |
7499398 | Damon et al. | Mar 2009 | B2 |
20010000194 | Sequeira | Apr 2001 | A1 |
20010024425 | Tsunoda et al. | Sep 2001 | A1 |
20010028636 | Skog et al. | Oct 2001 | A1 |
20010043571 | Jang et al. | Nov 2001 | A1 |
20010048661 | Clear et al. | Dec 2001 | A1 |
20010052013 | Munguia et al. | Dec 2001 | A1 |
20020062344 | Ylonen et al. | May 2002 | A1 |
20020066034 | Schlossberg et al. | May 2002 | A1 |
20020071389 | Seo | Jun 2002 | A1 |
20020075901 | Perlmutter et al. | Jun 2002 | A1 |
20020097672 | Barbas et al. | Jul 2002 | A1 |
20020099849 | Alfieri et al. | Jul 2002 | A1 |
20020150093 | Ott et al. | Oct 2002 | A1 |
20020150114 | Sainomoto et al. | Oct 2002 | A1 |
20020152373 | Sun et al. | Oct 2002 | A1 |
20020162025 | Sutton et al. | Oct 2002 | A1 |
20020186661 | Santiago et al. | Dec 2002 | A1 |
20020186667 | Mor et al. | Dec 2002 | A1 |
20020191604 | Mitchell et al. | Dec 2002 | A1 |
20030012209 | Abdelilah et al. | Jan 2003 | A1 |
20030033401 | Poisson et al. | Feb 2003 | A1 |
20030055920 | Kakadia et al. | Mar 2003 | A1 |
20030063590 | Mohan et al. | Apr 2003 | A1 |
20030074388 | Pham et al. | Apr 2003 | A1 |
20030084219 | Yao et al. | May 2003 | A1 |
20030108041 | Aysan | Jun 2003 | A1 |
20030112799 | Chandra et al. | Jun 2003 | A1 |
20030115308 | Best et al. | Jun 2003 | A1 |
20030117954 | De Neve et al. | Jun 2003 | A1 |
20030131228 | Twomey | Jul 2003 | A1 |
20030169747 | Wang | Sep 2003 | A1 |
20030174650 | Shankar et al. | Sep 2003 | A1 |
20030185221 | Deikman et al. | Oct 2003 | A1 |
20030200295 | Roberts et al. | Oct 2003 | A1 |
20030212735 | Hicok et al. | Nov 2003 | A1 |
20030223406 | Balay | Dec 2003 | A1 |
20030223418 | Desai et al. | Dec 2003 | A1 |
20040006601 | Bernstein et al. | Jan 2004 | A1 |
20040019651 | Andaker | Jan 2004 | A1 |
20040042416 | Ngo et al. | Mar 2004 | A1 |
20040054886 | Dickinson et al. | Mar 2004 | A1 |
20040078772 | Balay | Apr 2004 | A1 |
20040095932 | Astarabadi et al. | May 2004 | A1 |
20040095934 | Cheng et al. | May 2004 | A1 |
20040141521 | George | Jul 2004 | A1 |
20040160900 | Lund et al. | Aug 2004 | A1 |
20040193922 | Bandini et al. | Sep 2004 | A1 |
20040199567 | Lund | Oct 2004 | A1 |
20040199568 | Lund | Oct 2004 | A1 |
20040199569 | Kalkunte et al. | Oct 2004 | A1 |
20050047407 | Desai | Mar 2005 | A1 |
20050081059 | Bandini et al. | Apr 2005 | A1 |
20050163115 | Dontu et al. | Jul 2005 | A1 |
20050213589 | Shih | Sep 2005 | A1 |
20060087969 | Santiago et al. | Apr 2006 | A1 |
20060265519 | Millet | Nov 2006 | A1 |
20070058648 | Millet | Mar 2007 | A1 |
20070064704 | Balay | Mar 2007 | A1 |
20070073733 | Matthews | Mar 2007 | A1 |
20070083528 | Matthews | Apr 2007 | A1 |
20070104119 | Sarkar | May 2007 | A1 |
20070109968 | Hussain | May 2007 | A1 |
20070110062 | Balay | May 2007 | A1 |
20070121579 | Matthews | May 2007 | A1 |
20070127382 | Hussain | Jun 2007 | A1 |
20070237172 | Zelig et al. | Oct 2007 | A1 |
20070291755 | Chang | Dec 2007 | A1 |
20080013470 | Kopplin | Jan 2008 | A1 |
20080016389 | Talaugon | Jan 2008 | A1 |
20080117917 | Balay | May 2008 | A1 |
20080317040 | Balay | Dec 2008 | A1 |
20080317231 | Balay | Dec 2008 | A1 |
20080320553 | Balay | Dec 2008 | A1 |
20090007228 | Balay | Jan 2009 | A1 |
20090046728 | Matthews | Feb 2009 | A1 |
20090073977 | Hussain | Mar 2009 | A1 |
Number | Date | Country |
---|---|---|
0051290 | Aug 2000 | WO |
0076152 | Dec 2000 | WO |
0163809 | Aug 2001 | WO |
0223855 | Mar 2002 | WO |
03010323 | Dec 2003 | WO |
Number | Date | Country | |
---|---|---|---|
20070147368 A1 | Jun 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10163261 | Jun 2002 | US |
Child | 11684614 | US |