This technology generally relates to methods and devices for network traffic management and, more particularly, to methods for switching network packets based on packet data and devices thereof. BACKGROUND
Computer networks may often experience a high volume of network traffic from across a variety of network devices and from a variety of user devices. The high volume of network traffic also translates to high volume of network packets flowing across computer networks.
In order to process these high volume network packets, prior technologies have required a processor or multiple processors within a proxy device to receive the network packets, scan the network packets, and take necessary network actions, such as routing the packets or dropping the packets, based on the scan. In particular, with respect to scanning the network packets so that the necessary action can be taken, prior technologies have required a processor within the network proxy device to identify tags in the packets that represent the client or the type of the service requested. The identified tags are then translated by the processor into necessary network actions. Unfortunately, the implementation of this process has required a large collection of hardware devices which is costly and technologically difficult to effectively manage.
A method for managing network packets includes separating header data and payload data from each of a plurality of received network packets. Next, digest data is created from the separated header data for each of the plurality of network packets. One or more network actions are identified for each of the plurality of network packets based on the corresponding created digest data. The identified one or more network actions are performed on the separated header data and the payload data.
A non-transitory computer readable medium having stored thereon instructions for managing network packets comprising machine executable code which when executed by at least one processor, causes the processor to separate header data and payload data from each of a plurality of received network packets. Next, digest data is created from the separated header data for each of the plurality of network packets. One or more network actions are identified for each of the plurality of network packets based on the corresponding created digest data. The identified one or more network actions are performed on the separated header data and the payload data.
A network traffic management apparatus including at least one of configurable hardware logic configured to be capable of implementing or a processor coupled to a memory and configured to execute programmed instructions stored in the memory to separate header data and payload data from each of a plurality of received network packets. Next, digest data is created from the separated header data for each of the plurality of network packets. One or more network actions are identified for each of the plurality of network packets based on the corresponding created digest data. The identified one or more network actions are performed on the separated header data and the payload data.
A network traffic management system, comprising one or more traffic management apparatuses, client devices, or server devices, the network traffic management system comprising memory comprising programmed instructions stored thereon and one or more processors configured to be capable of executing the stored programmed instructions to separate header data and payload data from each of a plurality of received network packets. Next, digest data is created from the separated header data for each of the plurality of network packets. One or more network actions are identified for each of the plurality of network packets based on the corresponding created digest data. The identified one or more network actions are performed on the separated header data and the payload data.
This technology provides a number of advantages including providing methods, non-transitory computer readable media, apparatuses, and systems that assist with service switching network packets based on packet data. By using the technique illustrated above, examples of the disclosed technology are able to process a higher number of received packets with a field programmable gate array (FPGA) configured to create the digest data from the network packets and then a processor is able to execute programmed instruction to perform one or more network actions based on the created digest data. Accordingly, network actions, such as routing, load balancing, policing, encrypting, and decrypting by way of example, are performed much more efficiently by dividing the decision making process between the FPGA and the processor. By dividing the processing between the FPGA and the processor, the disclosed technology is able efficiently utilize the operation of fast low level logic (such as a FPGA) and slower higher intelligence device (such as a processor) to manage network traffic effectively.
An example of a network environment 10 which incorporates a network traffic management system for switching network packets based on packet data with the network traffic manager apparatus 14 is illustrated in
Referring more specifically to
The network traffic manager apparatus 14 assists with switching network packets based on packet data as illustrated and described by way of the examples herein, although the network traffic manager apparatus 14 may perform other types and/or numbers of functions. As illustrated in
The plurality of processors 18(1)-18(n) within the network traffic manager apparatus 14 may execute one or more computer-executable instructions stored in memory 20 for the methods illustrated and described with reference to the examples herein, although the processor can execute other types and numbers of instructions and perform other types and numbers of operations. The plurality of processors 18(1)-18(n) may comprise one or more central processing units (“CPUs”) or general purpose processors with one or more processing cores, such as AMD® processor(s), although other types of processor(s) could be used (e.g., Intel®).
The memory 20 within the network traffic manager apparatus 14 may comprise one or more tangible storage media, such as RAM, ROM, flash memory, CD-ROM, floppy disk, hard disk drive(s), solid state memory, DVD, or any other memory storage types or devices, including combinations thereof, which are known to those of ordinary skill in the art. The memory 20 may store one or more non-transitory computer-readable instructions of this technology as illustrated and described with reference to the examples herein that may be executed by the plurality of processors 18(1)-18(n). The exemplary flowchart shown in
Accordingly, the memory 20 of the network traffic manager apparatus 14 can store one or more applications that can include computer executable instructions that, when executed by the network traffic manager apparatus 14, causes the network traffic manager apparatus 14 to perform actions, such as to transmit, receive, or otherwise process messages, for example, and to perform other actions described and illustrated below with reference to
The optional configurable hardware logic device 21 in the network traffic manager apparatus 14 may comprise specialized hardware configured to implement one or more steps of this technology as illustrated and described with reference to the examples herein. By way of example only, the optional configurable logic hardware device 21 may comprise one or more of field programmable gate arrays (“FPGAs”), field programmable logic devices (“FPLDs”), application specific integrated circuits (ASICs”) and/or programmable logic units (“PLUs”).
The communication system 24 in the network traffic manager apparatus 14 is used to operatively couple and communicate between the network traffic manager apparatus 14, the plurality of client computing devices 12(1)-12(n), and the plurality of servers 16(1)-16(n) which are all coupled together by communication network 30 such as one or more local area networks (LAN) and/or the wide area network (WAN), although other types and numbers of communication networks or systems with other types and numbers of connections and configurations to other devices and elements may be used. By way of example only, the communication network such as local area networks (LAN) and the wide area network (WAN) can use TCP/IP over Ethernet and industry-standard protocols, including NFS, CIFS, SOAP, XML, LDAP, and SNMP, although other types and numbers of communication networks, can be used. In this example, the bus 26 is a PCI Express bus in this example, although other bus types and links may be used.
Each of the plurality of client computing devices 12(1)-12(n) of the network traffic management system 10, include a central processing unit (CPU) or processor, a memory, input/display device interface, configurable logic device and an input/output system or I/O system, which are coupled together by a bus or other link. The plurality of client computing devices 12(1)-12(n), in this example, may run interface applications, such as Web browsers, that may provide an interface to make requests for and send and/or receive data to and/or from the web application servers 16(1)-16(n) via the network traffic manager apparatus 14. Additionally, the plurality of client computing devices 12(1)-12(n) can include any type of computing device that can receive, render, and facilitate user interaction, such as client computers, network computer, mobile computers, mobile phones, virtual machines (including cloud-based computer), or the like. Each of the plurality of client computing devices 12(1)-12(n) utilizes the network traffic manager apparatus 14 to conduct one or more operations with the web application servers 16(1)-16(n), such as to obtain data and/or access the applications from one of the web application servers 16(1)-16(n), by way of example only, although other numbers and/or types of systems could be utilizing these resources and other types and numbers of functions utilizing other types of protocols could be performed.
Each of the plurality of servers 16(1)-16(n) of the network traffic management system include a central processing unit (CPU) or processor, a memory, and a communication system, which are coupled together by a bus or other link, although other numbers and/or types of network devices could be used. Generally, the plurality of servers 16(1)-16(n) process requests for providing access to one or more enterprise web applications received from the plurality of client computing devices 12(1)-12(n), network traffic manager apparatus 14, via the communication network 30 according to the HTTP-based application RFC protocol or the CIF S or NFS protocol in this example, but the principles discussed herein are not limited to this example and can include other application protocols. A series of applications may run on the plurality web application servers 16(1)-16(n) that allows the transmission of applications requested by the plurality of client computing devices 12(1)-12(n), or the network traffic manager apparatus 14. The plurality of servers 16(1)-16(n) may provide data or receive data in response to requests directed toward the respective applications on the plurality of servers 16(1)-16(n) from the plurality of client computing devices 12(1)-12(n) or the network traffic manager apparatus 14. It is to be understood that the plurality of servers 16(1)-16(n) may be hardware or software or may represent a system with multiple external resource servers, which may include internal or external networks. In this example the plurality of servers 16(1)-16(n) may be any version of Microsoft® IIS servers or Apache® servers, although other types of servers may be used.
Although the plurality of servers 16(1)-16(n) are illustrated as single servers, one or more actions of the plurality of servers 16(1)-16(n) may be distributed across one or more distinct network computing devices. Moreover, the plurality of servers 16(1)-16(n) are not limited to a particular configuration. Thus, the plurality of plurality web application servers 16(1)-16(n) may contain a plurality of network computing devices that operate using a master/slave approach, whereby one of the network computing devices of the plurality of servers 16(1)-16(n) operate to manage and/or otherwise coordinate operations of the other network computing devices. The plurality of servers 16(1)-16(n) may operate as a plurality of network computing devices within cluster architecture, a peer-to peer architecture, virtual machines, or within a cloud architecture.
Thus, the technology disclosed herein is not to be construed as being limited to a single environment and other configurations and architectures are also envisaged. For example, the one or more of the plurality of servers 16(1)-16(n) depicted in
While the network traffic manager apparatus 14 is illustrated in this example as including a single device, the network traffic manager apparatus 14 in other examples can include a plurality of devices or blades each with one or more processors each processor with one or more processing cores that implement one or more steps of this technology. In these examples, one or more of the devices can have a dedicated communication interface or memory. Alternatively, one or more of the devices can utilize the memory, communication interface, or other hardware or software components of one or more other communicably coupled of the devices. Additionally, one or more of the devices that together comprise network traffic manager apparatus 14 in other examples can be standalone devices or integrated with one or more other devices or applications, such as one of the plurality of servers 16(1)-16(n) or, the network traffic manager apparatus 14, or applications coupled to the communication network(s), for example. Moreover, one or more of the devices of the network traffic manager apparatus 14 in these examples can be in a same or a different communication network 30 including one or more public, private, or cloud networks, for example.
Although an exemplary network traffic management system 10 with the plurality of client computing devices 12(1)-12(n), the network traffic manager apparatus 14, and the plurality of servers 16(1)-16(n), communication networks 30 are described and illustrated herein, other types and numbers of systems, devices, blades, components, and elements in other topologies can be used. It is to be understood that the systems of the examples described herein are for exemplary purposes, as many variations of the specific hardware and software used to implement the examples are possible, as will be appreciated by those skilled in the relevant art(s).
Further, each of the systems of the examples may be conveniently implemented using one or more general purpose computer systems, microprocessors, digital signal processors, and micro-controllers, programmed according to the teachings of the examples, as described and illustrated herein, and as will be appreciated by those of ordinary skill in the art.
One or more of the components depicted in the network traffic management system, such as the network traffic manager apparatus 14, the plurality of client computing devices 12(1)-12(n), the plurality of servers 16(1)-16(n), for example, may be configured to operate as virtual instances on the same physical machine. In other words, one or more of network traffic manager apparatus 14, the IDP server 13, the plurality of client computing devices 12(1)-12(n), or the plurality of servers 16(1)-16(n) illustrated in
In addition, two or more computing systems or devices can be substituted for any one of the systems or devices in any example. Accordingly, principles and advantages of distributed processing, such as redundancy and replication also can be implemented, as desired, to increase the robustness and performance of the devices and systems of the examples. The examples may also be implemented on computer system(s) that extend across any suitable network using any suitable interface mechanisms and traffic technologies, including by way of example only teletraffic in any suitable form (e.g., voice and modem), wireless traffic media, wireless traffic networks, cellular traffic networks, G3 traffic networks, Public Switched Telephone Network (PSTNs), Packet Data Networks (PDNs), the Internet, intranets, and combinations thereof.
The examples also may be embodied as a non-transitory computer readable medium having instructions stored thereon for one or more aspects of the technology as described and illustrated by way of the examples herein, which when executed by a processor (or configurable hardware), cause the processor to carry out the steps necessary to implement the methods of the examples, as described and illustrated herein.
An example of a method for packet switching based on packet data will now be described with reference to
In step 310, the network traffic manager apparatus 14 separates the header data and the payload data in each of the plurality of received network packets, although the network traffic manager apparatus 14 may separate in other manners in other examples. In this example, the network traffic manager apparatus 14 separates the payload data from the header data and forwards the header data for further processing as will be further explained below. By processing only the header data, the technology disclosed will be able to process the network packets at a higher rate because the header data is smaller in size when compared to the payload data.
In step 315, the network traffic manager apparatus 14 caches the payload data within memory 20, although the network traffic manager apparatus 14 can cache or otherwise store the payload data in other manners and/or at other memory locations. In this example, the network traffic manager apparatus 14 caches the payload data into the SRAM 22 or DRAM 23 within the memory 20 as illustrated in
In step 320, the network traffic manager apparatus 14 creates a digest data from the header data of the received network packet, although the network traffic manager apparatus 14 can create the digest based on other parameters. In this example and as illustrated in
In step 325, the network traffic manager apparatus 14 assigns the digest data for each of the header data to a dedicated processor of the plurality of processors 18(1)-18(n) within the network traffic manager apparatus 14, although the network traffic manager apparatus 14 can assign all the digest data to a shared processor in other examples. In this example, the network traffic manager apparatus 14 selects the dedicated processor from the plurality of processors 18(1)-18(n) based on the contents of the digest data, although the dedicated processor from the plurality of processors 18(1)-18(n) can be selected based on other techniques or parameters such as the received network packets, types of network connections and/or sessions. By assigning the digest data to the dedicated processor, the disclosed technology is able to leave the static decisions, such as creating the digest data to the FPGA, within the network traffic manager apparatus 14 and forward the dynamic decisions to the processor.
Next in step 330, the assigned processor within the network traffic manager apparatus 14 scans the received digest data for a hash value, although the assigned processor within the network traffic manager apparatus 14 can scan the received digest data for other types or amounts of information. In this example, the hash value can be used as an optimization to find information in a secondary or local memory lookup and could be passed with the digest data.
In step 335, the assigned processor within the network traffic manager apparatus 14 identifies the one or more actions to be taken based on the hash value, although the assigned processor within can identify the actions based on many other fields. In this example, the hash value directs the assigned processor within the network traffic manager apparatus 14 to a flow table which includes the one or more actions associated with the hash value or added information (received with the digest data) used to determine the actions. By way of example, as illustrated in
In step 340, the assigned processor within the network traffic manager apparatus 14 performs the identified one or more actions on the header and the payload and the exemplary method ends at step 345. By way of example,
Accordingly, as illustrated and described by way of the examples herein, this technology provides a number of advantages including providing methods, non-transitory computer readable media, devices, and system for network packet switching based on the packet data. By using the technique illustrated above, the disclosed technology is able to process a higher number of received packets by configuring the FPGA to create the digest data from the network packets and by utilizing a processor to perform the one or more network actions based on the created digest data. Accordingly, network actions, such as routing, load balancing, policing, encrypting, or decrypting by way of example, are performed much more efficiently by dividing the processing between the FPGA and the processor. By dividing the processing between the FPGA and the processor, the disclosed technology is able efficiently utilize the operation of fast low level logic (such as a FPGA) and slower higher intelligence device (such as a processor) to manage network traffic effectively.
Having thus described the basic concept of the technology, it will be rather apparent to those skilled in the art that the foregoing detailed disclosure is intended to be presented by way of example only, and is not limiting. Various alterations, improvements, and modifications will occur and are intended to those skilled in the art, though not expressly stated herein. These alterations, improvements, and modifications are intended to be suggested hereby, and are within the spirit and scope of the technology. Additionally, the recited order of processing elements or sequences, or the use of numbers, letters, or other designations therefore, is not intended to limit the claimed processes to any order except as may be specified in the claims. Accordingly, the technology is limited only by the following claims and equivalents thereto.
This application claims the benefit of U.S. Provisional Patent Application Ser. No. 62/738,590, filed Sep. 28, 2018, which is hereby incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
289142 | Righter | Nov 1883 | A |
782417 | Robb | Feb 1905 | A |
4993030 | Krakauer et al. | Feb 1991 | A |
5218695 | Noveck et al. | Jun 1993 | A |
5282201 | Frank et al. | Jan 1994 | A |
5303368 | Kotaki | Apr 1994 | A |
5473362 | Fitzgerald et al. | Dec 1995 | A |
5511177 | Kagimasa et al. | Apr 1996 | A |
5537585 | Blickenstaff et al. | Jul 1996 | A |
5548724 | Akizawa et al. | Aug 1996 | A |
5550816 | Hardwick et al. | Aug 1996 | A |
5550965 | Gabbe et al. | Aug 1996 | A |
5583995 | Gardner et al. | Dec 1996 | A |
5586260 | Hu | Dec 1996 | A |
5590320 | Maxey | Dec 1996 | A |
5606665 | Yang et al. | Feb 1997 | A |
5623490 | Richter et al. | Apr 1997 | A |
5649194 | Miller et al. | Jul 1997 | A |
5649200 | Leblang et al. | Jul 1997 | A |
5668943 | Attanasio et al. | Sep 1997 | A |
5692180 | Lee | Nov 1997 | A |
5721779 | Funk | Feb 1998 | A |
5724512 | Winterbottom | Mar 1998 | A |
5806061 | Chaudhuri et al. | Sep 1998 | A |
5832496 | Anand et al. | Nov 1998 | A |
5832522 | Blickenstaff et al. | Nov 1998 | A |
5838970 | Thomas | Nov 1998 | A |
5862325 | Reed et al. | Jan 1999 | A |
5884303 | Brown | Mar 1999 | A |
5893086 | Schmuck et al. | Apr 1999 | A |
5897638 | Lasser et al. | Apr 1999 | A |
5905990 | Inglett | May 1999 | A |
5917998 | Cabrera et al. | Jun 1999 | A |
5920873 | Van Huben et al. | Jul 1999 | A |
5926816 | Bauer et al. | Jul 1999 | A |
5937406 | Balabine et al. | Aug 1999 | A |
5991302 | Berl et al. | Nov 1999 | A |
5995491 | Richter et al. | Nov 1999 | A |
5999664 | Mahoney et al. | Dec 1999 | A |
6012083 | Savitzky et al. | Jan 2000 | A |
6026500 | Topff et al. | Feb 2000 | A |
6029168 | Frey | Feb 2000 | A |
6029175 | Chow et al. | Feb 2000 | A |
6041365 | Kleinerman | Mar 2000 | A |
6044367 | Wolff | Mar 2000 | A |
6047129 | Frye | Apr 2000 | A |
6047356 | Anderson et al. | Apr 2000 | A |
6067558 | Wendt et al. | May 2000 | A |
6072942 | Stockwell et al. | Jun 2000 | A |
6078929 | Rao | Jun 2000 | A |
6085234 | Pitts et al. | Jul 2000 | A |
6088694 | Burns et al. | Jul 2000 | A |
6104706 | Richter et al. | Aug 2000 | A |
6128627 | Mattis et al. | Oct 2000 | A |
6128717 | Harrison et al. | Oct 2000 | A |
6154777 | Ebrahim | Nov 2000 | A |
6157950 | Krishnan | Dec 2000 | A |
6161145 | Bainbridge et al. | Dec 2000 | A |
6161185 | Guthrie et al. | Dec 2000 | A |
6181336 | Chiu et al. | Jan 2001 | B1 |
6202156 | Kalajan | Mar 2001 | B1 |
6223206 | Dan et al. | Apr 2001 | B1 |
6233648 | Tomita | May 2001 | B1 |
6237008 | Beal et al. | May 2001 | B1 |
6256031 | Meijer et al. | Jul 2001 | B1 |
6259405 | Stewart et al. | Jul 2001 | B1 |
6260070 | Shah | Jul 2001 | B1 |
6282610 | Bergsten | Aug 2001 | B1 |
6289345 | Yasue | Sep 2001 | B1 |
6292832 | Shah et al. | Sep 2001 | B1 |
6304913 | Rune | Oct 2001 | B1 |
6308162 | Ouimet et al. | Oct 2001 | B1 |
6324581 | Xu et al. | Nov 2001 | B1 |
6329985 | Tamer et al. | Dec 2001 | B1 |
6330226 | Chapman et al. | Dec 2001 | B1 |
6330574 | Murashita | Dec 2001 | B1 |
6338082 | Schneider | Jan 2002 | B1 |
6339785 | Feigenbaum | Jan 2002 | B1 |
6349343 | Foody et al. | Feb 2002 | B1 |
6353848 | Morris | Mar 2002 | B1 |
6363056 | Beigi et al. | Mar 2002 | B1 |
6370527 | Singhal | Apr 2002 | B1 |
6370543 | Hoffert et al. | Apr 2002 | B2 |
6374263 | Bunger et al. | Apr 2002 | B1 |
6389433 | Bolosky et al. | May 2002 | B1 |
6389462 | Cohen et al. | May 2002 | B1 |
6393581 | Friedman et al. | May 2002 | B1 |
6397246 | Wolfe | May 2002 | B1 |
6412004 | Chen et al. | Jun 2002 | B1 |
6438595 | Blumenau et al. | Aug 2002 | B1 |
6446108 | Rosenberg et al. | Sep 2002 | B1 |
6466580 | Leung | Oct 2002 | B1 |
6469983 | Narayana et al. | Oct 2002 | B2 |
6477544 | Bolosky et al. | Nov 2002 | B1 |
6487561 | Ofek et al. | Nov 2002 | B1 |
6493804 | Soltis et al. | Dec 2002 | B1 |
6513061 | Ebata et al. | Jan 2003 | B1 |
6928518 | Talagala | Aug 2005 | B2 |
6934706 | Mancuso et al. | Aug 2005 | B1 |
6938039 | Alexander et al. | Aug 2005 | B1 |
6938059 | Tamer et al. | Aug 2005 | B2 |
6959373 | Testardi | Oct 2005 | B2 |
6961815 | Kistler et al. | Nov 2005 | B2 |
6970475 | Fraser et al. | Nov 2005 | B1 |
6970924 | Chu et al. | Nov 2005 | B1 |
6973455 | Vahalia et al. | Dec 2005 | B1 |
6973490 | Robertson et al. | Dec 2005 | B1 |
6973549 | Testardi | Dec 2005 | B1 |
6975592 | Seddigh et al. | Dec 2005 | B1 |
6985936 | Agarwalla et al. | Jan 2006 | B2 |
6985956 | Luke et al. | Jan 2006 | B2 |
6986015 | Testardi | Jan 2006 | B2 |
6990074 | Wan et al. | Jan 2006 | B2 |
6990114 | Erimli et al. | Jan 2006 | B1 |
6990547 | Ulrich et al. | Jan 2006 | B2 |
6990667 | Ulrich et al. | Jan 2006 | B2 |
6996841 | Kadyk et al. | Feb 2006 | B2 |
6999912 | Loisey et al. | Feb 2006 | B2 |
7003533 | Noguchi et al. | Feb 2006 | B2 |
7003564 | Greuel et al. | Feb 2006 | B2 |
7006981 | Rose et al. | Feb 2006 | B2 |
7010553 | Chen et al. | Mar 2006 | B2 |
7013379 | Testardi | Mar 2006 | B1 |
7020644 | Jameson | Mar 2006 | B2 |
7020669 | Mccann et al. | Mar 2006 | B2 |
7023974 | Brannam et al. | Apr 2006 | B1 |
7024427 | Bobbitt et al. | Apr 2006 | B2 |
7035212 | Mittal et al. | Apr 2006 | B1 |
7039061 | Connor et al. | May 2006 | B2 |
7051112 | Dawson | May 2006 | B2 |
7054998 | Arnott et al. | May 2006 | B2 |
7055010 | Lin et al. | May 2006 | B2 |
7065482 | Shorey et al. | Jun 2006 | B2 |
7072917 | Wong et al. | Jul 2006 | B2 |
7075924 | Richter et al. | Jul 2006 | B2 |
7076689 | Atkinson | Jul 2006 | B2 |
7080314 | Garofalakis et al. | Jul 2006 | B1 |
7089286 | Malik | Aug 2006 | B1 |
7089491 | Feinberg et al. | Aug 2006 | B2 |
7111115 | Peters et al. | Sep 2006 | B2 |
7113962 | Kee et al. | Sep 2006 | B1 |
7113996 | Kronenberg | Sep 2006 | B2 |
7120728 | Krakirian et al. | Oct 2006 | B2 |
7120746 | Campbell et al. | Oct 2006 | B2 |
7127556 | Blumenau et al. | Oct 2006 | B2 |
7133863 | Teng et al. | Nov 2006 | B2 |
7133967 | Fujie et al. | Nov 2006 | B2 |
7143146 | Nakatani et al. | Nov 2006 | B2 |
7146524 | Patel et al. | Dec 2006 | B2 |
7152184 | Maeda et al. | Dec 2006 | B2 |
7155466 | Rodriguez et al. | Dec 2006 | B2 |
7165095 | Sim | Jan 2007 | B2 |
7167821 | Hardwick et al. | Jan 2007 | B2 |
7171469 | Ackaouy et al. | Jan 2007 | B2 |
7173929 | Testardi | Feb 2007 | B1 |
7181523 | Sim | Feb 2007 | B2 |
7191163 | Herrera et al. | Mar 2007 | B2 |
7194579 | Robinson et al. | Mar 2007 | B2 |
7228359 | Monteiro | Jun 2007 | B1 |
7234074 | Cohn et al. | Jun 2007 | B2 |
7236491 | Tsao et al. | Jun 2007 | B2 |
7240100 | Wein et al. | Jul 2007 | B1 |
7243089 | Becker-Szendy et al. | Jul 2007 | B2 |
7243094 | Tabellion et al. | Jul 2007 | B2 |
7263610 | Parker et al. | Aug 2007 | B2 |
7269168 | Roy et al. | Sep 2007 | B2 |
7269582 | Winter et al. | Sep 2007 | B2 |
7272613 | Sim et al. | Sep 2007 | B2 |
7280536 | Testardi | Oct 2007 | B2 |
7284150 | Ma et al. | Oct 2007 | B2 |
7292541 | C S | Nov 2007 | B1 |
7293097 | Borr | Nov 2007 | B2 |
7293099 | Kalajan | Nov 2007 | B1 |
7293133 | Colgrove et al. | Nov 2007 | B1 |
7296263 | Jacob | Nov 2007 | B1 |
7299250 | Douceur et al. | Nov 2007 | B2 |
7308475 | Pruitt et al. | Dec 2007 | B1 |
7324533 | Deliberato et al. | Jan 2008 | B1 |
7330486 | Ko et al. | Feb 2008 | B2 |
7340571 | Saze | Mar 2008 | B2 |
7343398 | Lownsbrough | Mar 2008 | B1 |
7346664 | Wong et al. | Mar 2008 | B2 |
7373438 | Debergalis et al. | May 2008 | B1 |
7383288 | Miloushev et al. | Jun 2008 | B2 |
7401220 | Bolosky et al. | Jul 2008 | B2 |
7406484 | Srinivasan et al. | Jul 2008 | B1 |
7409440 | Jacob | Aug 2008 | B1 |
7415488 | Muth et al. | Aug 2008 | B1 |
7415608 | Bolosky et al. | Aug 2008 | B2 |
7418439 | Wong | Aug 2008 | B2 |
7437358 | Arrouye et al. | Oct 2008 | B2 |
7440982 | Lu et al. | Oct 2008 | B2 |
7457982 | Rajan | Nov 2008 | B2 |
7467158 | Marinescu | Dec 2008 | B2 |
7475241 | Patel et al. | Jan 2009 | B2 |
7477796 | Atsumi et al. | Jan 2009 | B2 |
7509322 | Miloushev et al. | Mar 2009 | B2 |
7512673 | Miloushev et al. | Mar 2009 | B2 |
7519813 | Cox et al. | Apr 2009 | B1 |
7532577 | Park et al. | May 2009 | B2 |
7562110 | Miloushev et al. | Jul 2009 | B2 |
7571168 | Bahar et al. | Aug 2009 | B2 |
7574433 | Engel | Aug 2009 | B2 |
7577723 | Matsuda et al. | Aug 2009 | B2 |
7587471 | Ebata et al. | Sep 2009 | B2 |
7590747 | Coates et al. | Sep 2009 | B2 |
7599941 | Bahar et al. | Oct 2009 | B2 |
7610307 | Havewala et al. | Oct 2009 | B2 |
7610390 | Yared et al. | Oct 2009 | B2 |
7624109 | Testardi | Nov 2009 | B2 |
7639883 | Gill | Dec 2009 | B2 |
7640347 | Sloat et al. | Dec 2009 | B1 |
7644109 | Manley et al. | Jan 2010 | B2 |
7653699 | Colgrove et al. | Jan 2010 | B1 |
7656788 | Ma et al. | Feb 2010 | B2 |
7684423 | Tripathi et al. | Mar 2010 | B2 |
7685177 | Hagerstrom et al. | Mar 2010 | B1 |
7689596 | Tsunoda | Mar 2010 | B2 |
7694082 | Golding et al. | Apr 2010 | B2 |
7698458 | Liu et al. | Apr 2010 | B1 |
7711771 | Kirnos | May 2010 | B2 |
7734603 | Mcmanis | Jun 2010 | B1 |
7739540 | Akutsu et al. | Jun 2010 | B2 |
7743035 | Chen et al. | Jun 2010 | B2 |
7752294 | Meyer et al. | Jul 2010 | B2 |
7769711 | Srinivasan et al. | Aug 2010 | B2 |
7788335 | Miloushev et al. | Aug 2010 | B2 |
7809691 | Karmarkar et al. | Oct 2010 | B1 |
7822839 | Pruitt et al. | Oct 2010 | B1 |
7822939 | Veprinsky et al. | Oct 2010 | B1 |
7831639 | Panchbudhe et al. | Nov 2010 | B1 |
7849112 | Mane et al. | Dec 2010 | B2 |
7853958 | Mathew et al. | Dec 2010 | B2 |
7861085 | Case et al. | Dec 2010 | B1 |
7870154 | Shitomi et al. | Jan 2011 | B2 |
7877511 | Berger et al. | Jan 2011 | B1 |
7885970 | Lacapra | Feb 2011 | B2 |
7886218 | Watson | Feb 2011 | B2 |
7895653 | Calo et al. | Feb 2011 | B2 |
7900002 | Lyon | Mar 2011 | B2 |
7903554 | Manur et al. | Mar 2011 | B1 |
7904466 | Valencia et al. | Mar 2011 | B1 |
7908245 | Nakano et al. | Mar 2011 | B2 |
7913053 | Newland | Mar 2011 | B1 |
7953085 | Chang et al. | May 2011 | B2 |
7953701 | Okitsu et al. | May 2011 | B2 |
7958222 | Pruitt et al. | Jun 2011 | B1 |
7958347 | Ferguson | Jun 2011 | B1 |
7984500 | Khanna et al. | Jul 2011 | B1 |
8005953 | Miloushev et al. | Aug 2011 | B2 |
8015157 | Kamei et al. | Sep 2011 | B2 |
8024443 | Jacob | Sep 2011 | B1 |
8046547 | Chatterjee et al. | Oct 2011 | B1 |
8055724 | Amegadzie et al. | Nov 2011 | B2 |
8064342 | Badger | Nov 2011 | B2 |
8069225 | Mccanne et al. | Nov 2011 | B2 |
8099758 | Schmeidler et al. | Jan 2012 | B2 |
8103622 | Karinta | Jan 2012 | B1 |
8112392 | Bunnell et al. | Feb 2012 | B1 |
8117244 | Marinov et al. | Feb 2012 | B2 |
8155128 | Balyan et al. | Apr 2012 | B2 |
8171124 | Kondamuru | May 2012 | B2 |
8190769 | Shukla et al. | May 2012 | B1 |
8209403 | Szabo et al. | Jun 2012 | B2 |
8271751 | Hinrichs, Jr. | Sep 2012 | B2 |
8302100 | Deng et al. | Oct 2012 | B2 |
8326798 | Driscoll et al. | Dec 2012 | B1 |
8351600 | Resch | Jan 2013 | B2 |
8396836 | Ferguson et al. | Mar 2013 | B1 |
8463850 | Mccann | Jun 2013 | B1 |
8484348 | Subramanian et al. | Jul 2013 | B2 |
8559313 | Mukerji et al. | Oct 2013 | B1 |
8560693 | Wang et al. | Oct 2013 | B1 |
8601000 | Stefani et al. | Dec 2013 | B1 |
9172756 | Ramachandran | Oct 2015 | B2 |
10376176 | Wabel et al. | Aug 2019 | B2 |
10476809 | Daniel et al. | Nov 2019 | B1 |
10476992 | Amdahl | Nov 2019 | B1 |
10659475 | Lazri et al. | May 2020 | B2 |
10795707 | Hay et al. | Oct 2020 | B2 |
10880265 | Li | Dec 2020 | B1 |
20010003164 | Murakami | Jun 2001 | A1 |
20010007560 | Masuda et al. | Jul 2001 | A1 |
20010047293 | Waller et al. | Nov 2001 | A1 |
20020012352 | Hansson et al. | Jan 2002 | A1 |
20020012382 | Schilling | Jan 2002 | A1 |
20020035537 | Waller et al. | Mar 2002 | A1 |
20020038360 | Andrews et al. | Mar 2002 | A1 |
20020059263 | Shima et al. | May 2002 | A1 |
20020065848 | Walker et al. | May 2002 | A1 |
20020072048 | Slattery et al. | Jun 2002 | A1 |
20020087571 | Stapel et al. | Jul 2002 | A1 |
20020087744 | Kitchin | Jul 2002 | A1 |
20020087887 | Busam et al. | Jul 2002 | A1 |
20020099829 | Richards et al. | Jul 2002 | A1 |
20020099842 | Jennings et al. | Jul 2002 | A1 |
20020103823 | Jackson et al. | Aug 2002 | A1 |
20020106263 | Winker | Aug 2002 | A1 |
20020120727 | Curley et al. | Aug 2002 | A1 |
20020120763 | Miloushev et al. | Aug 2002 | A1 |
20020143819 | Han et al. | Oct 2002 | A1 |
20020143852 | Guo et al. | Oct 2002 | A1 |
20020143892 | Mogul | Oct 2002 | A1 |
20020150253 | Brezak et al. | Oct 2002 | A1 |
20020156905 | Weissman | Oct 2002 | A1 |
20020161911 | Pinckney, III et al. | Oct 2002 | A1 |
20020162118 | Levy et al. | Oct 2002 | A1 |
20020174216 | Shorey et al. | Nov 2002 | A1 |
20020194112 | Depinto et al. | Dec 2002 | A1 |
20020194342 | Lu et al. | Dec 2002 | A1 |
20020198956 | Dunshea et al. | Dec 2002 | A1 |
20030005172 | Chessell | Jan 2003 | A1 |
20030009528 | Sharif et al. | Jan 2003 | A1 |
20030012382 | Ferchichi et al. | Jan 2003 | A1 |
20030018450 | Carley | Jan 2003 | A1 |
20030018585 | Butler et al. | Jan 2003 | A1 |
20030028514 | Lord et al. | Feb 2003 | A1 |
20030033308 | Patel et al. | Feb 2003 | A1 |
20030033535 | Fisher et al. | Feb 2003 | A1 |
20030034905 | Anton et al. | Feb 2003 | A1 |
20030051045 | Connor | Mar 2003 | A1 |
20030055723 | English | Mar 2003 | A1 |
20030065956 | Belapurkar et al. | Apr 2003 | A1 |
20030074301 | Solomon | Apr 2003 | A1 |
20030105846 | Zhao et al. | Jun 2003 | A1 |
20030108000 | Chaney et al. | Jun 2003 | A1 |
20030108002 | Chaney et al. | Jun 2003 | A1 |
20030128708 | Inoue et al. | Jul 2003 | A1 |
20030130945 | Force et al. | Jul 2003 | A1 |
20030139934 | Mandera | Jul 2003 | A1 |
20030156586 | Lee et al. | Aug 2003 | A1 |
20030159072 | Bellinger et al. | Aug 2003 | A1 |
20030171978 | Jenkins et al. | Sep 2003 | A1 |
20030177364 | Walsh et al. | Sep 2003 | A1 |
20030177388 | Botz et al. | Sep 2003 | A1 |
20030179755 | Fraser | Sep 2003 | A1 |
20030189936 | Terrell et al. | Oct 2003 | A1 |
20030191812 | Agarwalla et al. | Oct 2003 | A1 |
20030195813 | Pallister et al. | Oct 2003 | A1 |
20030195962 | Kikuchi et al. | Oct 2003 | A1 |
20030200207 | Dickinson | Oct 2003 | A1 |
20030204635 | Ko et al. | Oct 2003 | A1 |
20030212954 | Patrudu | Nov 2003 | A1 |
20030220835 | Barnes, Jr. | Nov 2003 | A1 |
20030229665 | Ryman | Dec 2003 | A1 |
20030236995 | Fretwell, Jr. | Dec 2003 | A1 |
20040003266 | Gordon et al. | Jan 2004 | A1 |
20040006575 | Visharam et al. | Jan 2004 | A1 |
20040006591 | Matsui et al. | Jan 2004 | A1 |
20040010654 | Kawamoto et al. | Jan 2004 | A1 |
20040015783 | Lennon et al. | Jan 2004 | A1 |
20040017825 | Stanwood et al. | Jan 2004 | A1 |
20040028043 | Maveli et al. | Feb 2004 | A1 |
20040030627 | Sedukhin | Feb 2004 | A1 |
20040030740 | Stelting | Feb 2004 | A1 |
20040030857 | Krakirian et al. | Feb 2004 | A1 |
20040043758 | Sorvari et al. | Mar 2004 | A1 |
20040044705 | Stager et al. | Mar 2004 | A1 |
20040054748 | Ackaouy et al. | Mar 2004 | A1 |
20040059789 | Shum | Mar 2004 | A1 |
20040064544 | Barsness et al. | Apr 2004 | A1 |
20040064554 | Kuno et al. | Apr 2004 | A1 |
20040093361 | Therrien et al. | May 2004 | A1 |
20040098595 | Aupperle et al. | May 2004 | A1 |
20040122926 | Moore et al. | Jun 2004 | A1 |
20040123277 | Schrader et al. | Jun 2004 | A1 |
20040133577 | Nickolov et al. | Jul 2004 | A1 |
20040133605 | Chang et al. | Jul 2004 | A1 |
20040133606 | Miloushev et al. | Jul 2004 | A1 |
20040138858 | Carley | Jul 2004 | A1 |
20040139355 | Axel et al. | Jul 2004 | A1 |
20040148380 | Meyer et al. | Jul 2004 | A1 |
20040153479 | Mikesell et al. | Aug 2004 | A1 |
20040167967 | Bastian et al. | Aug 2004 | A1 |
20040199547 | Winter et al. | Oct 2004 | A1 |
20040213156 | Smallwood et al. | Oct 2004 | A1 |
20040215665 | Edgar et al. | Oct 2004 | A1 |
20040236798 | Srinivasan et al. | Nov 2004 | A1 |
20040236826 | Harville et al. | Nov 2004 | A1 |
20050008017 | Datta et al. | Jan 2005 | A1 |
20050021703 | Cherry et al. | Jan 2005 | A1 |
20050027841 | Rolfe | Feb 2005 | A1 |
20050027862 | Nguyen et al. | Feb 2005 | A1 |
20050044158 | Malik | Feb 2005 | A1 |
20050050107 | Mane et al. | Mar 2005 | A1 |
20050091214 | Probert et al. | Apr 2005 | A1 |
20050108575 | Yung | May 2005 | A1 |
20050114701 | Atkins et al. | May 2005 | A1 |
20050117589 | Douady et al. | Jun 2005 | A1 |
20050160161 | Barrett et al. | Jul 2005 | A1 |
20050165656 | Frederick et al. | Jul 2005 | A1 |
20050174944 | Legault et al. | Aug 2005 | A1 |
20050175013 | Le Pennec et al. | Aug 2005 | A1 |
20050180419 | Park et al. | Aug 2005 | A1 |
20050187866 | Lee | Aug 2005 | A1 |
20050198234 | Leib et al. | Sep 2005 | A1 |
20050198501 | Andreev et al. | Sep 2005 | A1 |
20050213587 | Cho et al. | Sep 2005 | A1 |
20050234928 | Shkvarchuk et al. | Oct 2005 | A1 |
20050240664 | Chen et al. | Oct 2005 | A1 |
20050246393 | Coates et al. | Nov 2005 | A1 |
20050256806 | Tien et al. | Nov 2005 | A1 |
20050273456 | Revanuru et al. | Dec 2005 | A1 |
20050289111 | Tribble et al. | Dec 2005 | A1 |
20060010502 | Mimatsu et al. | Jan 2006 | A1 |
20060031374 | Lu et al. | Feb 2006 | A1 |
20060031778 | Goodwin et al. | Feb 2006 | A1 |
20060045089 | Bacher et al. | Mar 2006 | A1 |
20060045096 | Farmer et al. | Mar 2006 | A1 |
20060047785 | Wang et al. | Mar 2006 | A1 |
20060074922 | Nishimura | Apr 2006 | A1 |
20060075475 | Boulos et al. | Apr 2006 | A1 |
20060080353 | Miloushev et al. | Apr 2006 | A1 |
20060100752 | Kim et al. | May 2006 | A1 |
20060106882 | Douceur et al. | May 2006 | A1 |
20060112367 | Harris | May 2006 | A1 |
20060123062 | Bobbitt et al. | Jun 2006 | A1 |
20060123210 | Pritchett et al. | Jun 2006 | A1 |
20060130133 | Andreev et al. | Jun 2006 | A1 |
20060140193 | Kakani et al. | Jun 2006 | A1 |
20060153201 | Hepper et al. | Jul 2006 | A1 |
20060167838 | Lacapra | Jul 2006 | A1 |
20060184589 | Lees et al. | Aug 2006 | A1 |
20060198300 | Li et al. | Sep 2006 | A1 |
20060200470 | Lacapra et al. | Sep 2006 | A1 |
20060224636 | Kathuria et al. | Oct 2006 | A1 |
20060224687 | Popkin et al. | Oct 2006 | A1 |
20060230265 | Krishna | Oct 2006 | A1 |
20060235998 | Stecher et al. | Oct 2006 | A1 |
20060259320 | Lasalle et al. | Nov 2006 | A1 |
20060268692 | Wright et al. | Nov 2006 | A1 |
20060270341 | Kim et al. | Nov 2006 | A1 |
20060271598 | Wong et al. | Nov 2006 | A1 |
20060277225 | Mark et al. | Dec 2006 | A1 |
20060282442 | Lennon et al. | Dec 2006 | A1 |
20060282461 | Marinescu | Dec 2006 | A1 |
20060282471 | Mark et al. | Dec 2006 | A1 |
20070005807 | Wong | Jan 2007 | A1 |
20070016613 | Foresti et al. | Jan 2007 | A1 |
20070024919 | Wong et al. | Feb 2007 | A1 |
20070027929 | Whelan | Feb 2007 | A1 |
20070027935 | Haselton et al. | Feb 2007 | A1 |
20070028068 | Golding et al. | Feb 2007 | A1 |
20070038994 | Davis et al. | Feb 2007 | A1 |
20070061441 | Landis et al. | Mar 2007 | A1 |
20070088702 | Fridella et al. | Apr 2007 | A1 |
20070112775 | Ackerman | May 2007 | A1 |
20070124415 | Ev-Ran et al. | May 2007 | A1 |
20070124502 | Li | May 2007 | A1 |
20070130255 | Wolovitz et al. | Jun 2007 | A1 |
20070136308 | Tsirigotis et al. | Jun 2007 | A1 |
20070139227 | Speirs et al. | Jun 2007 | A1 |
20070147258 | Mottishaw | Jun 2007 | A1 |
20070162891 | Burner et al. | Jul 2007 | A1 |
20070168320 | Borthakur et al. | Jul 2007 | A1 |
20070180314 | Kawashima et al. | Aug 2007 | A1 |
20070208748 | Li | Sep 2007 | A1 |
20070209075 | Coffman | Sep 2007 | A1 |
20070233826 | Tindal et al. | Oct 2007 | A1 |
20070250560 | Wein et al. | Oct 2007 | A1 |
20080004022 | Johannesson et al. | Jan 2008 | A1 |
20080010372 | Khedouri et al. | Jan 2008 | A1 |
20080022059 | Zimmerer et al. | Jan 2008 | A1 |
20080046432 | Anderson et al. | Feb 2008 | A1 |
20080070575 | Claussen et al. | Mar 2008 | A1 |
20080114718 | Anderson et al. | May 2008 | A1 |
20080183888 | Brown et al. | Jul 2008 | A1 |
20080189468 | Schmidt et al. | Aug 2008 | A1 |
20080208917 | Smoot et al. | Aug 2008 | A1 |
20080208933 | Lyon | Aug 2008 | A1 |
20080209073 | Tang | Aug 2008 | A1 |
20080215836 | Sutoh et al. | Sep 2008 | A1 |
20080222223 | Srinivasan et al. | Sep 2008 | A1 |
20080243769 | Arbour et al. | Oct 2008 | A1 |
20080263401 | Stenzel | Oct 2008 | A1 |
20080270578 | Zhang et al. | Oct 2008 | A1 |
20080281908 | Mccanne et al. | Nov 2008 | A1 |
20080282047 | Arakawa et al. | Nov 2008 | A1 |
20080294446 | Guo et al. | Nov 2008 | A1 |
20080298233 | Arora et al. | Dec 2008 | A1 |
20090007162 | Sheehan | Jan 2009 | A1 |
20090019535 | Mishra et al. | Jan 2009 | A1 |
20090037975 | Ishikawa et al. | Feb 2009 | A1 |
20090041230 | Williams | Feb 2009 | A1 |
20090055507 | Oeda | Feb 2009 | A1 |
20090055607 | Schack et al. | Feb 2009 | A1 |
20090077097 | Lacapra et al. | Mar 2009 | A1 |
20090080440 | Balyan et al. | Mar 2009 | A1 |
20090089344 | Brown et al. | Apr 2009 | A1 |
20090094252 | Wong et al. | Apr 2009 | A1 |
20090094311 | Awadallah et al. | Apr 2009 | A1 |
20090106255 | Lacapra et al. | Apr 2009 | A1 |
20090106263 | Khalid et al. | Apr 2009 | A1 |
20090106413 | Salo et al. | Apr 2009 | A1 |
20090125955 | Delorme | May 2009 | A1 |
20090132616 | Winter et al. | May 2009 | A1 |
20090138314 | Bruce | May 2009 | A1 |
20090161542 | Ho | Jun 2009 | A1 |
20090180477 | Akahane | Jul 2009 | A1 |
20090185497 | Arora et al. | Jul 2009 | A1 |
20090187915 | Chew et al. | Jul 2009 | A1 |
20090204649 | Wong et al. | Aug 2009 | A1 |
20090204650 | Wong et al. | Aug 2009 | A1 |
20090204705 | Marinov et al. | Aug 2009 | A1 |
20090210431 | Marinkovic et al. | Aug 2009 | A1 |
20090217163 | Jaroker | Aug 2009 | A1 |
20090217386 | Schneider | Aug 2009 | A1 |
20090240705 | Miloushev et al. | Sep 2009 | A1 |
20090240899 | Akagawa et al. | Sep 2009 | A1 |
20090241176 | Beletski et al. | Sep 2009 | A1 |
20090265396 | Ram et al. | Oct 2009 | A1 |
20090265467 | Peles | Oct 2009 | A1 |
20090292957 | Bower et al. | Nov 2009 | A1 |
20090300161 | Pruitt et al. | Dec 2009 | A1 |
20090316708 | Yahyaoui et al. | Dec 2009 | A1 |
20090319600 | Sedan et al. | Dec 2009 | A1 |
20100017643 | Baba et al. | Jan 2010 | A1 |
20100042743 | Jeon et al. | Feb 2010 | A1 |
20100061232 | Zhou et al. | Mar 2010 | A1 |
20100064001 | Daily | Mar 2010 | A1 |
20100070476 | O'Keefe et al. | Mar 2010 | A1 |
20100082542 | Feng et al. | Apr 2010 | A1 |
20100093318 | Zhu et al. | Apr 2010 | A1 |
20100103819 | Samuels et al. | Apr 2010 | A1 |
20100131654 | Malakapalli et al. | May 2010 | A1 |
20100179984 | Sebastian | Jul 2010 | A1 |
20100205206 | Rabines et al. | Aug 2010 | A1 |
20100228819 | Wei | Sep 2010 | A1 |
20100242092 | Harris et al. | Sep 2010 | A1 |
20100250497 | Redlich et al. | Sep 2010 | A1 |
20100274772 | Samuels | Oct 2010 | A1 |
20100290468 | Lynam | Nov 2010 | A1 |
20100306169 | Pishevar et al. | Dec 2010 | A1 |
20100325257 | Goel et al. | Dec 2010 | A1 |
20100325634 | Ichikawa et al. | Dec 2010 | A1 |
20110055921 | Narayanaswamy et al. | Mar 2011 | A1 |
20110066736 | Mitchell et al. | Mar 2011 | A1 |
20110072321 | Dhuse | Mar 2011 | A1 |
20110083185 | Sheleheda et al. | Apr 2011 | A1 |
20110087696 | Lacapra | Apr 2011 | A1 |
20110093471 | Brockway et al. | Apr 2011 | A1 |
20110107112 | Resch | May 2011 | A1 |
20110119234 | Schack et al. | May 2011 | A1 |
20110185082 | Thompson | Jul 2011 | A1 |
20110296411 | Tang et al. | Dec 2011 | A1 |
20110320882 | Beaty et al. | Dec 2011 | A1 |
20120007239 | Kolics et al. | Jan 2012 | A1 |
20120117028 | Gold et al. | May 2012 | A1 |
20120144229 | Nadolski | Jun 2012 | A1 |
20120150699 | Trapp et al. | Jun 2012 | A1 |
20120150805 | Pafumi et al. | Jun 2012 | A1 |
20130058229 | Casado et al. | Mar 2013 | A1 |
20130058252 | Casado et al. | Mar 2013 | A1 |
20130058255 | Casado et al. | Mar 2013 | A1 |
20130074181 | Singh | Mar 2013 | A1 |
20130086142 | Hampel et al. | Apr 2013 | A1 |
20140040451 | Agrawal | Feb 2014 | A1 |
20140143308 | Tychina | May 2014 | A1 |
20140223556 | Bignon et al. | Aug 2014 | A1 |
20150281367 | Nygren et al. | Oct 2015 | A1 |
20150282219 | Kweon et al. | Oct 2015 | A1 |
20160036647 | Gonzalez | Feb 2016 | A1 |
20160140045 | Bergeron | May 2016 | A1 |
20170195427 | Choquette | Jul 2017 | A1 |
20170339219 | Le et al. | Nov 2017 | A1 |
20170373953 | George | Dec 2017 | A1 |
20180041524 | Reddy | Feb 2018 | A1 |
20190068694 | Ripke | Feb 2019 | A1 |
20190150150 | Calin et al. | May 2019 | A1 |
20190182363 | Bonaventure | Jun 2019 | A1 |
20190182367 | Kim | Jun 2019 | A1 |
20200186600 | Dawani | Jun 2020 | A1 |
20200287967 | Gafni | Sep 2020 | A1 |
20200396267 | Petria | Dec 2020 | A1 |
20210022041 | Allan | Jan 2021 | A1 |
Number | Date | Country |
---|---|---|
2003300350 | Jul 2004 | AU |
2080530 | Apr 1994 | CA |
2512312 | May 2014 | CA |
605088 | Feb 1996 | EP |
738970 | Oct 1996 | EP |
1081918 | Dec 2003 | EP |
3255845 | Dec 2017 | EP |
63010250 | Jan 1988 | JP |
6205006 | Jul 1994 | JP |
06332782 | Dec 1994 | JP |
08328760 | Dec 1996 | JP |
08339355 | Dec 1996 | JP |
9016510 | Jan 1997 | JP |
11282741 | Oct 1999 | JP |
2000183935 | Jun 2000 | JP |
6205006 | Sep 2017 | JP |
566291 | Dec 2008 | NZ |
0058870 | Apr 2001 | WO |
0239696 | Apr 2003 | WO |
02056181 | Oct 2003 | WO |
2004061605 | Dec 2005 | WO |
2006091040 | Aug 2006 | WO |
2008130983 | Oct 2008 | WO |
2008147973 | Jul 2009 | WO |
2017144123 | Aug 2017 | WO |
Entry |
---|
“Market Research & Releases, CMPP PoC documentation”, last accessed Mar. 29, 2010, (http://mainstreet/sites/PD/Teams/ProdMgmt/MarketResearch/Unive- rsal). |
“Market Research & Releases, Solstice Diameter Requirements”, last accessed Mar. 29, 2010, (http://mainstreet/sites/PD/Teams/ProdMgmt/MarketResearch/Unisversal). |
“Respond to sewer depending on TCP: :client_port”, DevCentral Forums iRules, pp. 1-6, last accessed Mar. 26, 2010, (http://devcentral.f5.com/Default/aspx?tabid=53&forumid=5&1page=1&v). |
F5 Networks Inc., “Deploying the BIG-IP LTM for Diameter Traffic Management,” F5.RTM. Deployment Guide, Publication date Sep. 2010, Version 1.2, pp. 1-19. |
Mac Vittie, L., “Message-Based Load Balancing: Using F5 solutions to address the challenges of scaling Diameter, RADIUS, and message-oriented protocols”, F5 Technical Brief, Jan. 2010, pp. 1-9, F5 Networks Inc., Seattle, Washington. |
Snoeren A., et al., “Managing Cloud Resources:Distributed Rate Limited”, Building and Programming the Cloud Workshop, Jan. 13, 2010, pp. 1-10, UCSDCSE Computer Science and Engineering. |
Wikipedia, “Diameter (protocol)”, pp. 1-11, last accessed Oct. 27, 2010, (http://en.wikipedia.org/wiki/Diameler.sub.--protocol). |
Lelil, S., “Storage Technology News: AutoVirt adds tool to help data migration projects,” Feb. 25, 2011, last accessed Mar. 17, 2011, 3 pages, <http://searchstorage.techtarget.com/news/article/0,289142,sid5_gci152-7986,00.html>. |
Traffix Systems, “Product Brochure, Traffix Signaling Deliver Controller.TM. (SDC)”, Mar. 2011, pp. 1-11, F5 Networks Inc. |
Traffix Systems, “Signaling Deliver Controller.TM.: Control Your 4G Network”, Data Sheet, Mar. 2011, pp. 1-6, F5 Networks Inc. |
International Search Report for International Patent Application No. PCT/US2012/038228 (dated Oct. 19, 2012). |
Traffix Systems, “Diameter Routing Agent (DRA)”, Jul. 2, 2012, pp. 2-5, (http://www traffixsystemscomsolutionsdiameter-routing-agent-DRA). |
Traffix Systems, “Signaling Delivery Controller (SDC)”, Jul. 1, 2012, pp. 2-5, (http://www traffixsystemscomsolutionsSDC). |
Traffix Systems, “Diameter Routing Agent (DRA)”, Accessed Apr. 8, 2013, pp. 2-5, (http://www traffixsystemscomsolutionsdiameter-routing-agent-DRA). |
F5 Networks Inc., “BIG-IP.RTM. Analytics: Implementations”, Manual, Oct. 27, 2015, pp. 1-50, vol. 12.0, F5 Networks, Inc., Retrieved from the Internet:<https://support.f5.com/kb/en-US/products/big-ip_Itm/manuals/- product/Itm-basics-12-0-0.html>. |
F5 Networks Inc., “BIG-IP.RTM. Local Traffic Management: Basics”, Manual, Oct. 20, 2015, pp. 1-68, vol. 12.0, F5 Networks, Inc., Retrieved from the Internet:<https://support.f5.com/kb/en-us/products/big-ip_Itm/manuals/- product/Itm-basics-12-0-0.html>. |
F5 Networks Inc., “BIG-IP LTM and TMOS 12.0.0”, Release Notes, Oct. 6, 2016, pp. 1-110, vol. 12.0, F5 Networks, Inc., Retrieved from the Internet:<https://support.f5.com/kb/en-US/products/big-ip_Itm/releasen- otes/product/relnote-Itm-12-0-0.html>. |
F5 Networks Inc., “BIG-IP.RTM. Local Traffic Manager. TM.: Implementations”, Manual, May 25, 2016, pp. 1-284, vol. 12.0, F5 Networks, Inc., Retrieved from the Internet:<https://support.f5.com/kb/en-US/products/big-ip_Itm/manuals/- product/Itm-implementations-12-0-0.html>. |
F5 Networks Inc., “F5 BIG-IP TMOS: Operations Guide”, Manual, Mar. 5, 2016, pp. 1-236, F5 Networks, Inc., Retrieved from the Internet:<https://support.f5.com/kb/en-US/products/big-ip_Itm/manuals/- product/f5-tmos-operations-guide.html>. |
F5 Networks, Inc , “BIG-IP.RTM. Local Traffic Management: Basics”, Manual, May 9, 2016, 58 pages , version 12.1, F5 Networks, Inc. |
F5 Networks, Inc., “BIG-IP.RTM. Tmos:.RTM. Implementations”, Manual, May 9, 2016, 184 pages, version 12.1, F5 Networks, Inc. |
F5 Networks, Inc., “BIG-IP.RTM. Local Traffic Manager.TM.: Implementations”, Manual, May 4, 2018, 228 pages, version 12.1, F5 Networks, Inc. |
F5 Networks, Inc., “F5 BIG-IP TMOS: Operations Guide”, Manual, Dec. 2018, 226 pages, F5 Networks, Inc. |
Using Predictive Prefetching to Improve World Wide Web Latency, '96, SIGCOM, all pp. 1-15. |
Pearson, P. K., “Fast Hashing of Variable-Length Text Strings,” Comm. of the ACM, Jun. 1990, pp. 677-680, vol. 33, No. 6. |
Cabrera et al., “Swift: a Storage Architecture for Large Objects,” In Proceedings of the—Eleventh IEEE Symposium on Mass Storage Systems, Oct. 1991, pp. 1-7. |
Cabrera et al., “Swift: Using Distributed Disk Striping to Provide High I/O Data Rates,” Fall 1991, pp. 405-436, vol. 4, No. 4, Computing Systems. |
Zayas, E., “AFS-3 Programmer's Reference: Architectural Overview,” Sep. 2, 1991, 37 pages, Version 1.0 (doc. No. FS-00-D160) Transarc Corporation. |
Cabrera et al., “Using Data Striping in a Local Area Network,” 1992, 22 pages, Technical report No. UCSC-CRL-92-09 of the Computer & Information Sciences Department of University of California at Santa Cruz. |
Kohl et al., “The Kerberos Network Authentication Service (V5),” RFC 1510, Sep. 1993, 105 pages, http://www.ietf.org/ rfc/rfc1510.txt?number=1510. |
Hartman, J., “The Zebra Striped Network File System,” 1994, Ph.D. dissertation submitted in the Graduate Division of the University of California at Berkeley. |
Long et al., “Swift/RAID: a distributed RAID System”, Computing Systems, Summer 1994, 20 pages, vol. 7. |
Anderson et al., “Serverless Network File System,” in the 15th Symposium on Operating Systems Principles, Dec. 1995, 18 pages, Association for Computing Machinery, Inc. |
Callaghan et al., “NFS Version 3 Protocol Specifications” RFC 1813), Jun. 1995, 127 pages, The Internet Engineering Task Force (1E1N. |
Padmanabhan, “Using Predictive Prefething to Improve World Wide Web Latency”, 1996, SIGCOM, all pages. (1-15). |
Savage, et al., “AFRAID—a Frequently Redundant Array of Independent Disks,” Jan. 22-26, 1996, pp. 1-13, USENIX Technical Conference, San Diego, California. |
Soltis et al., “The Global File System,” Sep. 17-19, 1996, 24 pages, in Proceedings of the Fifth NASA Goddard Space Flight Center Conference on Mass Storage Systems and Technologies, College Park, Maryland. |
Wilkes, J., et al., “The HP AutoRAID Hierarchical Storage System,” Feb. 1996, 29 pages, vol. 14, No. 1, ACM Transactions on Computer Systems. |
Gibson et al., “File Server Scaling with Network-Attached Secure Disks,” in Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '97), Association for Computing Machinery, Inc., Jun. 15-18, 1997, 13 pages. |
Modiano, “Scheduling Algorithms for Message Transmission Over a Satellitebroadcast System,” MILCOM 97 Proceedings Lincoln Lab., MIT, Lexington, MA 2(2):628-34 (Nov. 2-5, 1997) (Abstract only). |
Thekkath et al., “Frangipani: a Scalable Distributed File System,” in Proceedings of the 16th ACM Symposium on Operating Systems Principles, Oct. 1997, pp. 1-14, Association for Computing Machinery, Inc. |
Fan et al., “Summary Cache: a Scalable Wide-Area Protocol”, Computer Communications Review, Association Machinery, New York, USA, Oct. 1998, pp. 254-265, vol. 28, Web Cache Sharing for Computing No. 4. |
Haskin et al., “The Tiger Shark File System,” 1998, in proceedings of IEEE, Spring COMPCON, Santa Clara, CA, www.research.IBM.com, last accessed on Dec. 30, 2002. |
Nichols et al., “Definition of the Differentiated Services Field (DS Field) in the IPV4 and IPV6 Headers,” RFC:2474) at http://www.ietf.org/rfc/rfc2474.txt, pp. 1-19 (Dec. 1998. |
Patterson et al., “A case for redundant arrays of inexpensive disks (RAID)”, Chicago, Illinois, Jun. 1-3, 1998, pp. 109-116, in Proceedings of ACM SIGMOD conference on the Management of Data, Association for Computing Machinery, Inc. |
Peterson, M., “Introducing Storage Area Networks,” Feb. 1998, 6 pages, InfoStor, www.infostor.com. last accessed on Dec. 20, 2002. |
Soltis et al., “The Design and Performance of a Shared Disk File System for IRIX,” Mar. 23-26, 1998, pp. 1-17, Sixth NASA Goddard Space Flight Center Conference on Mass Storage and Technologies in cooperation with the Fifteenth IEEE Symposium on Mass Storage Systems, University of Minnesota. |
“CSA Persistent File System Technology,” a White Paper, Jan. 1, 1999, pp. 1-3, http://www.cosoa.com/white_papers/pfs.php, Colorado Software Architecture, Inc. |
“Distributed File System: a Logical View of Physical Storage: White Paper,” 1999, Microsoft Corp., www.microsoft.com, <http://www.eu.microsoft.com/TechNet/prodtechnol/windows2000serv/maint- ain/DFSnt95>, pp. 1-26, last accessed on Dec. 2, 2002. |
Gibson et al., “NASD Scalable Storage Systems,” Jun. 1999, 6 pages, USENIX99, Extreme Linux Workshop, Monterey, California. |
Iwang et al., “Designing SSI Clusters with Hierarchical Checkpointing and Single 1/0 Space,” IEEE Concurrency, Jan.-Mar. 1999, pp. 60-69. |
Kimball, C.E. et al., “Automated Client-Side Integration of Distributed Application Servers,” 13th LISA Conf., 1999, pp. 275-282 of the Proceedings. |
“Scaling Next Generation Web Infrastructure with Content-Intelligent Switching: White Paper,” Apr. 2000, pp. 1-9, Alteon Web Systems, Inc. |
Carns et al., “PVFS: a Parallel File System for Linux Clusters,” in Proceedings of the Extreme Linux Track: 4th Annual Linux Showcase and Conference, Oct. 2000, pp. 317-327, Atlanta, Georgia, USENIX Association. |
Farley, M., “Enterprise Storage Forum,” Jan. 2000, 2 pages, Book Review—Building Storage Networks, 2.sup.nd Edition, http://www.enterprisestorageforum.com/sans/features/print/0,,10556_144120- 1.00.html, Enterprise Storage Forum Staff, last accessed Dec. 20, 2002. |
Noghani et al., “A Novel Approach to Reduce Latency on the Internet: ‘Component-Based Download’,” Proceedings of the Computing, Las Vegas, NV, Jun. 2000, pp. 1-6 on the Internet: Inti Conf. on Internet. |
Sorenson, K.M., “Installation and Administration: Kimberlite Cluster Version 1.1.0, Rev. Dec. 2000,” 137 pages, Mission Critical Linux, http://oss.missioncriticallinux.com/kimberlite/kimberlite.pdf. |
Stakutis, C., “Benefits of SAN-based file system shanng,” Jul. 2000, pp. 1-4, InfoStor, www.infostor.com, last accessed on Dec. 30, 2002, Penn Well Corporation. |
UDDI, “UDDI Overview”, Sep. 6, 2000, pp. 1-21, uddi.org, (http://www.uddi.org/). |
UDDI, “UDDI Technical White Paper,” Sep. 6, 2000, pp. 1-12, uddi-org, (http://www.uddi.org/). |
Woo, “A Modular Approach to Packet Classification: Algorithms and Results,” Nineteenth Annual Conference of the IEEE Computer and Communications Societies 3(3)1213-22 (Mar. 26-30, 2000). |
“A Storage Architecture Guide,” Second Edition, 2001, Auspex Systems, Inc., www.auspex.com, last accessed on Dec. 30, 2002. |
“VERITAS SANPoint Foundation Suite(tm) and SANPoint Foundation Suite(tm) HA: New VERITAS Volume Management and File System Technology for Cluster Environments,” Sep. 2001, 26 pages, VERITAS Software Corp. |
“Windows Clustering Technologies—an Overview,” Nov. 2001, 31 pages, Microsoft Corp. |
Botzum, Keys, “Single Sign on—a Contrarian View,” Aug. 6, 2001, pp. 1-8, Open Group Website, http://www.opengroup.org/security/topics.htm. |
F5 Networks Inc., “Routing Global Internet Users to the Appropriate Data Center and Applications Using F5's 3-DNS Controller”, F5 Networks Inc., Aug. 2001, pp. 1-4, Seattle, Washington, (http://www.f5.com/f5producs/3dns/relatedMaterials/UsingF5.html). |
F5 Networks Inc., “Using F5's-DNS Controller to Provide High Availability Between Two or More Data Centers”, F5 Networks Inc., Aug. 2001, pp. 1-4, Seattle, Washington, (http://www.f5.com/f5products/3dns/relatedMaterials/3DNSRouting.html). |
Gupta et al., “Algorithms for Packet Classification,” Dept, of Comput. Sci., Stanford Univ., CA 15(2):24-32 (Mar./Apr. 2001) (Abstract only). |
Karamanolis, C. et al., “An Architecture for Scalable and Manageable File Services,” HPL-2001-173, Jul. 26, 2001. pp. 1-14. |
Norton et al., “CIFS Protocol Version CIFS-Spec 0.9,” 2001, 125 pages, Storage Networking Industry Association (SNIA), www.snia.org, last accessed on Mar. 26, 2001. |
Novotny et al., “An Online Credential Repository for the Grid: MyProxy,” 2001, pp. 1-8. |
Rosen et al., “MPLS Label Stack Encoding,” RFC:3032) at http://www.ietf.org/4rfc/rfc3032.txt, pp. 1-22 (Jan. 2001). |
Sleeper B., “Why UDDI Will Succeed, Quietly: Two Factors Push Web Services Forward”, The Stencil Group, Inc., Apr. 2001, pp. 1-7, San Francisco, California. |
“NERSC Tutorials: I/O on the Cray T3E, ‘Chapter 8, Disk Striping’,” National Energy Research Scientific Computing Center (NERSC), http://hpcfnersc.gov, last accessed on Dec. 27, 2002, 9 pages. |
“The AFS File System in Distributed Computing Environment,” www.transarc.ibm.com/Libraiy/whitepapers/AFS/afsoverview.html, last accessed on Dec. 20, 2002. |
Anderson et al., “Interposed Request Routing for Scalable Network Storage,” ACM Transactions on Computer Systems 20(1): (Feb. 2002), pp. 1-24. |
Baer, T., et al., “The elements of Web services” ADTmag.com, Dec. 1, 2002, pp. 1-6, (http://www.adtmag.com). |
F5 Networks Inc., “3-DNS.RTM. Reference Guide, version 4.5”, F5 Networks Inc., Sep. 2002, pp. 2-1-2-28, 3-1-3-12, 5-1-5-24, Seattle, Washington. |
Ott & Mayer-Patel, “A Mechanism for TCP-Friendly Transport-level Protocol Coordination,” USENIX Annual Technical Conference (2002). |
Ott et al., “A Mechanism for TCP-Friendly Transport-level Protocol Coordination,” Proceedings of the General Track of the Annual Conference on USENIX Annual Technical Conference (Jun. 2002). |
Shohoud, Y., “Building XML Web Services with VB .NET and VB 6”, Addison Wesley, Sep. 17, 2002, pp. 1-14. |
Sleeper B., “The Evolution of UDDI”, UDDI.org White Paper, the Stencil Group, Inc., Jul. 19, 2002, pp. 1-15, San Francisco, California. |
Anonymous, “How DFS Works: Remote File Systems,” Distributed File System (DFS) Mar. 2003, 54 pages, Technical Reference retrieved from the Internet on Jan. 29, 2010, URL<http://technetmicrosoft.com/en-us/library/cc782417(WS. 10,printer).aspx>. |
Basney et al., “Credential Wallets: a Classification of Credential Repositories Highlighting MyProxy,” Sep. 19-21, 2003, pp. 1-20, 31.sup.st Research Conference on Communication, Information and Internet Policy (TPRC 2003), Arlington, Virginia. |
Cavale, M. R., “Introducing Microsoft Cluster Service (MSCS) in the Windows Server 2003”, Nov. 2002, 10 pages, Microsoft Corporation. |
Heinz, “Priorities in Stream Transmission Control Protocol (SCTP) Multistreaming,” Thesis submitted to the Faculty of the University of Delaware (Spring 2003). |
International Search Report for International Patent Application No. PCT/US02/00720, dated Mar. 19, 2003. |
Katsurashima, W. et al., “NAS Switch: a Novel CIFS Server Virtualization, Proceedings,” 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003 (MSST 2003), Apr. 2003. |
Pashalidis et al., “A Taxonomy of Single Sign-on Systems,” 2003, pp. 1-16, Royal Holloway, University of London, Egham Surray, TW20, 0EX, United Kingdom. |
Schilit B., “Bootstrapping Location-Enhanced Web Services”, University of Washington, Dec. 4, 2003, (http://www.cs.washington.edu/news/colloq.info.html). |
Seeley R., “Can Infravio technology revive UDDI?”, ADTmag.com, Oct. 22, 2003, (http://www.adtmag.com). |
Sommers F., “Whats New in UDDI 3.0—Part 1”, Web Services Papers, Jan. 27, 2003, pp. 1-4, (http://www.webservices.org/index.php/article/articleprint/871/-1/24/). |
Sommers F., “Whats New in UDDI 3.0—Part 2”, Web Services Papers, Mar. 2, 2003, pp. 1-7, (http://www.web.archive.org/web/20040620131006/). |
Sommers F., “Whats New in UDDI 3.0—Part 3”, Web Services Papers, Sep. 2, 2003, pp. 1-4, (http://www.webservices.org/index.php/article/articleprint/894/-1/24/). |
Tulloch, Mitch, “Microsoft Encyclopedia of Security,” 2003, pp. 218, 300-301, Microsoft Press, Redmond, Washington. |
UDDI “UDDI Version 3.0.1”, UDDI Spec Technical Committee Specification, Oct. 14, 2003, pp. 1-383, uddi.org, (http://www.uddi.org/). |
Apple, Inc., “Mac OS X Tiger Keynote Intro. Part 2,” Jun. 2004, www.youtube.com <http://www.youtube.com/watch?v=zSBJwEmRJbY>, 1 page. |
Apple, Inc., “Tiger Developer Overview Series: Working with Spotlight,” Nov. 23, 2004, www.apple.com using www.archive.org <http://web.archive.org/web/20041123005335/developer.apple.com/macosx/- tiger/spotlight.html>, pp. 1-11. |
Fajardo V., “Open Diameter Software Architecture,” Jun. 25, 2004, pp. 1-6, Version 1.0.7. |
Lamonica M., “Infravio spiffs up Web services registry idea”, CNET News.com, May 11, 2004, pp. 1-2, (http://www.news.com). |
Pashalidis et al., “Impostor: a Single Sign-on System for Use from Untrusted Devices,” Global Telecommunications Conference, 2004, GLOBECOM '04, IEEE, Issue Date: Nov. 29-Dec. 3, 2004, 5 pages, Royal Holloway, University of London. |
Seeley R., “Can Infravio technology revive UDDI?”, ADTmag.comAccessed Sep. 30, 2004, (http://www.adtmag.com). |
International Search Report from International Application No. PCT/US03/41202, dated Sep. 15, 2005. |
Kawamoto, D., “Amazon files for Web services patent” , CNET News.com, Jul. 28, 2005, pp. 1-2, (http://news.com). |
Wang, “Priority and Realtime Data Transfer Over the Best-Effort Internet,” Dissertation Abstract (2005). |
F5 Networks Inc., “F5 WANJet CIFS Acceleration”, White Paper, F5 Networks Inc., Mar. 2006, pp. 1-5, Seattle, Washington. |
Aguilera et al., “Improving recoverability in multi-tier storage systems,” International Conference on Dependable Systems and Networks (DSN-2007), Jun. 2007, 10 pages, Edinburgh, Scotland. |
Blue Coat, “Technology Primer: CIFS Protocol Optimization,” Blue Coat Systems Inc., 2007, pp. 1-3, (http://www.bluecoat.com). |
Klayman, J., Jul. 18, 2007 e-mail to Japanese associate including instructions for response to office action dated Jan. 22, 2007 in corresponding Japanese patent application No. 2002-556371. |
Klayman, J., response filed by Japanese associate to office action dated Jan. 22, 2007 in corresponding Japanese patent application No. 2002-556371. |
Korkuzas, V., Communication pursuant to Article 96(2) EPC dated Sep. 11, 2007 in corresponding European patent application No. 02718824.2-2201, 3 pages. |
Raghavan B., et al., “Cloud Control with Distributed Rate Limiting”, SIGCOMM'07, Aug. 27-31, 2007, pp. 1-11, Department of Computer Science and Engineering, University of California, San Diego, CA. |
F5 Networks Inc., “Case Information Log for ‘Issues withBoNY upgrade to 4.3’”, as early as Feb. 2008. |
Harrison, C., May 19, 2008 response to Communication pursuant to Article 96(2) EPC dated Nov. 9, 2007 in corresponding European patent application No. 02718824.2. |
International Search Report for International Patent Application No. PCT/US2008/060449 (dated Apr. 9, 2008). |
International Search Report for International Patent Application No. PCT/US2008/064677 (dated Sep. 6, 2009). |
International Search Report for International Patent Application No. PCT/US2008/083117 (dated Jun. 23, 2009). |
Klayman, J., Nov. 13, 2008 e-mail to Japanese associate including instructions for response to office action dated May 26, 2008 in corresponding Japanese patent application No. 2002-556371. |
Jesugi, H., English translation of office action dated May 26, 2008 in corresponding Japanese patent application No. 2002-556371, 2 pages. |
Jesugi, H., Nov. 26, 2008 amendment filed by Japanese associate in response to office action dated May 26, 2008 in corresponding Japanese patent application No. 2002-556371, 5 pages. |
F5 Networks Inc., “F5 Diameter RM” , Powerpoint document, Jul. 16, 2009, pp. 1-7. |
RSYNC, “Welcome to the RSYNC Web Pages,” Retrieved from the Internet URL: http://samba.anu.edu.ut.rsync/. (Retrieved on Dec. 18, 2009), 5 pages. |
Extended European Search Report, dated Mar. 25, 2022. |
Bhalla, A. et al., “Future-Proof Your Hardware Investment”, F5 Networks, Inc., Aug. 16, 2018. |
“Software-Defined Hardware: Enabling Performance and Agility with the BIG-IP iSeries Architecture”, F5 Networks, Inc., Nov. 11, 2016. |
Number | Date | Country | |
---|---|---|---|
62738590 | Sep 2018 | US |