Methods for facilitating network traffic analytics and devices thereof

Information

  • Patent Grant
  • 10505792
  • Patent Number
    10,505,792
  • Date Filed
    Friday, September 29, 2017
    7 years ago
  • Date Issued
    Tuesday, December 10, 2019
    5 years ago
Abstract
Methods, non-transitory computer readable media, network traffic management apparatuses, and network traffic management systems that determine when an event has occurred. The event is defined in an obtained rule and is associated in the rule with a key. The key is attached to a connection associated with received network traffic that triggered the event, when the determining indicates that the event has occurred. The connection is associated with a first layer, the key comprises an input string value or corresponds to a portion of data associated with a second layer associated with the network traffic, and the second layer is different from the first layer. The connection is then monitored to obtain statistics for the connection and store or report the statistics as associated with the key.
Description
FIELD

This technology generally relates to facilitating improved network traffic analytics.


BACKGROUND

Many networks include one or more network traffic management apparatuses that perform any number of functions relating to load balancing, network security, and/or application acceleration, for example. In one particular exemplary implementation, a network traffic management apparatus may be disposed proximate server devices in a network in order to optimize and accelerate communications between client devices and applications hosted by the server devices.


In order to facilitate monitoring and effective configuration and operation, network traffic management apparatuses can maintain statistics in application visibility and reporting (AVR) databases, for example. In one particular example, network traffic management apparatuses can maintain transmission control protocol (TCP) statistics indexed based on entities (e.g., virtual servers, IP addresses, and/or next hop address) that are visible at the transport layer to facilitate TCP analytics. Accordingly, administrators can query the AVR database for any combination of entity values to retrieve statistics for a subset of TCP connections.


In this example, higher layers (e.g., application, presentation, and session layers) may have more relevant information regarding the purpose and relevance of TCP connections. More generally, the statistics that could benefit from relevant information associated with a first layer can be associated with a second layer that is higher or lower than the first layer. Accordingly, queries in an AVR database for TCP analytics, for example, are currently limited to the entities that are visible at the transport layer or below, rendering interpretation, analysis, and classification of TCP statistics difficult for administrators.


SUMMARY

A method for facilitating improved network traffic analytics implemented by a network traffic management system comprising one or more network traffic management apparatuses, administrator device, client devices, or server devices, the method including determining when an event has occurred. The event is defined in an obtained rule and is associated in the rule with a key. The key is attached to a connection associated with received network traffic that triggered the event when the determining indicates that the event has occurred. The connection is associated with a first layer which is different from a second layer. The key comprises an input string value or corresponds to a portion of data associated with a second layer associated with the network traffic. The connection is then monitored to obtain statistics for the connection and store or report the statistics as associated with the key.


A network traffic management apparatus, comprising memory comprising programmed instructions stored thereon and one or more processors configured to be capable of executing the stored programmed instructions to determine when an event has occurred. The event is defined in an obtained rule and is associated in the rule with a key. The key is attached to a connection associated with received network traffic that triggered the event, when the determining indicates that the event has occurred. The connection is associated with a first layer which is different from a second layer. The key comprises an input string value or corresponds to a portion of data associated with a second layer associated with the network traffic. The connection is then monitored to obtain statistics for the connection and store or report the statistics as associated with the key.


A non-transitory computer readable medium having stored thereon instructions for facilitating improved network traffic analytics comprising executable code which when executed by one or more processors, causes the processors to determine when an event has occurred. The event is defined in an obtained rule and is associated in the rule with a key. The key is attached to a connection associated with received network traffic that triggered the event, when the determining indicates that the event has occurred. The connection is associated with a first layer which is different from a second layer. The key comprises an input string value or corresponds to a portion of data associated with a second layer associated with the network traffic. The connection is then monitored to obtain statistics for the connection and store or report the statistics as associated with the key.


A network traffic management system, comprising one or more network traffic management apparatuses, administrator devices, 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 determine when an event has occurred. The event is defined in an obtained rule and is associated in the rule with a key. The key is attached to a connection associated with received network traffic that triggered the event, when the determining indicates that the event has occurred. The connection is associated with a first layer which is different from a second layer. The key comprises an input string value or corresponds to a portion of data associated with a second layer associated with the network traffic. The connection is then monitored to obtain statistics for the connection and store or report the statistics as associated with the key.


This technology has a number of associated advantages including providing methods, non-transitory computer readable media, network traffic management apparatuses, and network traffic management systems that more effectively obtain network traffic analytics. For example, with this technology TCP statistics can advantageously be indexed based on strings corresponding to HTTP or other application layer data which is not available at the transport layer. As a result, network administrators can obtain statistics based on data associated with different layers and protocols, thereby facilitating improved network analytics and associated network traffic management device operation.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of an exemplary network traffic management system with an network traffic management apparatus;



FIG. 2 is a block diagram of an exemplary network traffic management apparatus;



FIG. 3 is a flowchart of an exemplary method for classifying and indexing Transmission Control Protocol (TCP) statistics;



FIG. 4 is an exemplary rule defining an event and key; and



FIG. 5 is a flowchart of an exemplary method for storing and providing TCP statistics to facilitate TCP analytics.





DETAILED DESCRIPTION

Referring to FIG. 1, an exemplary network environment which incorporates an exemplary network traffic management system 10 is illustrated. The network traffic management system 10 in this example includes a network traffic management apparatus 12 that is coupled to a plurality of server devices 14(1)-14(n), a plurality of client devices 16(1)-16(n), and an administrator device 18 via communication network(s) 20, although the network traffic management apparatus 12, server devices 14(1)-14(n), client devices 16(1)-16(n), and/or administrator device 18 may be coupled together via other topologies. Additionally, the network traffic management system 10 may include other network devices such as one or more routers and/or switches, for example, which are well known in the art and thus will not be described herein. This technology provides a number of advantages including methods, non-transitory computer readable media, network traffic management systems, and network traffic management apparatuses that facilitate classifying and indexing statistics associated with a first layer using data associated with a second layer and/or user-defined strings.


Referring to FIGS. 1-2, the network traffic management apparatus 12 of the network traffic management system 10 may perform any number of functions including managing network traffic, load balancing network traffic across the server devices 14(1)-14(n), accelerating network traffic associated with web applications hosted by the server devices 14(1)-14(n), and/or providing firewall and other security services on behalf of the server devices 14(1)-14(n) and applications hosted thereon.


The network traffic management apparatus 12 includes one or more processors 22, a memory 24, and/or a communication interface 26, which are coupled together by a bus 28 or other communication link, although the network traffic management apparatus 12 can include other types and/or numbers of elements in other configurations.


The processor(s) 22 of the network traffic management apparatus 12 may execute programmed instructions stored in the memory 24 of the network traffic management apparatus 12 for the any number of the functions identified above. The processor(s) 22 of the network traffic management apparatus 12 may include one or more CPUs or general purpose processors with one or more processing cores, for example, although other types of processor(s) can also be used.


The memory 24 of the network traffic management apparatus 12 stores these programmed instructions for one or more aspects of the present technology as described and illustrated herein, although some or all of the programmed instructions could be stored elsewhere. A variety of different types of memory storage devices, such as random access memory (RAM), read only memory (ROM), hard disk, solid state drives, flash memory, or other computer readable medium which is read from and written to by a magnetic, optical, or other reading and writing system that is coupled to the processor(s) 22, can be used for the memory 24.


Accordingly, the memory 24 of the network traffic management apparatus 12 can store one or more applications that can include computer executable instructions that, when executed by the network traffic management apparatus 12, cause the network traffic management apparatus 12 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 FIGS. 3-5. The application(s) can be implemented as modules or components of other applications. Further, the application(s) can be implemented as operating system extensions, modules, plugins, or the like.


Even further, the application(s) may be operative in a cloud-based computing environment. The application(s) can be executed within or as virtual machine(s) or virtual server(s) that may be managed in a cloud-based computing environment. Also, the application(s), and even the network traffic management apparatus 12 itself, may be located in virtual server(s) running in a cloud-based computing environment rather than being tied to one or more specific physical network computing devices. Also, the application(s) may be running in one or more virtual machines (VMs) executing on the network traffic management apparatus 12. Additionally, in one or more embodiments of this technology, virtual machine(s) running on the network traffic management apparatus 12 may be managed or supervised by a hypervisor.


In this particular example, the memory 24 of the network traffic management apparatus 12 includes a hypertext transport protocol (HTTP) processing module, a TCP processing module, and an application visibility and reporting (AVR) module, although the memory 24 can include other policies, modules, databases, or applications, for example. The HTTP processing module 30 can be any type of module that has visibility to HTTP data.


Accordingly, the HTTP processing module 30 can process HTTP network traffic, for example. In one particular example, the HTTP processing module 30 can be a policy enforcement manager (PEM) configured to apply policies to network traffic originating from mobile ones of the client devices 16(1)-16(n) that are in a subscriber network, although the HTTP processing module 30 can be any other type of module in other examples. The HTTP processing module 30 is further configured to evaluate rules to determine whether an event has occurred and an associated key should be attached to a TCP connection associated with received network traffic that triggered the event, as described and illustrated in more detail later.


The TCP processing module 32 is configured to manage TCP connections and has visibility to entities associated with the transport layer in the OSI model, such as virtual server, remote host IP address/subnet, next hop address, and/or geolocation code data, for example. The TCP processing module 32 is configured to monitor TCP traffic and provide statistical data to the AVR module 34 based on the various entities for one or more TCP connections. The TCP processing module 32 in this example is further configured to attach keys to TCP connections at the instruction of the HTTP processing module 30, and report the keys as entity values for particular TCP connections to the AVR module 34, also as described and illustrated in more detail later. The HTTP processing module 30 and TCP processing module 32 are exemplary only, and other modules associated with different protocols and/or layers of the OSI model can also be used in other examples.


The AVR module 34 aggregates and/or stores the statistical data received from the TCP processing module 32 in an AVR database or other data structure, for example. The statistical data is stored in format that is indexed by entity, as well as by key when a key is attached to a TCP connection for which statistical data is maintained by the AVR module 34. Accordingly, a user of the administrator device 18 can query the AVR database via an interface provided by the AVR module 34, using one or more entity values (e.g., a key), in order to retrieve statistical data for TCP connections corresponding to the entity values.


