The present invention relates generally to application service appliances. More particularly, this invention relates to highly scalable application layer service appliances.
The ability to connect information technology infrastructure reliably, cost-effectively and securely is of high importance for today's global enterprises. To communicate with customers, clients, business partners, employees, etc., the Internet has proven to be more appropriate compared to private communication networks. However, communication via the Internet, which typically uses TCP/IP (Transmission Control Protocol/Internet Protocol), also increases the requirements for data security. Network firewalls are one of the many examples of solutions for network security.
Enterprise Web Application Services build an important foundation for such client, customer, and employee communication. A very common configuration for hosting such enterprise web Application Services is shown in
A client 1003 may connect via a Local Area Network (LAN) through the enterprise's intranet 1013. Another client 1004 may connect through a Wireless LAN (WLAN) to the intranet 1013. Yet another client 1005 may be located inside the enterprise's campus network 1015, which connects to the enterprise's intranet 1013. An enterprise may have zero or more campuses 1014 and 1015. Yet another client 1001 may connect through the Internet 1000, or a client 1002 may have a mobile connection to the Internet 1000. In any case to prevent illegitimate access to the enterprise's web Application Services, the “inside” of the enterprise's network, the intranet 1013, is protected by having a network perimeter 1010, which may comprise firewalls, associated network interconnect, and additional resources “within” the perimeter network configured so as to be broadly accessible to users on the “outside” of the enterprise.
Behind the perimeter 1010, access is granted to legitimate client requests only, while illegitimate access is rejected. The fundamentals in determining whether an access request is legitimate or not are based on the network reference model from the International Organization for Standardization (ISO). This ISO network reference model classifies Network Services into seven layers.
Traditionally, ISO Layer-4 to ISO Layer-7 services have been developed either as server-hardware and -software based single-function (or even multi-function) network appliances or as service modules on ISO Layer-2 to ISO Layer-3 packet switches. The latter approach, though welcomed initially, has not gained momentum in the market place due to the inherent cost and complexity of managing stream-oriented ISO Layer-4 to ISO Layer-7 services in the same product that was originally designed for packet-oriented ISO Layer-2 to ISO Layer-3 switching/routing. In reality, ISO Layer-4 to ISO Layer-7 service modules never became integral parts of the packet switching architecture, because the needs and tradeoffs are quite different. The network appliance approach has been very successful in introducing new innovative functions into the data center, such as Application Front Ends, Application Firewalls, and Wide Area Network (WAN) Optimizations, in a very short period of time, albeit at a lower performance and scalability. However, this approach has also led to the proliferation of multiple single-function network appliances in the enterprise network, particularly for multi-service deployments. Multiple network appliances functioning in the path of a client-server-connection introduce high latency due to multiple transport protocol termination, and involve high management and deployment complexity as the network needs to be carefully designed, taking all failure scenarios into consideration. Customers have begun to experience the negative impact of deploying multiple single-function network appliances and are looking for alternatives. Also, as enterprise data centers migrate to higher bandwidth Ethernet and to converged interconnect fabric, the existing ISO Layer-4 to ISO Layer-7 solutions become ineffective. With this as the background, there is a need for next generation architectures to securely, efficiently and reliably deliver ISO Layer-4 to ISO Layer-7 services.
A highly scalable application layer service appliance is described herein. According to one embodiment, a network element includes a plurality of application service modules (ASMs), each providing one or more application services to network traffic, including layer 5 to layer 7 services, a lossless data transport fabric (LDTF), a network service module (NSM) coupled to each of the ASMs over the LDTF. In response to a packet of a network transaction received from a client over for accessing a server of a datacenter, the NSM is configured to perform layer 2 to layer 5 processes on the packet, generating a data stream. The NSM is configured to route the data stream to at least two ASMs over the LDTF to allow the ASMs to perform layer 5-7 services on the packet.
Other features of the present invention will be apparent from the accompanying drawings and from the detailed description which follows.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.
In the following description, numerous details are set forth to provide a more thorough explanation 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 these specific details. In other instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring embodiments of the present invention.
Reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification do not necessarily all refer to the same embodiment.
One aspect of the invention is the use of a Lossless Data Transport Fabric for Layer-7 Networking, comprising an ISO Layer-7 networking system, which performs network operations in multiple separate processing domains, which are interconnected via the Lossless Data Transport Fabric (LDTF). This LDTF may be an RDMA-capable fabric, such as InfiniBand or iWARP.
One aspect of the invention is a system and method for Highly-Scalable Layer-7 Networking, comprising an ISO Layer-7 networking system with multiple processing elements connected via a Lossless Data Transport Fabric where the processing necessary to perform the network operation(s) are distributed over the processing elements. In some configurations, at least one of the processing elements is dedicated to operations for ISO Layer-7 processing. In some configurations, at least one of the processing elements is dedicated to operations for ISO Layer-2 to ISO Layer-5 processing.
The approach described herein applies combinations of parallel, multi-processor computing technology with lossless, low-latency, high-bandwidth network fabric technology (also known as Lossless Data Transport Fabric, or LDTF) to form novel methods and systems for high performance, high-reliability, high availability, and secure network applications. The various embodiments of the inventions described herein enable the implementation of highly reliable, highly scalable solutions for enterprise networking such as, for example, the APS 2000 from
Multiple network Services are efficiently provided by terminating transport protocols centrally. As can be seen, any transport protocol can be terminated centrally, each PDU's payload can be collected and converted into a data stream and, vice versa, a data stream can be converted into PDUs for any transport protocol and be transported via the given transport protocol. A simple concatenation of the PDU payload into a byte-stream is not sufficient. Key to the conversion is that state information must be maintained about the meta-data of each connection. Such meta-data includes the session information, for example via a unique connection identification number, the transaction information, as well as the information regarding segments and packets. Finite state machines can be used to track the meta-data.
Transport protocols are protocols which are used to transport information via networks. These include, obviously, the ISO Layer-3 protocols such as IPv4, IPv6, IPSec, the ISO Layer-4 protocols such as TCP, UDP, SCTP, the various ISO Layer-5 protocols such as FTP, HTTP, IMAP, SMTP, GTP, L2TP, PPTP, SOAP, SDP, RTSP, RTP, RTCP, RPC, SSH, TLS, DTLS, SSL, IPSec, and VPN protocols. However, other protocols and approaches are contemplated within the scope of the inventions, which serve as transport mechanisms for transmitting information and application data and can also be terminated in a centralized fashion by a protocol proxy and the corresponding PDUs can be transformed into a data stream for application layer processing. Examples of such are, CSIv2, CORBA, IIOP, DCOM and other Object Request Brokers (ORB), MPEG-TS or RTP as a transport for multi-media information, RTSP or SIP as another transport for multi-media information, peer-to-peer transport mechanisms, transport mechanisms based on J2EE such as Java RMI, streaming media protocols such as VoIP, IPTV, etc.
For the sake of simplicity we will use the term Centralized Transport Protocol Termination throughout the rest of the description, however, this is for exemplary purposes only and is not intended to be limiting. Centralized Transport Protocol Termination can be performed by dedicated processing units, and different ISO Layer-7 services can be performed in other dedicated processing units. The use of a lossless low-latency high-bandwidth fabric for inter-process communication between such dedicated processing units makes it possible to simultaneously support Centralized Transport Protocol Termination for multiple services. For example, TCP can be terminated once, transformed into a data stream and this data stream is transported from one dedicated processing unit to another using the lossless low-latency high-bandwidth fabric. The low-latency nature of the fabric helps to reduce the overall latency in client-to-server transactions.
In one embodiment, the Application Protection System (APS) 2000 is a network appliance that can act as a proxy between the client 2001 and the application server 2005, and can determine whether a client 2001 shall be granted access to certain applications 2005. In one example, the client 2001 is one or more of the clients 1001, 1002, 1003, 1004, or 1005 of
The APS 2000 may use a Triangulated Authorization method which, for example, is based on multiple aspects of a client (such as the client 2001), the requested application (such as application 2005) and certain network characteristics: Who—a client (a user or a machine) and its associated attributes such as department, role, project association, seniority, citizenship, etc; Where—network and environment attributes such as access methods (wire-line/wireless/VPN), location (e.g., USA, Switzerland, China) and time; What—on-the-wire session attributes, including protocol and content/resource attributes. The outcome of this Triangulated Authorization method can be used to determine whether access to an application is granted or rejected. Optionally, a Single-Sign-On (SSO) server such as server 2004 may be involved that allows the client 2001 to obtain authorization for accessing multiple applications at once.
Centralized Transport Protocol Termination for Multi-Services
One embodiment of the invention acts as a proxy between one or more clients and one or more application servers to control the access of the one or more clients to the one or more applications. This is described, for example, in
One embodiment of the invention is a network appliance which terminates multiple transport protocols in one central point to overcome the many drawbacks of multiple transport protocol termination, such as increased latency and lack of scalability. Therefore, the network appliance may need to perform a set of functions similar to those typical of application servers such as network proxy, deep packet inspection, cryptography, data compression, regular expression parsing, etc. Network services that may need Centralized Transport Protocol Termination include but are not limited to application authentication and authorization, application firewalls, application data routing, in-line intrusion-detection and intrusion prevention, SSL offloading/acceleration, server load balancing, XML offloading/acceleration, and application front-end engine services (also called application acceleration).
ISO Layer-2 to ISO Layer-5 processing typically involves packets, segments and records processing, whereas ISO Layer-7 processing typically involves application data processing. Full ISO Layer-7 inspection goes beyond application headers and typically involves reassembling application layer data. A general rule used in the art is that a 1 GHz processor is needed for processing ISO Layer-3 or ISO Layer-4 PDUs at 1 Gbps, whereas a 10 GHz processor is needed for application data processing at 1 Gbps (for example for SSL VPN URL mangling operation). Therefore, the computational complexity required for scaling the proxy functionality is quite different from the computational complexity required for scaling ISO Layer-7 processing.
To solve the computational complexity in an efficient way, one embodiment of the invention splits the overall ISO Layer-2 to ISO Layer-7 stack into (at least) two independent processing domains. One domain, which is called Network Service processing for ISO Layer-2 to ISO Layer-5 processing (i.e., up to TCP/SSL processing) provides proxy functions, and a second domain which is called Application Service processing for ISO Layer-7 processing. Splitting the stack requires a reliable, lossless, low-latency, high-bandwidth connection between those two (or more) processing domains in order for the Network Service processing to forward the data stream to the Application Service processing for further processing. As a solution, this approach uses a LDTF such as RDMA-capable fabric technology to provide this reliable lossless, low-latency, high-bandwidth interconnect between processing domains.
Using this novel approach, both processing domains can be scaled independent of each other and a well-balanced system can be achieved at reasonable costs.
A LDTF, such as the LDTF 2102 can be used for the inter-process communication between those domains. In one embodiment of the invention, the LDTF is implemented using the IB point-to-point switch fabric architecture. Incoming connections from the client are terminated in the NSM and are transformed into a data stream. This data stream can, for example, without limitation, be transported via the IB fabric. In one other embodiment of the invention, the LDTF is implemented using an RDMA-capable interconnect fabric. In further embodiments of the invention, it is contemplated that other LDTFs may be used as interconnect fabrics, for example, without limitation, iWARP and other interconnect fabrics such as are known or may become known to one of ordinary skill in the art.
This can be done by PDU processing and reassembling the payload of the PDUs into their corresponding data stream. This data stream is transported via IB fabric to the ASM for further ISO Layer-7 processing. The result of ISO Layer-7 processing done by ASM is then transported back—still as a data stream—again via the IB fabric to the NSM. The NSM then transforms the data stream into PDUs and sends the PDUs to the application server using the appropriate transport protocol. Connections which originate from the application server can be handled similarly.
One benefit of the present approach is the overall reduction of latency in the communication link between clients and application servers. Yet another benefit is that the approach can be scaled with various, specialized, dedicated processing modules.
Highly Scalable Architecture for Application-Layer Service Using LDTF
One key aspect of the invention described herein is the approach to keep the communication in separate planes: For example, a Network Service plane, an Application Service plane and a Management Service plane. The fact that the Network Service plane is separate from the Application Service plane is also reflected by splitting the network protocol processing into two or more domains, for example into Network Service processing and Application Service processing. This offers additional options for optimizing the performance of this approach and to make it scale better to networking and availability demands.
One option is that at the Network Service plane a processing unit for packet order work processing can be deployed. Then the packets of a particular connection can be handled by any processing element of a multi-processing architecture without the need for software locks. The packets can then be processed in multiple stages, which provide a higher degree of concurrency. Similarly, at the Application Service plane a processing unit for transaction order work processing can be deployed and, for example, implemented in software. Then the transactions of a particular connection can be handled by any processing element of a multi-processing architecture without the need for software locks. Therefore, each transaction can then be processed in a pipelined fashion which serializes the application data processing and increases the level of concurrency for ISO Layer-7 processing, which again further increases the compute efficiency of this approach.
At the Network Service plane various possibilities for network flow control schemes now become possible.
In a practical enterprise network application another performance optimization is important. Typically, one NSM can keep several ASMs busy. Therefore it makes sense not only to load balance traffic in the Network Service plane but also in the Application Service plane. Various possibilities for such optimizations exist as disclosed herein. In one embodiment of the invention, the ANA 2140 of
Many combinations of scaling by connecting one or more NSMs and one or more ASMs are possible, all interconnected via lossless, low-latency, high-bandwidth LDTF. For example, in yet another embodiment of the invention which is illustrated in
The third plane, the Management Service plane, is a communication means for all administrative processing such as, for example, common system management functions, chassis management, power management, component audit and logging, component and system status update, as well as configuration, health monitoring and management of processing elements in network services and Application Service plane. The Management Service plane comprises System Control Modules (SCMs) which can have out-of-band connectivity (as well as in-band connectivity) to processing elements on the Network Service plane and to processing elements on the Application Service plane. Typically, software image download, configuration information, and statistics collection messages are exchanged between one or more SCMs and the rest of the system components.
For performance scaling purposes and to support high-availability, two or more SCMs can be connected to the LDTF. For example, in one embodiment of the invention, which is illustrated in
In yet another embodiment of the invention, two—or more—ANAs can be connected via a high-availability link using LDTF. The high-availability link can be an external extension of the internal LDTFs. Each ANA can then operate as a backup ANA for one of its peers as it is described above. Similarly to NSMs and ASMs, the two—or more—SCMs can replicate their state information and update their state information in their backup ANA's SCM by writing state information into the peer's memory via the LDTF using, for example, RDMA.
L2-L5 Processing Unit—NSM
A NSM processes the lower network layers, ISO Layer-2 to ISO Layer-5. In one embodiment of the invention, such a NSM can be constructed as shown in
For better scalability, in one embodiment of the invention, a NSM can be a multi-processor architecture, as shown in
L7 Processing Unit—ASM
An ASM performs the ISO Layer-7 services, including application data processing on the data stream, which is the data stream of the transport protocol's PDU payload transformed by one or more NSMs.
For those tasks a high compute power is needed, typically more than for plain ISO Layer-2 to ISO Layer-5 processing. Therefore, a single-processor architecture using existing micro-processors may require hardware assist to provide sufficient compute power for high-bandwidth client-to-server connections. Alternatively, it may be advantageous to implement an ASM either as a homogeneous multi-processor system of generic ISO Layer-7 processing units, or as a heterogeneous multi-processing system using a sea of different, specialized ISO Layer-7 processing units.
For building the multi-processor architecture of the ASM several options exist: A multi-core processor technology can be used, which can be a System-on-a-Chip with on-chip hardware accelerators; or one can use multi-core processors with external co-processors, for example, a co-processor for cryptographic operations, a co-processor for regular expression analysis, a co-processor for data compression and decompression, etc. A parallel-mode compute architecture can be deployed which will require a flow dispatcher to distribute incoming traffic across the multiple processors. A pipelined-mode compute architecture can be used, where one processing element acts as a pre-processor for a subsequent processing element. Or, a hybrid approach can be used combining parallel mode with pipelined compute architectures. Further, any other architecture contemplated by one of skill in the art may be used.
LDTF to Connect L2-L5 Unit with L7 Units
In any case, the compute architecture requires a lossless, low-latency, high-bandwidth fabric for any-to-any inter-process communication links between the one or more NSMs (which each may comprise one or more NSPs) and the one or more ASMs (which each may comprise one or more ASPs).
Many options exist for implementing the LDTF 3442: In one embodiment of the invention the LDTF can be IB. In another embodiment of the invention the LDTF can be Data Center Ethernet with RDMA support. In yet another embodiment of the invention, the LDTF can be iWARP which supports RDMA over TCP. Besides being a lossless, low-latency, high-bandwidth interconnect means RDMA enables the performance of RDMA one-sided read-based load monitoring and can be used to map connection level flow control using RDMA queue-pair flow control.
Stream Switch Architecture Based on LDTF
One fundamental, novel principle of this approach is to split the processing architecture into separate planes: A Management Service plane, a Network Service plane and an Application Service plane. The Management Service plane comprises one or more SCMs and is used for all out-of-band connectivity to processing elements on the Network Service plane and to processing elements on the Application Service plane and can be used, for example, for software image downloading, command-line interface, statistic collection messages, general system management functions, configuration management, etc. The Network Service plane comprises one or more NSMs for ISO Layer-2 to ISO Layer-5 processing and proxy functions. The Application Service plane comprises one or more ASMs for ISO Layer-7 services processing and for data stream analysis. As discussed above, this division into a Network Service plane and Application Service plane should be viewed as exemplary only, and other divisions and arrangements and number of service planes may be contemplated by one of skill in the art.
This tri-planar architecture is, for example, shown in
Processing Flows
Splitting the data network processing into two separate domains, Network Service processing and Application Service processing—especially when constrained by scalability and high-availability—may require a particular processing flow between the one or more NSPs and the one or more ASPs.
For example, it is desirable to enforce flow-control because the proxy splits the client-server connection into two portions: One client-to-proxy connection which typically has a high round-trip delay time and low throughput and a proxy-to-server connection which typically has low round-trip delay time and high throughput. The flow control for the client connection and the server connection mimic the behavior of the end-to-end flow-control of the original client-to-server connection. The internal LDTF enables the mapping of connection-level flow-control using RDMA queue-pair flow-control and therefore solves the problem created by splitting the client-server connection with a proxy.
Based on the granularity of the processing steps that can be distributed among the two or more NSPs, or the two or more ASPs, several options exist for load balancing, for example, in the Multi-Core Scheduling 4026 or in the Application Container 4015. In order to handle the events for multiple sockets, a typical application will map each socket to a thread or a process. The advantage with this approach is that the scheduling for different socket events is taken care of by the operating system. But the disadvantage is that process and thread scheduling is a very costly operation. Especially for high-speed network applications, which handle many connections, considerable CPU resources will be used just for process and thread scheduling. A library of ultra-light-weight strands can solve this problem by providing a light-weight execution context (the so-called strand) and by mapping a socket to each strand. The strand library enables having multiple strands within a system scheduling context of either processes or threads. Strand scheduling can be performed by a secondary scheduler. Essentially the operating system schedules the processes and threads, and the strand library schedules the strands. The strand scheduler can be completely I/O driven; i.e., a strand is scheduled whenever there is an incoming or outgoing event for a given socket. In order to provide an independent execution context for each strand, a separate stack can be allocated for each strand.
Scalability
Various embodiments of some of the inventions for scalability have been described in this disclosure, for example, the embodiment of the invention can not only be used for high-availability but also to scale an ANA for higher bandwidth and network processing demands. When two or more NSMs or two or more ASMs are connected via LDTF within one ANA, the inter-process communication between NSMs and ASMs then operates via so-called intra-chassis communication. Alternatively, when two or more ANAs are connected via LDTF, the inter-process communication then operates via so-called inter-chassis communication. Or, when both approaches are combined, both intra-chassis and inter-chassis communication goes over the LDTF.
Some portions of the preceding detailed descriptions have been presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the ways used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the above discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
Embodiments of the present invention also relate to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), erasable programmable ROMs (EPROMs), electrically erasable programmable ROMs (EEPROMs), magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method operations. The required structure for a variety of these systems will appear from the description below. In addition, embodiments of the present invention are not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of embodiments of the invention as described herein.
A machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (“ROM”); random access memory (“RAM”); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.
In the foregoing specification, embodiments of the invention have been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications may be made thereto without departing from the broader spirit and scope of the invention as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.
This application claims the benefit of U.S. Provisional Patent Application No. 60/966,649, filed Aug. 28, 2007, which is incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5706429 | Lai et al. | Jan 1998 | A |
6131120 | Reid | Oct 2000 | A |
6205480 | Broadhurst et al. | Mar 2001 | B1 |
6223217 | Pettus | Apr 2001 | B1 |
6460141 | Olden | Oct 2002 | B1 |
6594712 | Pettey et al. | Jul 2003 | B1 |
6640238 | Bowman-Amuah | Oct 2003 | B1 |
6658469 | Massa et al. | Dec 2003 | B1 |
6675200 | Cheriton et al. | Jan 2004 | B1 |
6728884 | Lim | Apr 2004 | B1 |
6754829 | Butt et al. | Jun 2004 | B1 |
6804720 | Vilander et al. | Oct 2004 | B1 |
6889294 | Nichols et al. | May 2005 | B1 |
6901491 | Kohn et al. | May 2005 | B2 |
6912604 | Tzeng et al. | Jun 2005 | B1 |
6922724 | Freeman et al. | Jul 2005 | B1 |
6947984 | Schweitzer et al. | Sep 2005 | B2 |
6985956 | Luke et al. | Jan 2006 | B2 |
6986040 | Kramer et al. | Jan 2006 | B1 |
6999462 | Acharya | Feb 2006 | B1 |
7010807 | Yanovsky | Mar 2006 | B1 |
7051126 | Franklin | May 2006 | B1 |
7088727 | Short et al. | Aug 2006 | B1 |
7100200 | Pope et al. | Aug 2006 | B2 |
7114096 | Freimuth et al. | Sep 2006 | B2 |
7114180 | DeCaprio | Sep 2006 | B1 |
7117526 | Short | Oct 2006 | B1 |
7120792 | Jacobson et al. | Oct 2006 | B1 |
7146635 | Eggebraaten et al. | Dec 2006 | B2 |
7149808 | Lu | Dec 2006 | B2 |
7149817 | Pettey | Dec 2006 | B2 |
7149819 | Pettey | Dec 2006 | B2 |
7149892 | Freed et al. | Dec 2006 | B2 |
7162566 | Lin | Jan 2007 | B2 |
7171681 | Duncan et al. | Jan 2007 | B1 |
7178163 | Reeves, Jr. | Feb 2007 | B2 |
7185192 | Kahn | Feb 2007 | B1 |
7185361 | Ashoff et al. | Feb 2007 | B1 |
7185364 | Knouse et al. | Feb 2007 | B2 |
7194554 | Short et al. | Mar 2007 | B1 |
7197556 | Short et al. | Mar 2007 | B1 |
7209478 | Rojas et al. | Apr 2007 | B2 |
7209970 | Everson et al. | Apr 2007 | B1 |
7209977 | Acharya et al. | Apr 2007 | B2 |
7216152 | Short et al. | May 2007 | B2 |
7216225 | Haviv et al. | May 2007 | B2 |
7225364 | Carnevale et al. | May 2007 | B2 |
7228412 | Freed et al. | Jun 2007 | B2 |
7308101 | Wing | Dec 2007 | B2 |
7350229 | Lander | Mar 2008 | B1 |
7447220 | Lu et al. | Nov 2008 | B2 |
7529845 | Liu | May 2009 | B2 |
7584301 | Joshi | Sep 2009 | B1 |
7630877 | Brown et al. | Dec 2009 | B2 |
7633955 | Saraiya et al. | Dec 2009 | B1 |
7693991 | Greenlee et al. | Apr 2010 | B2 |
7764678 | Johnson et al. | Jul 2010 | B2 |
7895463 | Bagepalli et al. | Feb 2011 | B2 |
20020049841 | Johnson et al. | Apr 2002 | A1 |
20020065864 | Hartsell et al. | May 2002 | A1 |
20020107971 | Bailey et al. | Aug 2002 | A1 |
20020107989 | Johnson et al. | Aug 2002 | A1 |
20020108059 | Canion et al. | Aug 2002 | A1 |
20020129271 | Stanaway, Jr. et al. | Sep 2002 | A1 |
20020199006 | Magnussen et al. | Dec 2002 | A1 |
20030005073 | Yoshizawa et al. | Jan 2003 | A1 |
20030043794 | Cayton et al. | Mar 2003 | A1 |
20030097454 | Yamakawa et al. | May 2003 | A1 |
20030097518 | Kohn et al. | May 2003 | A1 |
20030105830 | Pham et al. | Jun 2003 | A1 |
20030236745 | Hartsell et al. | Dec 2003 | A1 |
20040010545 | Pandya | Jan 2004 | A1 |
20040010612 | Pandya | Jan 2004 | A1 |
20040030757 | Pandya | Feb 2004 | A1 |
20040030770 | Pandya | Feb 2004 | A1 |
20040030806 | Pandya | Feb 2004 | A1 |
20040037299 | Pandya | Feb 2004 | A1 |
20040037319 | Pandya | Feb 2004 | A1 |
20040107383 | Bouchier et al. | Jun 2004 | A1 |
20040128538 | Gmuender et al. | Jul 2004 | A1 |
20040139319 | Favazza et al. | Jul 2004 | A1 |
20040165588 | Pandya | Aug 2004 | A1 |
20040210320 | Pandya | Oct 2004 | A1 |
20040213284 | Clarke et al. | Oct 2004 | A1 |
20050033880 | Lin | Feb 2005 | A1 |
20050060414 | Phillips et al. | Mar 2005 | A1 |
20050076166 | Shearer | Apr 2005 | A1 |
20050108518 | Pandya | May 2005 | A1 |
20050147039 | Biran et al. | Jul 2005 | A1 |
20050188212 | Laferriere et al. | Aug 2005 | A1 |
20050238035 | Riley | Oct 2005 | A1 |
20050286513 | King | Dec 2005 | A1 |
20060031506 | Redgate | Feb 2006 | A1 |
20060045099 | Chang et al. | Mar 2006 | A1 |
20060047771 | Blackmore et al. | Mar 2006 | A1 |
20060067346 | Tucker et al. | Mar 2006 | A1 |
20060069668 | Braddy et al. | Mar 2006 | A1 |
20060070131 | Braddy et al. | Mar 2006 | A1 |
20060074837 | Braddy et al. | Apr 2006 | A1 |
20060075057 | Gildea et al. | Apr 2006 | A1 |
20060075114 | Panasyuk et al. | Apr 2006 | A1 |
20060075132 | Liu | Apr 2006 | A1 |
20060075463 | Braddy et al. | Apr 2006 | A1 |
20060087989 | Gai et al. | Apr 2006 | A1 |
20060095334 | Simmons | May 2006 | A1 |
20060101225 | Aloni et al. | May 2006 | A1 |
20060123481 | Bhatnagar et al. | Jun 2006 | A1 |
20060136570 | Pandya | Jun 2006 | A1 |
20060168274 | Alone et al. | Jul 2006 | A1 |
20060174104 | Crichton et al. | Aug 2006 | A1 |
20060200477 | Barrenechea | Sep 2006 | A1 |
20060230119 | Hausauer et al. | Oct 2006 | A1 |
20060233101 | Luft et al. | Oct 2006 | A1 |
20060236063 | Hausauer et al. | Oct 2006 | A1 |
20060236385 | Innes et al. | Oct 2006 | A1 |
20060253894 | Bookman et al. | Nov 2006 | A1 |
20060259661 | Feng et al. | Nov 2006 | A1 |
20060262782 | Biran et al. | Nov 2006 | A1 |
20060262796 | Biran et al. | Nov 2006 | A1 |
20060262797 | Biran et al. | Nov 2006 | A1 |
20060262799 | Biran et al. | Nov 2006 | A1 |
20060268866 | Lok | Nov 2006 | A1 |
20060291803 | Watson et al. | Dec 2006 | A1 |
20070002769 | Matityahu et al. | Jan 2007 | A1 |
20070005801 | Kumar et al. | Jan 2007 | A1 |
20070067638 | Haibl et al. | Mar 2007 | A1 |
20070073966 | Corbin | Mar 2007 | A1 |
20070121615 | Weill et al. | May 2007 | A1 |
20070130167 | Day et al. | Jun 2007 | A1 |
20070153798 | Krstulich | Jul 2007 | A1 |
20070160072 | Thalanany et al. | Jul 2007 | A1 |
20070160073 | Toumura et al. | Jul 2007 | A1 |
20070165672 | Keels et al. | Jul 2007 | A1 |
20070174429 | Mazzaferri et al. | Jul 2007 | A1 |
20070226750 | Sharp et al. | Sep 2007 | A1 |
20090063701 | Bagepalli et al. | Mar 2009 | A1 |
Number | Date | Country |
---|---|---|
WO 03104943 | Dec 2003 | WO |
WO 2005081855 | Sep 2005 | WO |
WO 2005104443 | Nov 2005 | WO |
WO 2006031496 | Mar 2006 | WO |
WO 2006113722 | Oct 2006 | WO |
Number | Date | Country | |
---|---|---|---|
20090063625 A1 | Mar 2009 | US |
Number | Date | Country | |
---|---|---|---|
60966649 | Aug 2007 | US |