The communication interface 26 of the network traffic management apparatus 12 operatively couples and communicates between the network traffic management apparatus 12, the server devices 14(1)-14(n), the client devices 16(1)-16(n), and/or the administrator device 18, which are all coupled together by the communication network(s) 20, although other types and/or numbers of communication networks or systems with other types and/or numbers of connections and/or configurations to other devices and/or elements can also be used.


By way of example only, the communication network(s) 20 can include local area network(s) (LAN(s)) or wide area network(s) (WAN(s)), and can use TCP/IP over Ethernet and industry-standard protocols, although other types and/or numbers of protocols and/or communication networks can be used. The communication network(s) 20 in this example can employ any suitable interface mechanisms and network communication technologies including, for example, teletraffic in any suitable form (e.g., voice, modem, and the like), Public Switched Telephone Network (PSTNs), Ethernet-based Packet Data Networks (PDNs), combinations thereof, and the like. The communication network(s) 20 can also include direct connection(s) (e.g., for when a device illustrated in FIG. 1, such as the network traffic management apparatus 12, one or more of the client devices 16(1)-16(n), one or more of the server devices 14(1)-14(n), or the administrator device 18 operate as virtual instances on the same physical machine).


While the network traffic management apparatus 12 is illustrated in this example as including a single device, the network traffic management apparatus 12 in other examples can include a plurality of devices or blades each having 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 devices included in the network traffic management apparatus 12.


Additionally, one or more of the devices that together comprise the network traffic management apparatus 12 in other examples can be standalone devices or integrated with one or more other devices or apparatuses, such as one of the server devices 14(1)-14(n), for example. Moreover, one or more of the devices of the network traffic management apparatus 12 in these examples can be in a same or a different communication network including one or more public, private, or cloud networks, for example.


Each of the server devices 14(1)-14(n) of the network traffic management system 10 in this example includes one or more processors, a memory, and a communication interface, which are coupled together by a bus or other communication link, although other numbers and/or types of network devices could be used. The server devices 14(1)-14(n) in this example process requests received from the client devices 16(1)-16(n) via the communication network(s) 20 according to the HTTP-based application RFC protocol, for example. Various applications may be operating on the server devices 14(1)-14(n) and transmitting data (e.g., files or Web pages) to the client devices 16(1)-16(n) via the network traffic management apparatus 12 in response to requests from the client devices 16(1)-16(n). The server devices 14(1)-14(n) may be hardware or software or may represent a system with multiple servers in a pool, which may include internal or external networks.


Although the server devices 14(1)-14(n) are illustrated as single devices, one or more actions of each of the server devices 14(1)-14(n) may be distributed across one or more distinct network computing devices that together comprise one or more of the server devices 14(1)-14(n). Moreover, the server devices 14(1)-14(n) are not limited to a particular configuration. Thus, the server devices 14(1)-14(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 server devices 14(1)-14(n) operate to manage and/or otherwise coordinate operations of the other network computing devices. The server devices 14(1)-14(n) may operate as a plurality of network computing devices within a cluster architecture, a peer-to peer architecture, virtual machines, or within a cloud architecture, for example.


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, one or more of the server devices 14(1)-14(n) can operate within the network traffic management apparatus 12 itself rather than as a stand-alone server device communicating with the network traffic management apparatus 12 via the communication network(s) 20. In this example, the one or more server devices 14(1)-14(n) operate within the memory 24 of the network traffic management apparatus 12.


The client devices 16(1)-16(n) of the network traffic management system 10 in this example include any type of computing device that can request and receive content stored by the server devices 14(1)-14(n) over the communication network(s) 20, such as mobile computing devices, desktop computing devices, laptop computing devices, tablet computing devices, virtual machines (including cloud-based computers), or the like. Each of the client devices 16(1)-16(n) in this example include a processor, a memory, and a communication interface, which are coupled together by a bus or other communication link, although other numbers and/or types of network devices could be used.


The client devices 16(1)-16(n) may run interface applications, such as standard web browsers or standalone client applications, which may provide an interface to make requests for, and receive content stored on, one or more of the server devices via the communication network(s) 20. The client devices 16(1)-16(n) may further include a display device, such as a display screen or touchscreen, and/or an input device, such as a keyboard for example.


The administrator device 18 in this example includes a processor, a memory, and a communication interface, which are coupled together by a bus or other communication link, although other numbers and types of network devices could be used. The administrator device 18 may also include an input device and a display device and may run interface applications, such as a web browser, that may provide an interface for an administrator to input rules that defined events and associated keys, as well as, optionally, one or more conditions. The web browser of the administrator device 18 further provides an interface for an administrator to query an AVR database maintained by the AVR module 34 based on entity values, including keys when attached to particular TCP connections.


Although the exemplary network traffic management system 10 with the network traffic management apparatus 12, server devices 14(1)-14(n), client devices 16(1)-16(n), administrator device 18, and communication network(s) 20 are described and illustrated herein, other types and/or numbers of systems, devices, components, and/or 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).


One or more of the components depicted in the network traffic management system 10, such as the network traffic management apparatus 12, client devices 16(1)-16(n), server devices 14(1)-14(n), or administrator device 18, for example, may be configured to operate as virtual instances on the same physical machine. In other words, one or more of the network traffic management apparatus 12, client devices 16(1)-16(n), server devices 14(1)-14(n), or administrator device 18 may operate on the same physical device rather than as separate devices communicating through communication network(s). Additionally, there may be more or fewer network traffic management apparatuses, client devices, server devices, or administrator devices than illustrated in FIG. 1. The client devices 16(1)-16(n) could also be implemented as applications on the network traffic management apparatus 12 itself as a further example.


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 networks, cellular traffic networks, Packet Data Networks (PDNs), the Internet, intranets, and combinations thereof.


The examples may also be embodied as one or more non-transitory computer readable media having instructions stored thereon for one or more aspects of the present technology as described and illustrated by way of the examples herein. The instructions in some examples include executable code that, when executed by one or more processors, cause the processors to carry out steps necessary to implement the methods of the examples of this technology that are described and illustrated herein.


An exemplary method of facilitating network traffic analytics will now be described with reference to FIGS. 1-5. Referring more specifically to FIG. 3, an example of a method for classifying and indexing TCP statistics is illustrated. In step 300 in this example, the network traffic management apparatus 12 of the network traffic management system 10 obtains one or more rules that define one or more events and associated keys, and optionally one or more conditions, from the administrator device 18, although the events, keys, and conditions can be obtained in other ways.


The rules can be stored and evaluated by the HTTP processing module 30 and are optionally event-driven. In one particular example, the rules can be based on cross-layer messaging protocol or framework, such as iRules provided by F5 Networks, Inc. of Seattle, Wash., which is based on the Tool Command Language (TCL), although other types of rules can also be used in other examples. The optional conditions can be evaluated by the HTTP processing module 30 based on HTTP data, for example.


Accordingly, upon determining an event has occurred, the HTTP processing module 30 evaluates any conditions associated with the event that has occurred. If one or more of the conditions are satisfied, the HTTP processing module 30 instructs the TCP processing module 32 to attach a key associated with the event and/or satisfied condition(s) to a TCP connection associated with network traffic that triggered the event, as described and illustrated in more detail later.


The key can be obtained from the administrator device 18 and stored as associated with one or more of the events and/or conditions as a predefined input string value. In another example, the key corresponds to at least a portion of HTTP data (e.g., a Uniform Resource Identifier (URI)) associated with network traffic that triggered an event, although other types and/or numbers of keys can be used in other examples.


In step 302, the network traffic management apparatus 12 receives network traffic, such as from one of the client devices 16(1)-16(n), for example. The network traffic can be HTTP traffic directed to an application hosted by one of the server devices 14(1)-14(n), for example, although other types of network traffic can also be received in step 302. Additionally, the network traffic can be received by the HTTP processing module 30 storing the rules obtained in step 300.


In step 304, the network traffic management apparatus 12 optionally determines whether an event in one of the rules obtained in step 300 has occurred. The event can be receipt of an HTTP or initiation of an SSL connection, for example, although other types of events can also be defined in the rules evaluated in step 304. If the network traffic management apparatus 12 determines that an event has occurred, then the Yes branch is taken to step 306.


In step 306, the network traffic management apparatus 12 optionally analyzes HTTP data associated with the network traffic based on one or more conditions associated with the event determined to have occurred in step 304. The HTTP data can include PEM value(s), a user agent, an operating system, an HTTP identifier, a tower ID, or any other number or type of data that is visible at the application, presentation, or session layer, for example.


In step 308, the network traffic management apparatus 12 determines whether at least one of the conditions is satisfied based on the analysis of the HTTP data in step 306. In one example, the condition can require the network traffic management apparatus 12 to determine whether the network traffic is associated with a particular URI. In this example, rather than a key being attached to a TCP connection each time an HTTP request is received, a key is only attached to a TCP connection associated with HTTP requests for a particular URI.


Accordingly, the conditions effectively narrow the scope of the attachment of the keys to particular TCP connections based on HTTP data in this example. The conditions can be associated with any other type of HTTP data, and other types of conditions can also be used. If the network traffic management apparatus 12 determines that one of the conditions in one of the rules associated with the event determined to have occurred in step 304 is satisfied, then the Yes branch is taken from step 308 to step 310.


In step 310, the network traffic management apparatus 12 attaches a key associated with the event determined to have occurred in step 304, and/or conditions determined to have been satisfied in step 308, to a TCP connection associated with the network traffic that triggered the event. The key is communicated by the HTTP processing module 30 to the TCP processing module 32, which stores and uses the key as an entity value for the TCP connection.


Referring more specifically to FIG. 4, an exemplary rule that can be obtained in step 300, and applied as described and illustrated with reference to steps 304-310, is illustrated. In this example, the rule is configured to communicate across layers. In particular, the rule determines whether an event of receipt of an HTTP request has occurred. A condition is then tested as part of the rule and, if satisfied, a URI included in the HTTP request that triggered the event is communicated as a key to the TCP processing module 32. The TCP processing module 32 attaches or associates the key with a TCP connection associated with the received HTTP request that triggered the event.


Referring back to FIG. 3, subsequent to attaching the key to the TCP connection or if the network traffic management apparatus 12 determines that an event defined in one of the rules has not occurred and the No branch is taken from step 304, or that a condition optionally defined in one of the rules associated with a triggered event has not been satisfied and the No branch is taken from step 308, then the network traffic management apparatus 12 proceeds to step 312. In step 312, the network traffic management apparatus 12 monitors the TCP connection to obtain statistics. The statistics can relate to various aspects of TCP performance for the TCP connection, such as connection time, for example.


In step 314, the network traffic management apparatus 12 reports the statistics to the AVR module 34 to be indexed based on entity values. In iterations in which a key is attached to the TCP connection in step 310, the key is treated as an entity value and, accordingly, the reported statistics are indexed based on the key along with values for one or more predefined entities (e.g., virtual server or next hop address).


However, in iterations in which a key is not attached to the TCP connection in step 310, the reported statistics are indexed based only on values for one or more predefined entities. Subsequent to reporting the statistics to the AVR module 34, the network traffic management apparatus 12 proceeds back to step 302 and receives additional network traffic. Accordingly, throughout any number of iterations, a key can be updated for a TCP connection any number of times during the collection of statistics for the TCP connection. Additionally, one or more of steps 302-316 can occur in parallel for any amount of received network traffic or any number of TCP connections.


Referring more specifically to FIG. 5, a method for storing and providing TCP statistics to facilitate TCP analytics is illustrated. In step 500 in this example, the network traffic management apparatus 12 receives statistics for a TCP connection. The TCP statistics are associated with entity values and can be received by the AVR module 34, as reported to the AVR module 34 from the TCP processing module 32, such as described and illustrated earlier with reference to step 314 of FIG. 3, for example.


In step 502, the network traffic management apparatus 12 stores the statistics in an AVR database or other data structure of the AVR module 34. Optionally, the received and stored TCP statistics can be aggregated or otherwise processed. Additionally, the statistics can be stored as associated with entity values that include a key, which could have been attached to the TCP connection, as described and illustrated in more detail earlier with reference to step 310 of FIG. 3, for example.


In step 504, the network traffic management apparatus 12 determines whether a query has been received, such as from the administrator device 18 and at the AVR module 34, for example. The query can be for TCP statistics for one or more TCP connections, and can allow an administrator to evaluate and/or improve or optimize TCP performance for the network traffic management apparatus 12, for example. If the network traffic management apparatus 12 determines that a query has not been received, then the No branch is taken back to step 500, and the network traffic management apparatus 12 continues receiving statistics for TCP connections.


However, if the network traffic management apparatus 12 determines in step 504 that a query has been received, then the Yes branch is taken to step 506. In step 506, the network traffic management apparatus 12 retrieves statistics from the AVR database using one or more entity values included in the received query. In iterations in which the query includes a key, the statistics can be retrieved using the key that was previously attached to one or more TCP connections and stored in the AVR database or other data storage structure utilized by the AVR module 34.


In step 508, the network traffic management apparatus 12 outputs the statistics retrieved in step 506, such as via one or more graphical displays sent to the administrator device 18, for example. In the example described and illustrated with reference to FIG. 4, an administrator of the network traffic management apparatus 12 can obtain overall connection time separated by URI, for example, which allows for more meaningful analysis. One or more of steps 500-508 can occur in parallel, and the receipt of a query is time-independent of the receipt of statistics for any number of TCP connections.


Accordingly, with this technology, TCP statistics can advantageously be indexed based on strings corresponding to HTTP data that is not available at the transport layer. By attaching predefined input string values to TCP connections, or effectively tagging TCP connections with strings corresponding to HTTP data, administrators can obtain TCP statistics based on higher layer values, thereby facilitating improved TCP analytics and associated network traffic management apparatus operation.


Having thus described the basic concept of the invention, 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 invention. 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 invention is limited only by the following claims and equivalents thereto.

Claims
  • 1. A method for facilitating improved network traffic analytics implemented by a network traffic management system comprising one or more network traffic management apparatuses, client devices, administrator devices, or server devices, the method comprising: determining when an event has occurred, wherein the event is defined in a rule comprising one or more conditions and the event is associated with a key;determining when data associated with a first network layer within network traffic satisfies at least one of the conditions in the rule;associating the key to a connection associated with the network traffic that triggered the event, wherein the connection is associated with a second network layer within the network traffic that is different from the first network layer within the network traffic and the key comprises an input string value or corresponds to a portion of the data associated with the first network layer; andmonitoring the connection to obtain statistics for the connection and storing or reporting the statistics as associated with the key.
  • 2. The method of claim 1, further comprising storing or reporting the statistics indexed based on one or more predefined entities, when the determining indicates that the event has not occurred or the data does not satisfy the at least one of the conditions.
  • 3. The method of claim 1, further comprising: storing the statistics associated with the key in a database;receiving a query comprising the key;retrieving at least a portion of the statistics from the database using the key; andoutputting the at least a portion of the statistics in response to the received query.
  • 4. The method of claim 1, wherein the first network layer is a transport layer, the connection is a transport control protocol (TCP) connection, the second network layer is an application layer, and the rule is event-driven and implemented according to a cross-layer messaging protocol.
  • 5. A network traffic management apparatus, comprising memory comprising programmed instructions stored thereon and one or more processors configured to be capable of executing the stored programmed instructions to: determine when an event has occurred, wherein the event is defined in a rule comprising one or more conditions and the event is associated with a key;determine when data associated with a first network layer within network traffic satisfies at least one of the conditions in the rule;associate the key to a connection associated with the network traffic that triggered the event, wherein the connection is associated with a second network layer within the network traffic that is different from the first network layer within the network traffic and the key comprises an input string value or corresponds to a portion of the data associated with the first network layer; andmonitor the connection to obtain statistics for the connection and store or report the statistics as associated with the key.
  • 6. The network traffic management apparatus of claim 5, wherein the one or more processors are further configured to be capable of executing the stored programmed instructions to store or report the statistics indexed based on one or more predefined entities, when the determining indicates that the event has not occurred or the data does not satisfy the at least one of the conditions.
  • 7. The network traffic management apparatus of claim 5, wherein the one or more processors are further configured to be capable of executing the stored programmed instructions to: store the statistics associated with the key in a database;receive a query comprising the key;retrieve at least a portion of the statistics from the database using the key; andoutput the at least a portion of the statistics in response to the received query.
  • 8. The network traffic management apparatus of claim 5, wherein the first network layer is a transport layer, the connection is a transport control protocol (TCP) connection, the second network layer is an application layer, and the rule is event-driven and implemented according to a cross-layer messaging protocol.
  • 9. A non-transitory computer readable medium having stored thereon instructions for facilitating network traffic analytics comprising executable code which when executed by one or more processors, causes the one or more processors to: determine when an event has occurred, wherein the event is defined in a rule comprising one or more conditions and the event is associated with a key;determine when data associated with a first network layer within network traffic satisfies at least one of the conditions in the rule;associate the key to a connection associated with the network traffic that triggered the event, wherein the connection is associated with a second network layer within the network traffic that is different from the first network layer within the network traffic and the key comprises an input string value or corresponds to a portion of the data associated with the first network layer; andmonitor the connection to obtain statistics for the connection and store or report the statistics as associated with the key.
  • 10. The non-transitory computer readable medium of claim 9, wherein the executable code when executed by the one or more processors further causes the one or more processors to store or report the statistics indexed based on one or more predefined entities, when the determining indicates that the event has not occurred or the data does not satisfy the at least one of the conditions.
  • 11. The non-transitory computer readable medium of claim 9, wherein the executable code when executed by the one or more processors further causes the one or more processors to: store the statistics associated with the key in a database;receive a query comprising the key;retrieve at least a portion of the statistics from the database using the key; andoutput the at least a portion of the statistics in response to the received query.
  • 12. The non-transitory computer readable medium of claim 9, wherein the first network layer is a transport layer, the connection is a transport control protocol (TCP) connection, the second network layer is an application layer, and the rule is event-driven and implemented according to a cross-layer messaging protocol.
  • 13. A network traffic management system, comprising one or more traffic management apparatuses, client devices, administrator 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: determine when an event has occurred, wherein the event is defined in a rule comprising one or more conditions and the event is associated with a key;determine when data associated with a first network layer within network traffic satisfies at least one of the conditions in the rule;associate the key to a connection associated with the network traffic that triggered the event, wherein the connection is associated with a second network layer within the network traffic that is different from the first network layer within the network traffic and the key comprises an input string value or corresponds to a portion of the data associated with the first network layer; andmonitor the connection to obtain statistics for the connection and store or report the statistics as associated with the key.
  • 14. The network traffic management system of claim 13, wherein the one or more processors are further configured to be capable of executing the stored programmed instructions to store or report the statistics indexed based on one or more predefined entities, when the determining indicates that the event has not occurred or the data does not satisfy the at least one of the conditions.
  • 15. The network traffic management system of claim 13, wherein the one or more processors are further configured to be capable of executing the stored programmed instructions to: store the statistics associated with the key in a database;receive a query comprising the key;retrieve at least a portion of the statistics from the database using the key; andoutput the at least a portion of the statistics in response to the received query.
  • 16. The network traffic management system of claim 13, wherein the first network layer is a transport layer, the connection is a transport control protocol (TCP) connection, the second network layer is an application layer, and the rule is event-driven and implemented according to a cross-layer messaging protocol.
Parent Case Info

This application claims the benefit of U.S. Provisional Patent Application Ser. No. 62/416,214 filed Nov. 2, 2016, which is hereby incorporated by reference in its entirety.

US Referenced Citations (793)
Number Name Date Kind
3950735 Patel Apr 1976 A
4644532 George et al. Feb 1987 A
4897781 Chang et al. Jan 1990 A
4965772 Daniel et al. Oct 1990 A
5023826 Patel Jun 1991 A
5053953 Patel Oct 1991 A
5167024 Smith et al. Nov 1992 A
5282201 Frank et al. Jan 1994 A
5299312 Rocco, Jr. Mar 1994 A
5327529 Fults et al. Jul 1994 A
5367635 Bauer et al. Nov 1994 A
5371852 Attanasio et al. Dec 1994 A
5406502 Haramaty et al. Apr 1995 A
5475857 Daily Dec 1995 A
5517617 Sathaye et al. May 1996 A
5519694 Brewer et al. May 1996 A
5519778 Leighton et al. May 1996 A
5521591 Arora et al. May 1996 A
5528701 Aref Jun 1996 A
5550816 Hardwick et al. Aug 1996 A
5581764 Fitzgerald et al. Dec 1996 A
5596742 Agarwal et al. Jan 1997 A
5606665 Yang et al. Feb 1997 A
5611049 Pitts Mar 1997 A
5623490 Richter et al. Apr 1997 A
5663018 Cummings et al. Sep 1997 A
5752023 Choucri et al. May 1998 A
5761484 Agarwal et al. Jun 1998 A
5768423 Aref et al. Jun 1998 A
5774660 Brendel et al. Jun 1998 A
5790554 Pitcher et al. Aug 1998 A
5802052 Venkataraman Sep 1998 A
5812550 Sohn et al. Sep 1998 A
5825772 Dobbins et al. Oct 1998 A
5828847 Gehr et al. Oct 1998 A
5832283 Chou et al. Nov 1998 A
5875296 Shi et al. Feb 1999 A
5892914 Pitts Apr 1999 A
5892932 Kim Apr 1999 A
5919247 Van Hoff et al. Jul 1999 A
5936939 Des Jardins et al. Aug 1999 A
5941988 Bhagwat et al. Aug 1999 A
5946690 Pitts Aug 1999 A
5949885 Leighton Sep 1999 A
5951694 Choquier et al. Sep 1999 A
5959990 Frantz et al. Sep 1999 A
5974460 Maddalozzo, Jr. et al. Oct 1999 A
5983281 Ogle et al. Nov 1999 A
5987523 Hind et al. Nov 1999 A
5988847 McLaughlin et al. Nov 1999 A
5991302 Berl et al. Nov 1999 A
5995491 Richter et al. Nov 1999 A
6006260 Barrick, Jr. et al. Dec 1999 A
6006264 Colby et al. Dec 1999 A
6026452 Pitts Feb 2000 A
6026500 Topff et al. Feb 2000 A
6028857 Poor Feb 2000 A
6029175 Chow et al. Feb 2000 A
6041365 Kleinerman Mar 2000 A
6047356 Anderson et al. Apr 2000 A
6051169 Brown et al. Apr 2000 A
6064671 Killian May 2000 A
6067558 Wendt et al. May 2000 A
6078956 Bryant et al. Jun 2000 A
6085234 Pitts et al. Jul 2000 A
6092196 Reiche Jul 2000 A
6104706 Richter et al. Aug 2000 A
6108703 Leighton et al. Aug 2000 A
6111876 Frantz et al. Aug 2000 A
6128279 O'Neil et al. Oct 2000 A
6128657 Okanoya et al. Oct 2000 A
6154777 Ebrahim Nov 2000 A
6157950 Krishnan Dec 2000 A
6160874 Dickerman et al. Dec 2000 A
6170022 Linville et al. Jan 2001 B1
6178423 Douceur et al. Jan 2001 B1
6182139 Brendel Jan 2001 B1
6185619 Joffe et al. Feb 2001 B1
6192051 Lipman et al. Feb 2001 B1
6233612 Fruchtman et al. May 2001 B1
6246684 Chapman et al. Jun 2001 B1
6253226 Chidambaran et al. Jun 2001 B1
6253230 Couland et al. Jun 2001 B1
6259405 Stewart et al. Jul 2001 B1
6260070 Shah Jul 2001 B1
6263368 Martin Jul 2001 B1
6289012 Harrington et al. Sep 2001 B1
6292832 Shah et al. Sep 2001 B1
6298380 Coile et al. Oct 2001 B1
6304913 Rune Oct 2001 B1
6327622 Jindal et al. Dec 2001 B1
6330574 Murashita Dec 2001 B1
6338082 Schneider Jan 2002 B1
6343324 Hubis et al. Jan 2002 B1
6347339 Morris et al. Feb 2002 B1
6353848 Morris Mar 2002 B1
6356541 Muller et al. Mar 2002 B1
6360270 Cherkasova et al. Mar 2002 B1
6363056 Beigi et al. Mar 2002 B1
6370527 Singhal Apr 2002 B1
6374300 Masters Apr 2002 B2
6389462 Cohen et al. May 2002 B1
6396833 Zhang et al. May 2002 B1
6411986 Susai et al. Jun 2002 B1
6430562 Kardos et al. Aug 2002 B1
6434081 Johnson et al. Aug 2002 B1
6446108 Rosenberg et al. Sep 2002 B1
6466580 Leung Oct 2002 B1
6469983 Narayana et al. Oct 2002 B2
6480476 Willars Nov 2002 B1
6484261 Wiegel Nov 2002 B1
6490624 Sampson et al. Dec 2002 B1
6510135 Almulhem et al. Jan 2003 B1
6510458 Berstis et al. Jan 2003 B1
6513061 Ebata et al. Jan 2003 B1
6514085 Slattery et al. Feb 2003 B2
6519643 Foulkes et al. Feb 2003 B1
6542936 Mayle et al. Apr 2003 B1
6560230 Li et al. May 2003 B1
6578069 Hopmann et al. Jun 2003 B1
6601084 Bhaskaran et al. Jul 2003 B1
6606744 Mikurak Aug 2003 B1
6615267 Whalen et al. Sep 2003 B1
6631422 Althaus et al. Oct 2003 B1
6636502 Shiran et al. Oct 2003 B1
6636894 Short et al. Oct 2003 B1
6650640 Muller et al. Nov 2003 B1
6650641 Albert et al. Nov 2003 B1
6654346 Mahalingaiah et al. Nov 2003 B1
6654701 Hailey Nov 2003 B2
6661802 Homberg et al. Dec 2003 B1
6671818 Mikurak Dec 2003 B1
6683873 Kwok et al. Jan 2004 B1
6691165 Bruck et al. Feb 2004 B1
6694517 James et al. Feb 2004 B1
6701415 Hendren, III Mar 2004 B1
6708187 Shanumgam et al. Mar 2004 B1
6708220 Olin Mar 2004 B1
6718380 Mohaban et al. Apr 2004 B1
6728704 Mao et al. Apr 2004 B2
6738357 Richter et al. May 2004 B1
6742045 Albert et al. May 2004 B1
6744776 Kalkunte et al. Jun 2004 B1
6748416 Carpenter et al. Jun 2004 B2
6751663 Farrell et al. Jun 2004 B1
6754215 Arikawa et al. Jun 2004 B1
6754228 Ludwig Jun 2004 B1
6754699 Swildens et al. Jun 2004 B2
6760337 Snyder, II et al. Jul 2004 B1
6760775 Anerousis et al. Jul 2004 B1
6772219 Shobatake Aug 2004 B1
6779039 Bommareddy et al. Aug 2004 B1
6781986 Sabaa et al. Aug 2004 B1
6795860 Shah Sep 2004 B1
6798777 Ferguson et al. Sep 2004 B1
6804542 Haartsen Oct 2004 B1
6816901 Sitaraman et al. Nov 2004 B1
6816977 Brakmo et al. Nov 2004 B2
6826698 Minkin et al. Nov 2004 B1
6829238 Tokuyo et al. Dec 2004 B2
6857009 Ferreria Feb 2005 B1
6862282 Oden Mar 2005 B1
6865593 Reshef et al. Mar 2005 B1
6868082 Allen, Jr. et al. Mar 2005 B1
6868447 Slaughter et al. Mar 2005 B1
6871221 Styles Mar 2005 B1
6876629 Beshai et al. Apr 2005 B2
6876654 Hegde Apr 2005 B1
6880017 Marce et al. Apr 2005 B1
6883137 Girardot et al. Apr 2005 B1
6888836 Cherkasova May 2005 B1
6904040 Salapura et al. Jun 2005 B2
6914881 Mansfield et al. Jul 2005 B1
6928082 Liu et al. Aug 2005 B2
6928518 Talagala Aug 2005 B2
6947985 Hegli et al. Sep 2005 B2
6950434 Viswanath et al. Sep 2005 B1
6954780 Susai et al. Oct 2005 B2
6957272 Tallegas et al. Oct 2005 B2
6959394 Brickell et al. Oct 2005 B1
6970475 Fraser et al. Nov 2005 B1
6970924 Chu et al. Nov 2005 B1
6973490 Robertson et al. Dec 2005 B1
6975592 Seddigh et al. Dec 2005 B1
6986040 Kramer et al. Jan 2006 B1
6987763 Rochberger et al. Jan 2006 B2
6990074 Wan et al. Jan 2006 B2
6990114 Erimli et al. Jan 2006 B1
7003564 Greuel et al. Feb 2006 B2
7006502 Lin Feb 2006 B2
7007092 Peiffer Feb 2006 B2
7020713 Shah et al. Mar 2006 B1
7023974 Brannam et al. Apr 2006 B1
7035212 Mittal et al. Apr 2006 B1
7039061 Connor et al. May 2006 B2
7058633 Gnagy et al. Jun 2006 B1
7065482 Shorey et al. Jun 2006 B2
7075924 Richter et al. Jul 2006 B2
7076689 Atkinson Jul 2006 B2
7080314 Garofalakis et al. Jul 2006 B1
7089491 Feinberg et al. Aug 2006 B2
7099277 Sahinoglu et al. Aug 2006 B2
7113993 Cappiello et al. Sep 2006 B1
7113996 Kronenberg Sep 2006 B2
7133863 Teng et al. Nov 2006 B2
7133944 Song et al. Nov 2006 B2
7139792 Mishra et al. Nov 2006 B1
7161904 Hussain et al. Jan 2007 B2
7185359 Schmidt et al. Feb 2007 B2
7191163 Herrera et al. Mar 2007 B2
7228359 Monteiro Jun 2007 B1
7228422 Morioka et al. Jun 2007 B2
7236491 Tsao et al. Jun 2007 B2
7240100 Wein et al. Jul 2007 B1
7257633 Masputra et al. Aug 2007 B2
7287082 O'Toole, Jr. Oct 2007 B1
7292541 C S Nov 2007 B1
7295827 Liu et al. Nov 2007 B2
7296263 Jacob Nov 2007 B1
7308475 Pruitt et al. Dec 2007 B1
7308703 Wright et al. Dec 2007 B2
7308709 Brezak et al. Dec 2007 B1
7310339 Powers et al. Dec 2007 B1
7319696 Inoue et al. Jan 2008 B2
7321926 Zhang et al. Jan 2008 B1
7324533 DeLiberato et al. Jan 2008 B1
7333999 Njemanze Feb 2008 B1
7340571 Saze Mar 2008 B2
7343413 Gilde et al. Mar 2008 B2
7349391 Ben-Dor et al. Mar 2008 B2
7373438 DeBergalis et al. May 2008 B1
7383570 Pinkas et al. Jun 2008 B2
7398552 Pardee et al. Jul 2008 B2
7409440 Jacob Aug 2008 B1
7433962 Janssen et al. Oct 2008 B2
7437478 Yokota et al. Oct 2008 B2
7454480 Labia et al. Nov 2008 B2
7490162 Masters Feb 2009 B1
7500269 Huotari et al. Mar 2009 B2
7505795 Lim et al. Mar 2009 B1
7516492 Nisbet et al. Apr 2009 B1
7522581 Acharya et al. Apr 2009 B2
7526541 Roese et al. Apr 2009 B2
7555608 Naik et al. Jun 2009 B2
7558197 Sindhu et al. Jul 2009 B1
7577723 Matsuda et al. Aug 2009 B2
7580971 Gollapudi et al. Aug 2009 B1
7590732 Rune Sep 2009 B2
7624424 Morita et al. Nov 2009 B2
7640347 Sloat et al. Dec 2009 B1
7644137 Bozak et al. Jan 2010 B2
7668166 Rekhter et al. Feb 2010 B1
7680915 Still et al. Mar 2010 B2
7684423 Tripathi et al. Mar 2010 B2
7689710 Tang et al. Mar 2010 B2
7698458 Liu et al. Apr 2010 B1
7716077 Mikurak May 2010 B1
7725093 Sengupta et al. May 2010 B2
7725657 Hasenplaugh et al. May 2010 B2
7778187 Chaturvedi et al. Aug 2010 B2
7801978 Susai et al. Sep 2010 B1
7808913 Ansari et al. Oct 2010 B2
7822839 Pruitt et al. Oct 2010 B1
7831662 Clark et al. Nov 2010 B2
7861085 Case et al. Dec 2010 B1
7895653 Calo et al. Feb 2011 B2
7903554 Manur et al. Mar 2011 B1
7908245 Nakano et al. Mar 2011 B2
7908314 Yamaguchi et al. Mar 2011 B2
7925908 Kim Apr 2011 B2
7930365 Dixit et al. Apr 2011 B2
7933946 Livshits et al. Apr 2011 B2
7945908 Waldspurger et al. May 2011 B1
7957991 Mikurak Jun 2011 B2
7958222 Pruitt et al. Jun 2011 B1
7984141 Gupta et al. Jul 2011 B2
7984500 Khanna et al. Jul 2011 B1
8024443 Jacob Sep 2011 B1
8032409 Mikurak Oct 2011 B1
8037528 Williams et al. Oct 2011 B2
8041022 Andreasen et al. Oct 2011 B1
8064342 Badger Nov 2011 B2
8069225 McCann et al. Nov 2011 B2
8103781 Wu et al. Jan 2012 B1
8130650 Allen, Jr. et al. Mar 2012 B2
8149819 Kobayashi et al. Apr 2012 B2
8155128 Balyan et al. Apr 2012 B2
8170055 Fang et al. May 2012 B2
8171124 Kondamuru May 2012 B2
8189567 Kavanagh et al. May 2012 B2
8190769 Shukla et al. May 2012 B1
8199757 Pani et al. Jun 2012 B2
8205246 Shatzkamer et al. Jun 2012 B2
8218572 Moran et al. Jul 2012 B2
8239954 Wobber et al. Aug 2012 B2
8271620 Witchey Sep 2012 B2
8274895 Rahman et al. Sep 2012 B2
8321908 Gai et al. Nov 2012 B2
8351333 Rao et al. Jan 2013 B2
8380854 Szabo Feb 2013 B2
8396836 Ferguson et al. Mar 2013 B1
8417817 Jacobs Apr 2013 B1
8447871 Szabo May 2013 B1
8447970 Klein et al. May 2013 B2
8452876 Williams et al. May 2013 B1
8463850 McCann Jun 2013 B1
8464265 Worley Jun 2013 B2
8468247 Richardson et al. Jun 2013 B1
8468267 Yigang Jun 2013 B2
8484348 Subramanian et al. Jul 2013 B2
8521851 Richardson et al. Aug 2013 B1
8521880 Richardson et al. Aug 2013 B1
8539224 Henderson et al. Sep 2013 B2
8560693 Wang et al. Oct 2013 B1
8566474 Kanode et al. Oct 2013 B2
8578050 Craig et al. Nov 2013 B2
8601000 Stefani et al. Dec 2013 B1
8606921 Vasquez et al. Dec 2013 B2
8615022 Harrison et al. Dec 2013 B2
8646067 Agarwal et al. Feb 2014 B2
8665969 Kay Mar 2014 B2
8701179 Penno et al. Apr 2014 B1
8725836 Lowery et al. May 2014 B2
8726338 Narayanaswamy et al. May 2014 B2
8737304 Karuturi et al. May 2014 B2
8769127 Selimis Jul 2014 B2
8778665 Gilde et al. Jul 2014 B2
8804504 Chen Aug 2014 B1
8819109 Krishnamurthy et al. Aug 2014 B1
8819419 Carlson et al. Aug 2014 B2
8830874 Cho et al. Sep 2014 B2
8838817 Biswas Sep 2014 B1
8873753 Parker Oct 2014 B2
8875274 Montemurro et al. Oct 2014 B2
8879431 Ridel et al. Nov 2014 B2
8886981 Baumann et al. Nov 2014 B1
8908545 Chen et al. Dec 2014 B1
8954080 Janakiriman et al. Feb 2015 B2
8958306 McCann et al. Feb 2015 B2
8959215 Koponen et al. Feb 2015 B2
9036529 Erickson et al. May 2015 B2
9037166 de Wit et al. May 2015 B2
9047259 Ho et al. Jun 2015 B1
9077554 Szabo Jul 2015 B1
9083760 Hughes et al. Jul 2015 B1
9135093 Boller Sep 2015 B2
9143451 Amdahl et al. Sep 2015 B2
9146962 Boe Sep 2015 B1
9210056 Choudhary Dec 2015 B1
9244843 Michels et al. Jan 2016 B1
9578126 Kirti et al. Feb 2017 B1
20010007560 Masuda et al. Jul 2001 A1
20010009554 Katseff et al. Jul 2001 A1
20010023442 Masters Sep 2001 A1
20010053694 Igarashi Dec 2001 A1
20020002502 Maes Jan 2002 A1
20020010757 Granik et al. Jan 2002 A1
20020010783 Primak et al. Jan 2002 A1
20020012352 Hansson et al. Jan 2002 A1
20020032777 Kawata et al. Mar 2002 A1
20020038360 Andrews et al. Mar 2002 A1
20020046291 O'Callaghan et al. Apr 2002 A1
20020049842 Huetsch et al. Apr 2002 A1
20020065848 Walker May 2002 A1
20020072048 Slattery et al. Jun 2002 A1
20020080752 Johansson et al. Jun 2002 A1
20020083067 Tamayo et al. Jun 2002 A1
20020087571 Stapel et al. Jul 2002 A1
20020087744 Kitchin Jul 2002 A1
20020095498 Chanda 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
20020112061 Shih et al. Aug 2002 A1
20020138615 Schmeling Sep 2002 A1
20020143819 Han et al. Oct 2002 A1
20020143852 Guo et al. Oct 2002 A1
20020161913 Gonzalez 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
20020198993 Cudd et al. Dec 2002 A1
20030005172 Chessell Jan 2003 A1
20030009528 Shard et al. Jan 2003 A1
20030018450 Carley Jan 2003 A1
20030018585 Butler et al. Jan 2003 A1
20030034905 Anton et al. Feb 2003 A1
20030037070 Marston Feb 2003 A1
20030046291 Fascenda Mar 2003 A1
20030051045 Connor Mar 2003 A1
20030055723 English Mar 2003 A1
20030065653 Overton et al. Apr 2003 A1
20030065951 Igeta Apr 2003 A1
20030069918 Lu et al. Apr 2003 A1
20030069974 Lu et al. Apr 2003 A1
20030070069 Belapurkar et al. Apr 2003 A1
20030074301 Solomon Apr 2003 A1
20030086415 Bernhard et al. May 2003 A1
20030105807 Thompson et al. Jun 2003 A1
20030105846 Zhao et al. Jun 2003 A1
20030105983 Brakmo et al. Jun 2003 A1
20030108000 Chaney et al. Jun 2003 A1
20030108002 Chaney et al. Jun 2003 A1
20030108052 Inoue Jun 2003 A1
20030120948 Schmidt et al. Jun 2003 A1
20030126200 Wolff Jul 2003 A1
20030128708 Inoue et al. Jul 2003 A1
20030130945 Force Jul 2003 A1
20030139934 Mandera Jul 2003 A1
20030145062 Sharma et al. Jul 2003 A1
20030145233 Poletto et al. Jul 2003 A1
20030156586 Lee et al. Aug 2003 A1
20030163576 Janssen et al. Aug 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
20030195984 Zisapel et al. Oct 2003 A1
20030208596 Carolan et al. Nov 2003 A1
20030212954 Patrudu Nov 2003 A1
20030220835 Barnes, Jr. Nov 2003 A1
20030225485 Fritz et al. Dec 2003 A1
20030229665 Ryman Dec 2003 A1
20030236995 Fretwell, Jr. Dec 2003 A1
20040003287 Zissimopoulos et al. Jan 2004 A1
20040006591 Matsui et al. Jan 2004 A1
20040015783 Lennon et al. Jan 2004 A1
20040017825 Stanwood et al. Jan 2004 A1
20040030627 Sedukhin Feb 2004 A1
20040030740 Stelting Feb 2004 A1
20040043758 Sorvari et al. Mar 2004 A1
20040059789 Shum Mar 2004 A1
20040064544 Barsness et al. Apr 2004 A1
20040064554 Kuno et al. Apr 2004 A1
20040072569 Omae et al. Apr 2004 A1
20040093361 Therrien et al. May 2004 A1
20040103283 Hornak May 2004 A1
20040111523 Hall et al. Jun 2004 A1
20040111621 Himberger et al. Jun 2004 A1
20040117493 Bazot et al. Jun 2004 A1
20040122926 Moore et al. Jun 2004 A1
20040123277 Schrader et al. Jun 2004 A1
20040133605 Chang et al. Jul 2004 A1
20040138858 Carley Jul 2004 A1
20040141185 Akama Aug 2004 A1
20040151186 Akama Aug 2004 A1
20040162058 Mottes Aug 2004 A1
20040167967 Bastian et al. Aug 2004 A1
20040177165 Masputra et al. Sep 2004 A1
20040192312 Li et al. Sep 2004 A1
20040199762 Carlson et al. Oct 2004 A1
20040210663 Phillips et al. Oct 2004 A1
20040213156 Smallwood et al. Oct 2004 A1
20040215665 Edgar et al. Oct 2004 A1
20040236826 Harville et al. Nov 2004 A1
20040255000 Simionescu et al. Dec 2004 A1
20040264472 Oliver et al. Dec 2004 A1
20040264481 Darling et al. Dec 2004 A1
20040267920 Hydrie et al. Dec 2004 A1
20040267948 Oliver et al. Dec 2004 A1
20040268358 Darling et al. Dec 2004 A1
20050004887 Igakura et al. Jan 2005 A1
20050008017 Dana et al. Jan 2005 A1
20050021703 Cherry et al. Jan 2005 A1
20050021736 Carusi et al. Jan 2005 A1
20050027841 Rolfe Feb 2005 A1
20050027869 Johnson Feb 2005 A1
20050044158 Malik Feb 2005 A1
20050044213 Kobayashi et al. Feb 2005 A1
20050052440 Kim et al. Mar 2005 A1
20050055435 Gbadegesin et al. Mar 2005 A1
20050071283 Randle et al. Mar 2005 A1
20050078604 Yim Apr 2005 A1
20050117589 Douady et al. Jun 2005 A1
20050122942 Rhee et al. Jun 2005 A1
20050122977 Lieberman Jun 2005 A1
20050154837 Keohane 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
20050187866 Lee Aug 2005 A1
20050188220 Nisson et al. Aug 2005 A1
20050198234 Leib et al. Sep 2005 A1
20050198310 Kim 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
20050256806 Tien et al. Nov 2005 A1
20050259631 Rajahalme Nov 2005 A1
20050262238 Reeves et al. Nov 2005 A1
20050273456 Revanuru et al. Dec 2005 A1
20050288939 Peled et al. Dec 2005 A1
20060031374 Lu et al. Feb 2006 A1
20060031384 Manders et al. Feb 2006 A1
20060031520 Bedekar et al. Feb 2006 A1
20060031778 Goodwin et al. Feb 2006 A1
20060036764 Yokota 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
20060059267 Cugi et al. Mar 2006 A1
20060077902 Kannan et al. Apr 2006 A1
20060077986 Rune Apr 2006 A1
20060083205 Buddhikot et al. Apr 2006 A1
20060095573 Carle et al. May 2006 A1
20060100752 Kim et al. May 2006 A1
20060106802 Giblin et al. May 2006 A1
20060111113 Waris May 2006 A1
20060112176 Liu et al. May 2006 A1
20060112272 Morioka et al. May 2006 A1
20060112367 Harris May 2006 A1
20060123210 Pritchett et al. Jun 2006 A1
20060129684 Datta Jun 2006 A1
20060130133 Andreev et al. Jun 2006 A1
20060133374 Sekiguchi Jun 2006 A1
20060135198 Lee Jun 2006 A1
20060136519 Batta Jun 2006 A1
20060140193 Kakani et al. Jun 2006 A1
20060153201 Hepper et al. Jul 2006 A1
20060156416 Huotari et al. Jul 2006 A1
20060161577 Kulkarni et al. Jul 2006 A1
20060168070 Thompson et al. Jul 2006 A1
20060168154 Zhang et al. Jul 2006 A1
20060171365 Borella Aug 2006 A1
20060179153 Lee et al. Aug 2006 A1
20060182103 Martini et al. Aug 2006 A1
20060184647 Dixit et al. Aug 2006 A1
20060209669 Nishio Sep 2006 A1
20060209853 Hidaka et al. Sep 2006 A1
20060229861 Tatsuoka et al. Oct 2006 A1
20060230148 Forecast et al. Oct 2006 A1
20060233106 Achlioptas et al. Oct 2006 A1
20060235998 Stecher et al. Oct 2006 A1
20060242300 Yumoto et al. Oct 2006 A1
20060259320 LaSalle et al. Nov 2006 A1
20060268692 Wright et al. Nov 2006 A1
20060268704 Ansari et al. Nov 2006 A1
20060268893 Lataretu Nov 2006 A1
20060270341 Kim et al. Nov 2006 A1
20060282442 Lennon et al. Dec 2006 A1
20060291483 Seta Dec 2006 A1
20060294054 Kudo et al. Dec 2006 A1
20070005807 Wong Jan 2007 A1
20070006293 Balakrishnan et al. Jan 2007 A1
20070016613 Foresti et al. Jan 2007 A1
20070016662 Desai Jan 2007 A1
20070019636 Lau et al. Jan 2007 A1
20070019658 Park et al. Jan 2007 A1
20070038994 Davis et al. Feb 2007 A1
20070297410 Yoon et al. Feb 2007 A1
20070050843 Manville et al. Mar 2007 A1
20070058670 Konduru et al. Mar 2007 A1
20070064661 Sood et al. Mar 2007 A1
20070067373 Higgins et al. Mar 2007 A1
20070067771 Kulbak et al. Mar 2007 A1
20070083646 Miller et al. Apr 2007 A1
20070086335 McCanne et al. Apr 2007 A1
20070088822 Coile et al. Apr 2007 A1
20070106796 Kudo et al. May 2007 A1
20070107048 Halls et al. May 2007 A1
20070110043 Girard May 2007 A1
20070112775 Ackerman May 2007 A1
20070118879 Yeun May 2007 A1
20070124415 Lev-Ran et al. May 2007 A1
20070124502 Li May 2007 A1
20070130255 Wolovitz et al. Jun 2007 A1
20070147246 Hurley et al. Jun 2007 A1
20070162891 Burner et al. Jul 2007 A1
20070168320 Borthakur et al. Jul 2007 A1
20070168525 DeLeon et al. Jul 2007 A1
20070192543 Naik et al. Aug 2007 A1
20070220598 Salowey Sep 2007 A1
20070233809 Brownell et al. Oct 2007 A1
20070233826 Tindal et al. Oct 2007 A1
20070250560 Wein et al. Oct 2007 A1
20070258451 Bouat Nov 2007 A1
20070297551 Choi Dec 2007 A1
20080004022 Johannesson et al. Jan 2008 A1
20080008202 Terrell et al. Jan 2008 A1
20080010372 Khedouri et al. Jan 2008 A1
20080022059 Zimmerer et al. Jan 2008 A1
20080025297 Kashyap Jan 2008 A1
20080031258 Acharya et al. Feb 2008 A1
20080034136 Ulenas Feb 2008 A1
20080072303 Syed Mar 2008 A1
20080120370 Chan et al. May 2008 A1
20080120592 Tanguay et al. May 2008 A1
20080133518 Kapoor et al. Jun 2008 A1
20080134311 Medvinsky et al. Jun 2008 A1
20080141246 Kuck et al. Jun 2008 A1
20080148340 Powell et al. Jun 2008 A1
20080151860 Sakoda et al. Jun 2008 A1
20080151931 Moran et al. Jun 2008 A1
20080159145 Muthukrishnan et al. Jul 2008 A1
20080165801 Sheppard Jul 2008 A1
20080178278 Grinstein et al. Jul 2008 A1
20080192770 Burrows et al. Aug 2008 A1
20080201599 Ferraiolo et al. Aug 2008 A1
20080205613 Lopez Aug 2008 A1
20080208917 Smoot et al. Aug 2008 A1
20080222646 Sigal et al. Sep 2008 A1
20080225710 Raja et al. Sep 2008 A1
20080229415 Kapoor et al. Sep 2008 A1
20080235508 Ran et al. Sep 2008 A1
20080239986 Xu et al. Oct 2008 A1
20080253395 Pandya Oct 2008 A1
20080256224 Kaji et al. Oct 2008 A1
20080263401 Stenzel Oct 2008 A1
20080270578 Zhang et al. Oct 2008 A1
20080279200 Shatzkamer et al. Nov 2008 A1
20080281908 McCanne et al. Nov 2008 A1
20080281944 Vorne et al. Nov 2008 A1
20080282354 Wobber et al. Nov 2008 A1
20080288661 Galles Nov 2008 A1
20080301760 Lim Dec 2008 A1
20080316922 Riddle et al. Dec 2008 A1
20090028337 Balabine et al. Jan 2009 A1
20090049230 Pandya Feb 2009 A1
20090052379 Suh Feb 2009 A1
20090070617 Arimilli et al. Mar 2009 A1
20090077619 Boyce Mar 2009 A1
20090080440 Balyan et al. Mar 2009 A1
20090089487 Kwon et al. Apr 2009 A1
20090094311 Awadallah et al. Apr 2009 A1
20090094610 Sukirya Apr 2009 A1
20090097480 Curtis et al. Apr 2009 A1
20090106413 Salo et al. Apr 2009 A1
20090119504 Van Os et al. May 2009 A1
20090124525 Shim et al. May 2009 A1
20090125496 Wexler et al. May 2009 A1
20090125532 Wexler et al. May 2009 A1
20090125955 DeLorme May 2009 A1
20090138314 Bruce May 2009 A1
20090138749 Moll et al. May 2009 A1
20090141891 Boyen et al. Jun 2009 A1
20090156204 Kim Jun 2009 A1
20090157678 Turk Jun 2009 A1
20090161542 Ho Jun 2009 A1
20090187915 Chew et al. Jul 2009 A1
20090193126 Agarwal et al. Jul 2009 A1
20090193513 Agarwal et al. Jul 2009 A1
20090196282 Fellman et al. Aug 2009 A1
20090217163 Jaroker Aug 2009 A1
20090217386 Schneider Aug 2009 A1
20090228956 He et al. Sep 2009 A1
20090241176 Beletski et al. Sep 2009 A1
20090248893 Richardson et al. Oct 2009 A1
20090265396 Ram et al. Oct 2009 A1
20090265467 Peles Oct 2009 A1
20090287935 Aull et al. Nov 2009 A1
20090289828 Hinchey Nov 2009 A1
20090292957 Bower et al. Nov 2009 A1
20090296624 Ryu et al. Dec 2009 A1
20090300161 Pruitt et al. Dec 2009 A1
20090300407 Kamath et al. Dec 2009 A1
20090316708 Yahyaoui et al. Dec 2009 A1
20090319600 Sedan et al. Dec 2009 A1
20100011434 Kay Jan 2010 A1
20100017846 Huang et al. Jan 2010 A1
20100023582 Pedersen et al. Jan 2010 A1
20100039937 Ramanujan et al. Feb 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
20100071048 Novak et al. Mar 2010 A1
20100093318 Zhu et al. Apr 2010 A1
20100103820 Fuller et al. Apr 2010 A1
20100115236 Bataineh et al. May 2010 A1
20100122091 Huang et al. May 2010 A1
20100131654 Malakapalli et al. May 2010 A1
20100136967 Du et al. Jun 2010 A1
20100150154 Viger et al. Jun 2010 A1
20100154031 Montemurro et al. Jun 2010 A1
20100165877 Shukla et al. Jul 2010 A1
20100177780 Ophir et al. Jul 2010 A1
20100179984 Sebastian Jul 2010 A1
20100188976 Rahman et al. Jul 2010 A1
20100190492 Jiang Jul 2010 A1
20100198646 Mikan Aug 2010 A1
20100228814 McKenna et al. Sep 2010 A1
20100228819 Wei Sep 2010 A1
20100242092 Harris et al. Sep 2010 A1
20100246602 Barreto et al. Sep 2010 A1
20100250497 Redlich et al. Sep 2010 A1
20100251330 Kroeselberg et al. Sep 2010 A1
20100261479 Hidaka Oct 2010 A1
20100274772 Samuels Oct 2010 A1
20100278733 Karsten et al. Nov 2010 A1
20100296402 Fraccalvieri Nov 2010 A1
20100299451 Yigang et al. Nov 2010 A1
20100306169 Pishevar et al. Dec 2010 A1
20100322250 Shetty et al. Dec 2010 A1
20100325277 Muthiah et al. Dec 2010 A1
20110040889 Garrett et al. Feb 2011 A1
20110047620 Mahaffey et al. Feb 2011 A1
20110055921 Narayanaswamy et al. Mar 2011 A1
20110066718 Susai et al. Mar 2011 A1
20110066736 Mitchell et al. Mar 2011 A1
20110072321 Dhuse Mar 2011 A1
20110075667 Li et al. Mar 2011 A1
20110078303 Li et al. Mar 2011 A1
20110098087 Tseng Apr 2011 A1
20110107077 Henderson et al. May 2011 A1
20110113095 Hatami-Hanza May 2011 A1
20110116377 Batz et al. May 2011 A1
20110116382 McCann May 2011 A1
20110153822 Rajan et al. Jun 2011 A1
20110154443 Thakur et al. Jun 2011 A1
20110158090 Riley Jun 2011 A1
20110173295 Bakke et al. Jul 2011 A1
20110184733 Yu et al. Jul 2011 A1
20110185082 Thompson Jul 2011 A1
20110188415 Graziano Aug 2011 A1
20110197059 Klein et al. Aug 2011 A1
20110202613 Craig Aug 2011 A1
20110202676 Craig et al. Aug 2011 A1
20110213911 Eldus et al. Sep 2011 A1
20110217978 Horn Sep 2011 A1
20110246800 Accpadi et al. Oct 2011 A1
20110273984 Hsu et al. Nov 2011 A1
20110277016 Hockings et al. Nov 2011 A1
20110282997 Prince et al. Nov 2011 A1
20110314178 Kanode et al. Dec 2011 A1
20110321122 Mwangi et al. Dec 2011 A1
20120016994 Nakamura Jan 2012 A1
20120030341 Jensen et al. Feb 2012 A1
20120039262 Walsh Feb 2012 A1
20120039341 Latif et al. Feb 2012 A1
20120041965 Vasquez et al. Feb 2012 A1
20120063314 Pignataro et al. Mar 2012 A1
20120066489 Ozaki et al. Mar 2012 A1
20120079055 Robinson Mar 2012 A1
20120089410 Mikurak Apr 2012 A1
20120089677 Shafran et al. Apr 2012 A1
20120094631 Pattabiraman Apr 2012 A1
20120101952 Raleigh et al. Apr 2012 A1
20120117028 Gold et al. May 2012 A1
20120124372 Dilley et al. May 2012 A1
20120129488 Patterson et al. May 2012 A1
20120150805 Pafumi et al. Jun 2012 A1
20120166582 Binder Jun 2012 A1
20120191847 Nas et al. Jul 2012 A1
20120195273 Iwamura et al. Aug 2012 A1
20120198043 Hesketh et al. Aug 2012 A1
20120224531 Karuturi et al. Sep 2012 A1
20120236824 McCann Sep 2012 A1
20120236871 Wallace Sep 2012 A1
20120254293 Winter et al. Oct 2012 A1
20120257506 Bazlamacci et al. Oct 2012 A1
20120258766 Cho et al. Oct 2012 A1
20120259722 Mikurak Oct 2012 A1
20120311153 Morgan Dec 2012 A1
20120317266 Abbott Dec 2012 A1
20130003106 Lowery et al. Jan 2013 A1
20130029726 Berionne et al. Jan 2013 A1
20130058229 Casado et al. Mar 2013 A1
20130091002 Christie et al. Apr 2013 A1
20130094519 Mann Apr 2013 A1
20130114497 Zhang et al. May 2013 A1
20130163758 Swaminathan et al. Jun 2013 A1
20130182713 Giacomoni et al. Jul 2013 A1
20130198322 Oran et al. Aug 2013 A1
20130205361 Narayanaswamy et al. Aug 2013 A1
20130238472 Fan et al. Sep 2013 A1
20130260731 Vihtari et al. Oct 2013 A1
20130279401 Sander et al. Oct 2013 A1
20130336118 Shaw Dec 2013 A1
20130336122 Baruah et al. Dec 2013 A1
20130346549 Craig et al. Dec 2013 A1
20140025823 Szabo et al. Jan 2014 A1
20140040478 Hsu et al. Feb 2014 A1
20140059678 Parker Feb 2014 A1
20140071895 Bane et al. Mar 2014 A1
20140095661 Knowles et al. Apr 2014 A1
20140099945 Singh et al. Apr 2014 A1
20140105069 Potnuru Apr 2014 A1
20140162705 de Wit et al. Jun 2014 A1
20140171089 Janakiraman et al. Jun 2014 A1
20140187199 Yan et al. Jul 2014 A1
20140269484 Dankberg et al. Sep 2014 A1
20140286316 Park et al. Sep 2014 A1
20140317404 Carlson et al. Oct 2014 A1
20150058595 Gura et al. Feb 2015 A1
20150281961 Lee Oct 2015 A1
20160127318 Hua May 2016 A1
20160142294 Mann May 2016 A1
20160219015 Ruggeri Jul 2016 A1
20180024901 Tankersley Jan 2018 A1
20190098032 Murphey Mar 2019 A1
Foreign Referenced Citations (26)
Number Date Country
2080530 Apr 1994 CA
0605088 Feb 1996 EP
744850 Nov 1996 EP
0817040 Jan 1998 EP
1081918 Mar 2001 EP
1916797 Apr 2008 EP
2744172 Jun 2014 EP
06-205006 Jul 1994 JP
6205006 Jul 1994 JP
8021924 Mar 1996 JP
2000183935 Jun 2000 JP
WO 9114326 Sep 1991 WO
WO 9505712 Feb 1995 WO
WO 9709805 Mar 1997 WO
WO 9745800 Dec 1997 WO
WO 9905829 Feb 1999 WO
WO 9906913 Feb 1999 WO
WO 9910858 Mar 1999 WO
WO 9939373 Aug 1999 WO
WO 9964967 Dec 1999 WO
WO 004422 Jan 2000 WO
WO 004458 Jan 2000 WO
WO 0058870 Oct 2000 WO
WO 0239696 May 2002 WO
WO 2006091040 Aug 2006 WO
WO 2011002777 Jan 2011 WO
Non-Patent Literature Citations (88)
Entry
F5 Networks Inc., “BIG-IP® Local Traffic Manager™: 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_ltm/manuals/product/ltm-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_ltm/manuals/product/f5-tmos-operations-guide.html>.
F5 Networks Inc., “BIG-IP® 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_ltm/manuals/product/ltm-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_ltm/releasenotes/product/relnote-ltm-12-0-0.html>.
F5 Networks Inc., “BIG-IP® 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_ltm/manuals/product/ltm-basics-12-0-0.html>.
“Diameter MBLB Support Phase 2: Generic Message Based Load Balancing (GMBLB)”, last accessed Mar. 29, 2010, pp. 1-1 0, (http://peterpan.f5net.com/twiki/bin/view/TMOS/TMOSDiameterMBLB).
“EC Tackles Mobile Data Bill Shock”, LightReading, May 11, 2012, (http://www.lightreading.com/document.asp?doc_id=220822&f_src=lrmobiledailynewsletter).
“Market Research & Releases, CMPP PoC documentation”, last accessed Mar. 29, 2010, (http://mainstreet/sites/PD/Teams/ProdMgmt/MarketResearch/Universal).
“Market Research & Releases, Solstice Diameter Requirements”, last accessed Mar. 29, 2010, (http://mainstreet/sites/PD/Teams/ProdMgmt/MarketResearch/Unisversal).
“Respond to server 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&tpage=1&v).
“Roaming”, Digital Agenda for Europe, Jan. 9, 2014, pp. 1-4, (http://ec.europa.eu/information_society/activities/roaming/index_en.htm).
“Servlet/Applet/HTML Authentication Process With Single Sign-On,” Research Disclosure 429128, Jan. 2000, pp. 163-164, IBM Corporation.
“Traffic Surges; Surge Queue; Netscaler Defense,” 2005, PowerPoint Presentation, slides 1-12, Citrix Systems, Inc.
“UDDI Overview”, Sep. 6, 2000, pp. 1-21, uddi.org, (http://www.uddi.org/).
“UDDI Technical White Paper,” Sep. 6, 2000, pp. 1-12, uddi-org, (http://www.uddi.org/).
“UDDI Version 3.0.1”, UDDI Spec Technical Committee Specification, Oct. 14, 2003, pp. 1-383, uddi.org, (http://www.uddi.org/).
Akkiraju, P., et al., Enabling Enterprise Multihoming with Cisco IOS Network Address Translation (NAT), White Paper, Cisco Systems, Inc., 1997, pp. 1-26.
Baer, T., et al., “The elements of Web services” ADTmag.com, Dec. 1, 2002, pp. 1-6, (http://www.adtmag.com).
Bates, T., et al., “Scalable Support for Multi-homed Multi-provider Connectivity”, Network Working Group, RFC 2260, Jan. 1998, pp. 1-12.
Blue Coat, “Technology Primer: CIFS Protocol Optimization,” Blue Coat Systems Inc., 2007, last accessed: Dec. 9, 2013, pp. 1-3, (http://www.bluecoat.com).
Calhoun, P., et al. “Diameter Base Protocol”, Network Working Group, Standards Track, Sep. 2003, pp. 1-147.
Crescendo Networks, “Application Layer Processing (ALP),” 2003-2009, pp. 168-186, Chapter 9, CN-5000E/5500E, Foxit Software Company.
DARPA Internet Program, “Transmission Control Protocol”, Protocol Specification, RFC: 793, Sep. 1981, pp. 1-82.
Dierks, T., et al., “The TLS Protocol”, Network Working Group, RFC 2246, Jan. 1999, version 1.0, pp. 1-75.
F5 Networks Inc., “3-DNS® 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.
F5 Networks Inc., “A Link Load Balancing Solution for Multi-Homed Networks”, F5 Networks Inc., White Paper, Oct. 2004, pp. 1-6.
F5 Networks Inc., “BIG-IP® Link Controller Reference Guide”, F5 Networks Inc., Manuel-0054-00, 2002, version 4.3, pp. 1-344.
F5 Networks Inc., “BIG-IP® Link Controller Solutions Guide”, F5 Networks Inc., Manuel-0053-01, 2002, version 4.5, pp. 1-70.
F5 Networks Inc., “BIG-IP® Reference Guide, version 4.5”, F5 Networks Inc., Sep. 2002, pp. 11-1-11-32, Seattle, Washington.
F5 Networks Inc., “Case Information Log for ‘Issues with BoNY upgrade to 4.3’”, as early as Feb. 2008.
F5 Networks Inc., “Configuration Guide for Local Traffic Management,” F5 Networks Inc., Jan. 2006, version 9.2.2, 406 pgs.
F5 Networks Inc., “Deploying the BIG-IP LTM for Diameter Traffic Management,” F5® Deployment Guide, Publication date Sep. 2010, Version 1.2, pp. 1-19.
F5 Networks Inc., “F5 Diameter RM”, Powerpoint document, Jul. 16, 2009, pp. 1-7.
F5 Networks Inc., “F5 Signaling Delivery Controller (SDC)”, F5 Networks Inc., User Guide, Feb. 2015, catalog No. RG-014-405-6 Ver.8., pp. 1-266.
F5 Networks Inc., “F5 Signaling Delivery Controller, Release Notes, 4.4 CF 4”, F5 Networks Inc., RG-015-44-61, Jun. 2015, version 2, pp. 1-54.
F5 Networks Inc., “F5 Signaling Delivery Controller, SS7 Diameter Interworking Function, 4.4”, F5 Networks Inc., FD-015-44-35, May 2015, version 2, pp. 1-50.
F5 Networks Inc., “F5 Signaling Delivery Controller, User Guide, 4.4”, F5 Networks Inc., RG-015-44-22, Jun. 2015, version 2, pp. 1-267.
F5 Networks Inc., “F5 Signaling Delivery Controller”, F5 Networks Inc., Product Description, Mar. 2014, catalog No. GD-014-405-4 Ver.2., pp. 1-90.
F5 Networks Inc., “F5 Signaling Delivery Controller™”, F5 Networks Inc., Release Notes, Jul. 2015, catalog No. RG-015-405-56 Ver.1., pp. 1-119.
F5 Networks Inc., “F5 WANJet CIFS Acceleration”, White Paper, F5 Networks Inc., Mar. 2006, pp. 1-5, Seattle, Washington.
F5 Networks Inc., “High availability and intelligent routing for multi-homed networks”, F5 Networks Inc., BIG-IP Link Controller, 2003, pp. 1-5.
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/f5producs/3dns/relatedMaterials/UsingF5.html).
F5 Networks, Inc., “BIG-IP Controller with Exclusive OneConnect Content Switching Feature Provides a Breakthrough System for Maximizing Server and Network Performance,” Press Release, May 8, 2001, 2 pages, Las Vegas, Nevada.
Fajardo V., “Open Diameter Software Architecture,” Jun. 25, 2004, pp. 1-6, Version 1.0.7.
Fielding et al., “Hypertext Transfer Protocol—HTTP/1.1,” Network Working Group, RFC: 2616, Jun. 1999, pp. 1-176.
Floyd et al., “Random Early Detection Gateways for Congestion Avoidance,” Aug. 1993, pp. 1-22, IEEE/ACM Transactions on Networking, California.
Freier A., et al., “The SSL Protocol”, Transport Layer Security Working Group, Nov. 18, 1996, version 3.0, pp. 1-65.
Gupta et al., “Algorithms for Packet Classification”, Computer Systems Laboratory, Stanford University, CA, Mar./Apr. 2001, pp. 1-29.
Heinz II. G., “Priorities in Stream Transmission Control Protocol (SCTP) Multistreaming”, Thesis submitted to the Faculty of the University of Delaware, Spring 2003, pp. 1-35.
Hochmuth, Phil, “F5, CacheFlow pump up content-delivery lines,” Network World Fusion, May 4, 2001, 1 page, Las Vegas, Nevada.
Ilvesmaki M., et al., “On the capabilities of application level traffic measurements to differentiate and classify Internet traffic”, Presented in SPIE's International Symposium ITcom, Aug. 19-21, 2001, pp. 1-11, Denver, Colorado.
International Search Report for International Patent Application No. PCT/US2012/038228 (dated Oct. 19, 2012).
International Search Report for International Patent Application No. PCT/US2013/026615 (dated Jul. 4, 2013).
Internet Protocol,“DARPA Internet Program Protocol Specification”, (RFC:791), Information Sciences Institute, University of Southern California, Sep. 1981, pp. 1-49.
Kawamoto, D., “Amazon files for Web services patent”, CNET News.com, Jul. 28, 2005, pp. 1-2, (http://news.com).
LaMonica M., “Infravio spiffs up Web services registry idea”, CNET News.com, May 11, 2004, pp. 1-2, (http://www.news.com).
MacVittie, L., “Message-Based Load Balancing: Using F5 solutions to address the challenges of scaling Diameter, RADIUS, and message-oriented protocols”, F5 Technical Brief, 2005, pp. 1-9, F5 Networks Inc., Seattle, Washington.
Meyer D., “Europe agrees on changes for cheaper roaming”, ZDNet, Mar. 28, 2012, pp. 1-2, (http://www.zdnet.co.uk/news/regulation/2012/03/28/europe-agrees-on-changes-for-cheaper-roaming-40154908/).
Microsoft Corporation, “Windows Server 2003 Kerberos Extensions,” Microsoft TechNet, 2003 (Updated Jul. 31, 2004), http://technet.microsoft.com/enus/library/cc738207.
Modiano E., “Scheduling Algorithms for Message Transmission Over a Satellite Broadcast System,” MIT Lincoln Laboratory Advanced Network Group, Nov. 1997, pp. 1-7.
Needham J., “Link Load Balancers Smooth Web Traffic”, F5 Networks Inc., Network World Fusion, Sep. 16, 2002, pp. 1, (http://www.f5.com/about/lnews/news-articles/archive/20020916).
Nichols K., et al., “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers”, (RFC:2474) Network Working Group, Dec. 1998, pp. 1-19, (http://www.ietf.org/rfc/rfc2474.txt).
Oracle, “Oracle Communications Converged Application Server”, Diameter Application Development Guide, Release 5.1, Dec. 2012.
Ott D., et al., “A Mechanism for TCP-Friendly Transport-level Protocol Coordination”, USENIX Annual Technical Conference, Jun. 10, 2002, University of North Carolina at Chapel Hill, pp. 1-12.
OWASP, “Testing for Cross site scripting”, OWASP Testing Guide v2, Table of Contents, Feb. 24, 2011, pp. 1-5, (www.owasp.org/index.php/Testing_for_Cross_site_scripting).
Padmanabhan V., et al., “Using Predictive Prefetching to Improve World Wide Web Latency”, SIGCOM, Jul. 1, 1996, pp. 1-15.
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.
Rosen E., et al., “MPLS Label Stack Encoding”, (RFC:3032) Network Working Group, Jan. 2001, pp. 1-22, (http://www.ietf.org/rfc/rfc3032.txt).
Schaefer, Ken, “IIS and Kerberos Part 5—Protocol Transition, Constrained Delegation, S4U2S and S4U2P,” Jul. 18, 2007, 21 pages, http://www.adopenstatic.com/cs/blogs/ken/archive/2007/07/19/8460.aspx.
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).
Shohoud, Y., “Building XML Web Services with VB .NET and VB 6”, Addison Wesley, Sep. 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.
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.
Snoeren A., et al., “Managing Cloud Resources: Distributed Rate Limited”, Building and Programming the Cloud Workshop, Jan. 13, 2010, pp. 1-38, UCSDCSE Computer Science and Engineering.
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-8, (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/).
Stuckmann P., “EU Roaming Regulation—towards structural solutions” European Commission Information Society and Media, Mar. 2012, pp. 1-22, (http://www.wto.org/english/tratop_e/serv_e/sym_march12_e/presentation_stuckmann.pdf).
Telekom, Austria Group., “Unbundling roaming services”, Telekom, Austria Group, Feb. 2011, pp. 1-21, (http://www.google.nl/search?q=unbundling+roaming+mvno+ec&ie=UTF-8&oe=UTF-8&hl=nl&client=safari).
Traffix Systems, “Diameter Edge Agent (DEA)”, Jul. 2, 2012, pp. 2-5, (http://www.traffixsystemscomsolutionsedge-routing-DEA).
Traffix Systems, “Product Brochure, Traffix Signaling Deliver Controller™ (SDC)”, Mar. 2011, pp. 1-11, F5 Networks Inc.
Traffix Systems, “Signaling Deliver Controller™: Control Your 4G Network”, Data Sheet, Mar. 2011, pp. 1-6, F5 Networks Inc.
Wang B., “Priority and realtime data transfer over the best-effort Internet”, Dissertation Abstract,ScholarWorks@UMASS, Sep. 2005, pp. i-xiv and pp. 1-9.
Wikipedia, “Diameter (protocol)”, pp. 1-11, last accessed Oct. 27, 2010, (http://en.wikipedia.org/wiki/Diameter_(protocol)).
Williams et al., “The Ultimate Windows Server 2003 System Administrator's Guide: Forwarding Authentication,” 2003, 2 pages, Figure 10.7, Addison-Wesley Professional, Boston, Massachusetts.
Woo T.Y.C., “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, abstract only, (http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?amumber=832499).
Provisional Applications (1)
Number Date Country
62416214 Nov 2016 US