Application layer network traffic prioritization

Information

  • Patent Grant
  • 9143451
  • Patent Number
    9,143,451
  • Date Filed
    Friday, January 25, 2013
    12 years ago
  • Date Issued
    Tuesday, September 22, 2015
    9 years ago
Abstract
Layer-7 application layer message (“message”) classification is disclosed. A network traffic management device (“NTMD”) receives incoming messages over a first TCP/IP connection from a first network for transmission to a second network. Before transmitting the incoming messages onto the second network, however, the NTMD classifies the incoming messages according to some criteria, such as by assigning one or more priorities to the messages. The NTMD transmits the classified messages in the order of their message classification. Where the classification is priority based, first priority messages are transmitted over second priority messages, and so forth, for example.
Description
TECHNICAL FIELD

The technology relates generally to network communications and, more particularly, to prioritizing network traffic at the Layer-7 application layer.


BACKGROUND

The enormous growth in network communications has been due in part to software applications' increased abilities to interact with each other across Wide Area Networks (“WANs”). The transmission of large amounts of data across WANs, however, creates special challenges for achieving a high degree of application and network performance. To fully appreciate the extent of these challenges, a brief primer on basic network concepts will now be provided for background purposes, beginning with a discussion on the Open Systems Interconnection (“OSI”) conceptual network model.


The OSI model is commonly used to define the flow of data, or “network traffic,” over a network between network applications and/or devices. The OSI model has seven layers including the application layer (“Layer-7”), the presentation layer (“Layer-6”), the session layer (“Layer-5”), the transport layer (“Layer-4”), the network layer (“Layer-3”), the data link layer (“Layer-2”), and the physical layer (“Layer-1”). Each OSI layer communicates with a layer above and/or below it and with corresponding layer(s) on other applications and/or devices in the network through specific protocols. The network layers are often referred to as “the network stack,” and the most common protocols in which these layers are implemented are the TCP/IP protocols.


The TCP portion of the protocol corresponds to the Layer-4 transport layer in the OSI model. The IP portion of the protocol defines standards for data packets that may comprise data message(s) at the Layer-7 application layer. The TCP/IP protocols ensure the reliable, in order delivery of data. For instance, an application on a first device (e.g., client) may request that data be sent to another application at a second device (e.g., server).


The client's TCP/IP stack, typically implemented in the operating system kernel, may eventually partition the data into Layer-7 application layer messages to be transmitted over a Layer-1 physical connection. The data transmitted is typically acknowledged as it is received in a specified order, and lack of an acknowledgement from its intended recipient often results in portions of the data being resent. When portions of data are received out of sequence, however, the TCP/IP regime nevertheless requires waiting for the remaining portions of data before any processing can be performed by the recipient upon the data, a condition known as “head of line blocking.”


The growing complexity and sophistication of more elegant network application solutions recently, however, have been increasingly frustrated by the rigidity of the TCP/IP approach. For instance, while the TCP/IP protocols ensure the reliable, in order delivery of data, they do not recognize acceptable exceptions for violating the in order delivery of data maxim. As network applications become ever more sophisticated, the ability to send data out of order may help overcome TCP/IP's limitations and sustain their continued growth.


SUMMARY

Broadly stated, application layer message classification techniques are disclosed, which at a high-level may involve classifying otherwise unclassified incoming Layer-7 application layer messages (“messages”) in network bound traffic, received by a network traffic management device through a first TCP/IP connection, according to some criteria. The network traffic management device may transmit the classified messages pertaining to selected message classifications ahead of other classified messages pertaining to unselected classifications through one of the several second TCP/IP connections.


Further, the messages may be classified independent of any packet-level prioritization information included in the data packets forming the messages. Furthermore, the criteria upon which the messages may be classified to create the different message classifications may include prioritization, such as prioritizing certain messages ahead of others based on one or more message characteristics, although the messages could be prioritized based on any number of other factors, such as network conditions, message content, and the like.





BRIEF DESCRIPTION OF THE DRAWINGS

The same reference numerals and/or other reference designations employed throughout the ensuing drawings are used to identify identical components, except as provided otherwise.



FIG. 1 is a diagram of an example message prioritization system environment;



FIG. 2 is a diagram of an example network management device that implements a message prioritization module that may be used in the message prioritization system environment shown in FIG. 1;



FIG. 3 is a flow chart of a message prioritization process that may be performed by at least one of the network management devices shown in FIG. 1;



FIG. 4 is a functional block diagram of an example message prioritization module from FIG. 2 that may be implemented; and



FIG. 5 is a flow chart of at least a portion of the message prioritization process shown in FIG. 3 for sending prioritized messages over a network.





DETAILED DESCRIPTION

Referring to FIGS. 1 and 2, a simplified example message prioritization system environment 100 is shown. Generally, at least one of the first and second network traffic management devices 200, 500 shown in FIG. 1 may employ a message prioritization module 210 that receives un-prioritized messages 212 through an un-prioritized TCP/IP connection 214 to be prioritized and transmitted as first and second priority messages 216, 218 through first and second priority TCP/IP connections 217, 219, respectively, onto a wide area network (“WAN”) 130. The message prioritization system environment 100 enables prioritizing application-layer messages and sending messages out of order without incurring head of line blocking problems, among other potential benefits.


Referring now specifically to FIG. 1, the example message prioritization system environment 100 may include a first local area network (“LAN”) 110 in communication with a second LAN 120 over WAN 130, although other network environments could be used.


First LAN 110 may include one or more first server devices 112, one or more first client devices 114, and one or more first network traffic management devices 200, although the LAN 110 may also include one or more additional intermediary network devices in communication with each other via one or more wired and/or wireless network links, such as switches, routers, modems, or gateways (not shown), and the like, as well as other types of network devices including network storage devices.


Furthermore, the various devices in the first LAN 110 (e.g., first server device 112, first client device 114) may communicate and interact with other devices in second LAN 120 (e.g., second server device 122, second client device 124) over WAN 130 via the first network traffic management device 200. In other words, the first network traffic management device 200 may be said to sit “at the edge” of the first LAN 110. That way, all or portions of in-bound and/or out-bound network traffic to/from the devices in LAN 110 may pass through the first traffic management device 200 onto WAN 130 eventually to the devices in LAN 120 through the second traffic management device 500. However, if one of network management devices 200, 500 is not present in either the first and second LANs 110, 120, respectively, then the LAN 120, 130 devices may communicate over the WAN 130 directly as they would in any conventional network environment absent one of the devices 200, 500.


As will be described in greater detail herein, the devices in at least one of the first and second LANs 110, 120 (i.e., first and second clients 114, 124; first and second servers 112, 122) may send network bound un-prioritized message level network traffic through at least one of network traffic management devices 200, 500, respectively, which in turn may prioritize and send the prioritized messages over the WAN 130. In the example in FIG. 1, improved communication may result between first LAN 110 and second LAN 120.


Second LAN 120 is identical to first LAN 110 in this example, except LAN 120 instead includes second server devices 122 and second client devices 124, although LAN 120 may include a fewer or greater number of the same or different devices (e.g., network devices, network storage devices, etc.).


It should be noted that in the example message prioritization system environment 100 shown in FIG. 1, one of the first or second network management devices 200, 500 alternatively may not be present. If both the first or second network management devices 200, 500 are utilized in the environment 100, however, it should also be noted that just one of the devices could implement the message prioritization module 210 shown in FIG. 2, although both devices could certainly implement the module 210.


Finally, each of the first LAN 110, second LAN 120 and WAN 130 illustrated in FIG. 1 may comprise any network environment using any suitable interface mechanisms and communications technologies including, for example telecommunications in any suitable form (e.g., voice, modem, and the like), Public Switched Telephone Network (PSTNs), Packet Data Networks (PDNs), the Internet, intranets, a combination thereof, and the like.


Referring specifically to FIG. 2, the first network management device 200 may include processor 202, memory 204, I/O interface 206, and network interface 208, all or some of which may be communicatively interconnected via one or more buses and/or other communication links, although the first network management device 200 may include a fewer or greater number of the same or different components.


Processor 202 may include one or more microprocessors configured to execute one or more machine readable and executable instructions stored in memory 204 to implement network traffic related management functions of the first traffic management device 200 in addition to prioritizing messages as described herein in connection with FIGS. 2-5, although processor 202 may comprise other types and/or combinations of processors, such as digital signal processors, micro-controllers, application specific integrated circuits (“ASICs”), programmable logic devices (“PLDs”), field programmable logic devices (“FPLDs”), field programmable gate arrays (“FPGAs”), and the like, programmed or configured according to the teachings as described and illustrated herein with respect to FIGS. 2-5.


Memory 204 may include volatile storage, non-volatile storage and/or disk storage that may store one or more machine readable and executable instructions, programs and/or data, which when retrieved or read and executed by processor 202, may implement at least a portion of the message prioritization module 210 and/or the message prioritization processes illustrated and described herein in connection with FIGS. 3-5, although some or all of the programmed instructions could be stored and/or executed elsewhere. Moreover, memory 204 may comprise a variety of different types of memory storage devices, such as RAM, ROM, floppy disk storage, hard disk, CD-ROM, DVD ROM, or any other computer readable media, which may be read from and/or written to by a magnetic, optical, or other reading and/or writing system that may be communicatively coupled to processor 202.


The I/O interface 206 may include one or more device and/or peripheral ports that communicatively couple the first management device 200 with one or more other devices, such as first server devices 112 and first client devices 114, and/or peripherals, such as keyboards, mice and display devices (not illustrated), for enabling operators to control the management device 200 for performing configuration operations and the like, for example, although other types and numbers of devices and peripherals could be used for controlling the device to perform a variety of other operations.


The network interface 208 may include one or more host bus adapters (“HBAs”) or controllers, such as network cards (e.g., Ethernet and Novell network interface cards), which may communicatively couple the first network management device 200 to the first LAN 110 and the second LAN 120 over the WAN 110, although other types of network HBAs could be used, including Fibre channel, SCSI and/or iSCSI storage networking HBAs, and the like.


It should be noted that one or more of the above-described components in first network management device 200 could be implemented by software, hardware, firmware and combinations thereof. Also, some or all of the machine readable and executable instructions represented by the functional block diagrams and flowcharts depicted in FIGS. 2-5, respective, may be implemented manually. Further, although the example processes are described with reference to the flowcharts illustrated in FIGS. 3 and 5, ordinary skilled persons in the computer, software and networking arts will readily appreciate that many other methods of implementing the example machine readable and executable instructions may alternatively be used. For example, the order of execution of the blocks may be changed, and/or some of the blocks described may be changed, eliminated, or combined.


Referring back specifically to FIG. 1, the second network management device 500 may be identical to the first network management device 200, although the second network management device 500 may include different and/or a fewer or greater number of components.


Referring generally to FIGS. 3-5, portions of a message prioritization process will be described with occasional reference back to FIGS. 1-2. Referring now specifically to FIGS. 3 and 4, the operation of the message prioritization module 210 implemented in at least one of the first and second traffic management devices 200, 500 to perform a first portion of the message prioritization process 500 for prioritizing incoming un-prioritized messages 212 will now be described.


Beginning in step 510, the message prioritization module 210 may obtain one or more incoming un-prioritized messages 212 (i.e., MESSAGE 1, MESSAGE 2) received by the first network management device 200 over an un-prioritized TCP/IP connection 214. The incoming un-prioritized messages 212 may originate from one or more of the first server devices 112 and/or the first client devices 114, and their destination may include one or more of the second server devices 122 and/or second client devices 124 in the second LAN 120 by way of the second network management device 500 and/or the WAN 130.


In step 520, the message prioritization module 210 may store one of the received incoming un-prioritized messages 212, such as MESSAGE 1, in any one of the first and second buffers 306(1), 306(2) that may be free or otherwise have storage capacity within the message buffer pool 304. Accordingly, the message prioritization module 210 may retrieve one of the free first or second buffers 306(1), 306(2) from the message buffer pool 304, and the module 210 may read one of the incoming un-prioritized messages 212 (e.g., MESSAGE 1) into the buffer.


As the message prioritization module 210 receives one or more other incoming un-prioritized messages 212 (e.g., MESSAGE 2), the module 210 may likewise store the messages 212 in an available one of the first and second buffers 306(1), 306(2) maintained in memory 204. If there are no available first and second buffers 306(1), 306(2) within the message buffer pool 304, however, then one or more of the other incoming un-prioritized messages 212 may be dropped.


In step 530, the message prioritization module 210 may classify the un-prioritized messages 212 (e.g., MESSAGE 1, MESSAGE 2) from the first and second buffers 306(1), 306(2) in the message buffer pool 304 in some manner. Examples include prioritizing each of the messages 212 based on one or more factors including characteristics of the messages themselves with respect to each other (e.g., every other message is high priority, etc.), although the messages could be classified based on any number of other factors including network conditions, payload message content, protocol header values or any other Layer-7 characteristic of the network traffic, and the like.


The message prioritization module 210 may specify the classification (e.g., prioritization) information in the data packet headers of each data packet forming each message. In this example, prioritizing the un-prioritized messages 212 may result in first priority messages 216 and second priority messages 218. Whichever method the message prioritization module 210 employs to classify the un-prioritized messages 212, however, the module 210 may simply maintain these message classifications (e.g., prioritizations) in memory 204 for each of the messages 212 in the message buffer pool 304 for subsequent processing as described herein.


Furthermore, the message prioritization module 210 may optionally enhance the classification effects by marking or coloring the DSCP, ToS bits, and/or MPLS bits in the headers of each data packet forming the classified messages (e.g., first and second priority messages 216, 218), although other coloring methods could be utilized. By coloring the first and second priority messages 216, 218, intermediary network devices in the example message prioritization system environment 100 may be able to make intelligent QoS decisions without requiring Layer-7 processing capabilities.


In step 540, the message prioritization module 210 may queue one of the first priority messages 216 and second priority messages 218 from the message buffer pool 304 onto the appropriate one of the corresponding first and second TCP/IP socket handlers 310, 312, for transmitting over the WAN 130. For instance, MESSAGE 2 may be prioritized as one of the first priority messages 216 and MESSAGE 1 may be prioritized as one of the second priority messages 218, although MESSAGE 1 could instead be prioritized as a first priority message 216 and MESSAGE 2 could be prioritized as a second priority message 218, both MESSAGE 1 and MESSAGE 2 could be prioritized as first priority messages 216, or both MESSAGE 1 and MESSAGE 2 could be prioritized as second priority messages 218.


In this example, the message prioritization module 210 may then instruct the network interface 208 to transmit the first priority messages 216 (e.g., MESSAGE 2) ahead of the second priority messages 218 (e.g., MESSAGE 1) through the first priority TCP/IP connection 217, and the network interface 208 may begin transmitting as described in greater detail below in connection with FIG. 5.


It should be noted, however, that the recipient of the transmitted first or second priority messages 216, 218, which in this example include one or more devices in the second LAN 120 (i.e., second network traffic management device 500, second server devices 122, second client devices 124, and/or applications operating on any of the foregoing), may read the messages 216, 218 from the established first and second priority TCP/IP connections 217, 219, respectively, in the same manner as they would any other messages transmitted over TCP/IP connections. Alternatively, the second traffic management device 500 could be configured to instead read the messages 216, 218 from the first and second priority TCP/IP connections 217, 219, respectively, and then write the messages back to a single TCP connection established with the intended recipient (i.e., second server 122, second client 124, and/or applications operating on any of the foregoing) in such a fashion as to preserve message boundaries.


Referring now specifically to FIG. 5, a second portion of the message prioritization process 600 for transmitting first and second priority messages 216, 218 over WAN 130 will now be described with reference back to FIGS. 1, 2 and 4. It should be noted that this second portion of the message prioritization process 600 may be performed whilst steps 510-540 from the first portion of the message prioritization process 500 are performed, although the first and second portions 500, 600 could be performed sequentially.


Beginning in step 610, the message prioritization module 210 may select one of the priority assigned TCP/IP socket handlers 308 selected to represent the highest priority socket, such the first priority TCP/IP socket handler 310 in this example, although other TCP/IP sockets could instead be initially selected, such as the second priority TCP/IP socket handler 312.


In decision block 620, the message prioritization module 210 determines whether there are one or more prioritized messages queued on the selected one of the priority assigned TCP/IP socket handlers 308 (e.g., first priority TCP/IP socket handler 310) for transmitting onto the WAN 130. If there is at least one queued message remaining on the selected one of the priority assigned TCP/IP socket handlers 380 (e.g., first priority socket 310), then the YES branch is followed to step 630, otherwise if there are no remaining messages queued on the selected socket handlers, the NO branch is followed to step 640.


In step 630, the message prioritization module 210 selects one or more messages queued on the selected one of the priority assigned TCP/IP socket handlers 308 for transmitting over the WAN 130, and transmits them. In this example, the prioritization module 212 may select first priority messages 216 queued on the first priority TCP/IP socket handlers 310 for transmitting over a first priority TCP/IP connection 217 before selecting any other prioritized messages queued on any other socket handlers 308, such as second priority messages 218.


By permitting the priority assigned TCP/IP socket handler 308 having the highest priority with one or more queued messages to transmit its queued messages onto the WAN 130 ahead of the other (e.g., lower) priority socket handlers, high priority messages are expedited over low priority messages without requiring rate shaping of any kind. Furthermore, with each classification or priority corresponding to a TCP connection (e.g., first and second TCP/IP connections 217, 219), intermediary QoS network devices in the example message prioritization system environment 100 may now apply data packet based quality of service techniques to the distinct TCP/IP streams without incurring head of line blocking problems.


In decision block 640, the message prioritization module 210 may determine whether the selected one of the priority assigned TCP/IP socket handlers 308 has the lowest priority among the other sockets. If the selected one of the socket handlers 308 does not have the lowest priority, then the NO branch is followed to step 650, otherwise if the selected socket has the lowest priority, then the YES branch is followed back up to step 610 where the highest priority socket is reselected and steps 620-630 may be repeated as described above.


In step 650, the message prioritization module 210 may select one of the priority assigned TCP/IP socket handlers 308 selected to represent the next lower priority socket, such as the second priority TCP/IP socket handler 312 in this example. Once the next lower priority assigned TCP/IP socket handler 308 is selected, steps 620-630 may be repeated as described above. Thus, higher priority messages may be selected and transmitted before lower priority messages.


In decision block 660, the message prioritization module 210 may determine at any time during steps 620-650, as well as during any of the steps 510-540 from the first portion of the prioritization process 500 described earlier, that there are newly queued messages on another one of the priority assigned TCP/IP socket handlers 308 having a higher priority than the presently selected one of the priority assigned TCP/IP socket handlers 308 (e.g., first and second priority socket handlers 310, 312), as indicated by the dashed lines. If there are newly queued messages on another one of the priority assigned TCP/IP socket handlers 308 having a higher priority than the presently selected one of the priority assigned TCP socket handlers 308, then one of steps 520-540 and/or 620-650 may be interrupted when the determination is made, and the YES branch followed to step 670.


A potential problem or adverse condition may arise from always selecting or at least favoring one or more of the priority assigned TCP/IP socket handlers 308 having queued messages and being assigned a higher or highest priority than a presently selected TCP/IP socket handler 308, however, in that the other lesser priority socket handlers could wind up being “starved” under certain conditions. For instance, if a relatively small number of first priority messages 216 with a higher priority than the second priority messages 218 are consistently queued in the first priority TCP/IP socket handler 310, then the lower priority second priority messages 218 may be substantially less likely to be transmitted.


While such a condition could be desired in some environments, it may create adverse effects in others. Where mitigating these effects is a concern, however, the amount of time that the message prioritization module 210 may dedicate towards transmitting prioritized messages queued on any one or more of the priority assigned socket handlers 308 may be metered out, for example, although a variety of other methods could be employed to prevent any one or more of the sockets 308 from being overly monopolized.


In step 670, the message prioritization module 210 may select the higher priority one of the assigned TCP/IP socket handlers 308 determined to have one or more newly queued messages, and steps 620-650 may be performed in the same manner described above.


In conclusion, the portions of the message prioritization processes 500 and 600 described above, as implemented by the message prioritization module 210 employed in at least one of the network traffic management devices 200, 500 shown in FIG. 1, may have a number of useful practical applications. For example, where at least one of the network traffic management devices 200, 500 employing the message prioritization module 210 also functions to accelerate network traffic, the message prioritization module 210 may be configured to prioritize client issued messages over messages that result from “object pre-fetching” or other predictive techniques. Without such prioritization in this example, prediction-based network traffic might otherwise negatively impact client issued requests whenever the predictions fail. Prioritization in this case might help ensure proper performance even in the event of a miss prediction.


It should be appreciated that some portions of the detailed description have been presented in terms of procedures, steps, logic blocks, processing, and other symbolic representations of operations on data bits that can be performed on computer memory. A procedure, computer/machine executed step, action, logic block, process, etc., are here conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those utilizing physical manipulations of physical quantities. These quantities can take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer and/or processing system. Further, these signals may have been referred to at times as bits, values, elements, symbols, characters, terms, numbers, or the like. Finally, each step may be performed by hardware, software, firmware, or combinations thereof.


Thus, it will be rather apparent to those skilled in the computer, software and networking arts 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 this disclosure. 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 claim scope and coverage is to be limited only by the following claims and equivalents thereto.

Claims
  • 1. A network traffic management device comprising: a memory capable of storing computer-executable instructions;a transceiver capable of sending or receiving data packets over a network from or to at least a second network device; anda processor capable of executing the stored computer-executable instructions to perform actions, in cooperation with the transceiver, the actions comprising: receiving a plurality of un-prioritized application layer messages; andclassifying at least one of the un-prioritized application layer messages as having a first priority of transmission to the second network device and at least another one of the un-prioritized application layer messages as having a second priority of transmission to the second network device, the second priority application layer message having a higher transmission priority than the first priority application layer message, wherein the classification is based on one or more application layer characteristics of a respective plurality of data packets that together comprise each of the classified application layer messages and is independent of any network layer information, wherein one or more of the un-prioritized application layer messages comprise a plurality of network layer data packets having a same priority.
  • 2. The device of claim 1, wherein one or more of the plurality of data packets of one or more of the first or second priority application layer messages are prioritized differently than the first or second priority of transmission of a corresponding one of the first or second priority application layer messages.
  • 3. The device of claim 1, wherein the actions further include: transmitting a subset of the plurality of data packets that together comprise the first priority application layer message;detecting the second priority application layer message;transmitting the second priority application layer message; andcompleting transmission of the first priority application layer message after the transmission of the second priority application layer message.
  • 4. A network traffic management device comprising: a memory capable of storing computer-executable instructions;a transceiver capable of sending or receiving data packets over a network from or to at least a second network device; anda processor capable of executing the stored computer-executable instructions to perform actions, in cooperation with the transceiver, the actions comprising: receiving a plurality of un-prioritized application layer messages; andclassifying at least one of the un-prioritized application layer messages as having a first priority of transmission to the second network device and at least another one of the un-prioritized application layer messages as having a second priority of transmission to the second network device, the second priority application layer message having a higher transmission priority than the first priority application layer message, wherein the classification is based on one or more application layer characteristics of a respective plurality of data packets that together comprise each of the classified application layer messages and is independent of any network layer information, wherein one or more of the un-prioritized application layer messages comprise one or more network layer data packets having a different priority than one or more other network layer data packets of the one or more of the un-prioritized application layer messages.
  • 5. The device of claim 4, wherein one or more of the plurality of data packets of one or more of the first or second priority application layer messages are prioritized differently than the first or second priority of transmission of a corresponding one of the first or second priority application layer messages.
  • 6. The device of claim 4, wherein the actions further include: transmitting a subset of the plurality of data packets that together comprise the first priority application layer message;detecting the second priority application layer message;transmitting the second priority application layer message; andcompleting transmission of the first priority application layer message after the transmission of the second priority application layer message.
  • 7. A method for prioritizing network traffic, the method comprising: receiving, by a network traffic management device, a plurality of un-prioritized application layer messages; andclassifying, by the network traffic management device, at least one of the un-prioritized application layer messages as having a first priority of transmission to the second network device and at least another one of the un-prioritized application layer messages as having a second priority of transmission to the second network device, the second priority application layer message having a higher transmission priority than the first priority application layer message, wherein the classification is based on one or more application layer characteristics of a respective plurality of data packets that together comprise each of the classified application layer messages and is independent of any network layer information, wherein one or more of the un-prioritized application layer messages comprise a plurality of network layer data packets having a same priority.
  • 8. The method of claim 7, wherein one or more of the plurality of data packets of one or more of the first or second priority application layer messages are prioritized differently than the first or second priority of transmission of a corresponding one of the first or second priority application layer messages.
  • 9. The method of claim 7, further comprising: transmitting, with the network traffic management device, a subset of the plurality of data packets that together comprise the first priority application layer message;detecting, with the network traffic management device, the second priority application layer message;transmitting, with the network traffic management device, the second priority application layer message; andcompleting, with the network traffic management device, transmission of the first priority application layer message after the transmission of the second priority application layer message.
  • 10. A method for prioritizing network traffic, the method comprising: receiving, by a network traffic management device, a plurality of un-prioritized application layer messages; andclassifying, by the network traffic management device, at least one of the un-prioritized application layer messages as having a first priority of transmission to the second network device and at least another one of the un-prioritized application layer messages as having a second priority of transmission to the second network device, the second priority application layer message having a higher transmission priority than the first priority application layer message, wherein the classification is based on one or more application layer characteristics of a respective plurality of data packets that together comprise each of the classified application layer messages and is independent of any network layer information, wherein one or more of the un-prioritized application layer messages comprise one or more network layer data packets having a different priority than one or more other network layer data packets of the one or more of the un-prioritized application layer messages.
  • 11. The method of claim 10, wherein one or more of the plurality of data packets of one or more of the first or second priority application layer messages are prioritized differently than the first or second priority of transmission of a corresponding one of the first or second priority application layer messages.
  • 12. The method of claim 10, further comprising: transmitting, by the network traffic management device, a subset of the plurality of data packets that together comprise the first priority application layer message;detecting, by the network traffic management device, the second priority application layer message;transmitting, by the network traffic management device, the second priority application layer message; andcompleting, by the network traffic management device, transmission of the first priority application layer message after the transmission of the second priority application layer message.
  • 13. A non-transitory computer readable medium having stored thereon instructions for prioritizing network traffic comprising machine executable code which when executed by a processor, causes the processor to perform steps comprising: receiving a plurality of un-prioritized application layer messages; andclassifying at least one of the un-prioritized application layer messages as having a first priority of transmission to the second network device and at least another one of the un-prioritized application layer messages as having a second priority of transmission to the second network device, the second priority application layer message having a higher transmission priority than the first priority application layer message, wherein the classification is based on one or more application layer characteristics of a respective plurality of data packets that together comprise each of the classified application layer messages and is independent of any network layer information, wherein one or more of the un-prioritized application layer messages comprise a plurality of network layer data packets having a same priority.
  • 14. The medium of claim 13, wherein one or more of the plurality of data packets of one or more of the first or second priority application layer messages are prioritized differently than the first or second priority of transmission of a corresponding one of the first or second priority application layer messages.
  • 15. The medium of claim 13, wherein the machine executable code when executed by the processor further causes the processor to perform steps further comprising: transmitting a subset of the plurality of data packets that together comprise the first priority application layer message;detecting the second priority application layer message;transmitting the second priority application layer message; andcompleting transmission of the first priority application layer message after the transmission of the second priority application layer message.
  • 16. A non-transitory computer readable medium having stored thereon instructions for prioritizing network traffic comprising machine executable code which when executed by a processor, causes the processor to perform steps comprising: receiving a plurality of un-prioritized application layer messages; andclassifying at least one of the un-prioritized application layer messages as having a first priority of transmission to the second network device and at least another one of the un-prioritized application layer messages as having a second priority of transmission to the second network device, the second priority application layer message having a higher transmission priority than the first priority application layer message, wherein the classification is based on one or more application layer characteristics of a respective plurality of data packets that together comprise each of the classified application layer messages and is independent of any network layer information, wherein one or more of the un-prioritized application layer messages comprise one or more network layer data packets having a different priority than one or more other network layer data packets of the one or more of the un-prioritized application layer messages.
  • 17. The medium of claim 16, wherein one or more of the plurality of data packets of one or more of the first or second priority application layer messages are prioritized differently than the first or second priority of transmission of a corresponding one of the first or second priority application layer messages.
  • 18. The medium of claim 16, wherein the machine executable code when executed by the processor further causes the processor to perform steps further comprising: transmitting a subset of the plurality of data packets that together comprise the first priority application layer message;detecting the second priority application layer message;transmitting the second priority application layer message; andcompleting transmission of the first priority application layer message after the transmission of the second priority application layer message.
RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 13/250,556, filed Sep. 30, 2011, which is a continuation of U.S. patent application Ser. No. 12/209,968, filed Sep. 12, 2008, now U.S. Pat. No. 8,121,117, issued Feb. 21, 2012, and claims the benefit of U.S. Provisional Patent Application No. 60/976,645, filed Oct. 1, 2007, each of which is hereby incorporated by reference in its entirety.

US Referenced Citations (243)
Number Name Date Kind
5282201 Frank et al. Jan 1994 A
5550816 Hardwick et al. Aug 1996 A
5606665 Yang et al. Feb 1997 A
5623490 Richter et al. Apr 1997 A
5991302 Berl et al. Nov 1999 A
5995491 Richter et al. Nov 1999 A
6026500 Topff et al. Feb 2000 A
6029175 Chow et al. Feb 2000 A
6041365 Kleinerman Mar 2000 A
6047356 Anderson et al. Apr 2000 A
6067558 Wendt et al. May 2000 A
6104706 Richter et al. Aug 2000 A
6154777 Ebrahim Nov 2000 A
6157950 Krishnan Dec 2000 A
6259405 Stewart et al. Jul 2001 B1
6260070 Shah Jul 2001 B1
6292832 Shah et al. Sep 2001 B1
6304913 Rune Oct 2001 B1
6330574 Murashita Dec 2001 B1
6338082 Schneider Jan 2002 B1
6353848 Morris Mar 2002 B1
6363056 Beigi et al. Mar 2002 B1
6370527 Singhal Apr 2002 B1
6389462 Cohen et al. May 2002 B1
6446108 Rosenberg et al. Sep 2002 B1
6466580 Leung Oct 2002 B1
6469983 Narayana et al. Oct 2002 B2
6513061 Ebata et al. Jan 2003 B1
6514085 Slattery et al. Feb 2003 B2
6542936 Mayle et al. Apr 2003 B1
6560230 Li et al. May 2003 B1
6578069 Hopmann et al. Jun 2003 B1
6615267 Whalen et al. Sep 2003 B1
6654346 Mahalingaiah et al. Nov 2003 B1
6701415 Hendren, III Mar 2004 B1
6708220 Olin Mar 2004 B1
6728265 Yavatkar et al. Apr 2004 B1
6728704 Mao et al. Apr 2004 B2
6738357 Richter et al. May 2004 B1
6744776 Kalkunte et al. Jun 2004 B1
6754215 Arikawa et al. Jun 2004 B1
6754699 Swildens et al. Jun 2004 B2
6760337 Snyder, II et al. Jul 2004 B1
6795860 Shah Sep 2004 B1
6865593 Reshef et al. Mar 2005 B1
6868447 Slaughter et al. Mar 2005 B1
6871221 Styles Mar 2005 B1
6880017 Marce et al. Apr 2005 B1
6883137 Girardot et al. Apr 2005 B1
6914881 Mansfield et al. Jul 2005 B1
6928518 Talagala Aug 2005 B2
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
6990074 Wan et al. Jan 2006 B2
6990114 Erimli et al. Jan 2006 B1
7003564 Greuel et al. Feb 2006 B2
7023974 Brannam et al. Apr 2006 B1
7035212 Mittal et al. Apr 2006 B1
7039061 Connor et al. May 2006 B2
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
7113996 Kronenberg Sep 2006 B2
7133863 Teng et al. Nov 2006 B2
7191163 Herrera et al. Mar 2007 B2
7228359 Monteiro Jun 2007 B1
7236491 Tsao et al. Jun 2007 B2
7240100 Wein et al. Jul 2007 B1
7292541 C S Nov 2007 B1
7296263 Jacob Nov 2007 B1
7308475 Pruitt et al. Dec 2007 B1
7324533 DeLiberato et al. Jan 2008 B1
7340571 Saze Mar 2008 B2
7373438 DeBergalis et al. May 2008 B1
7409440 Jacob Aug 2008 B1
7577723 Matsuda et al. Aug 2009 B2
7640347 Sloat et al. Dec 2009 B1
7684423 Tripathi et al. Mar 2010 B2
7698458 Liu et al. Apr 2010 B1
7822839 Pruitt et al. Oct 2010 B1
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
7958222 Pruitt et al. Jun 2011 B1
7984500 Khanna et al. Jul 2011 B1
8024443 Jacob Sep 2011 B1
8064342 Badger Nov 2011 B2
8069225 McCanne et al. Nov 2011 B2
8155128 Balyan et al. Apr 2012 B2
8171124 Kondamuru May 2012 B2
8190769 Shukla et al. May 2012 B1
8396836 Ferguson et al. Mar 2013 B1
8463850 McCann Jun 2013 B1
8484348 Subramanian et al. Jul 2013 B2
8560693 Wang et al. Oct 2013 B1
8601000 Stefani et al. Dec 2013 B1
20010007560 Masuda et al. Jul 2001 A1
20020012352 Hansson et al. Jan 2002 A1
20020038360 Andrews et al. Mar 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
20020099829 Richards et al. Jul 2002 A1
20020099842 Jennings et al. Jul 2002 A1
20020103823 Jackson et al. Aug 2002 A1
20020143819 Han et al. Oct 2002 A1
20020143852 Guo 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
20030018450 Carley Jan 2003 A1
20030018585 Butler et al. Jan 2003 A1
20030034905 Anton et al. Feb 2003 A1
20030051045 Connor Mar 2003 A1
20030055723 English Mar 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
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
20030212954 Patrudu Nov 2003 A1
20030220835 Barnes, Jr. Nov 2003 A1
20030229665 Ryman Dec 2003 A1
20030236995 Fretwell, Jr. Dec 2003 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
20040093361 Therrien et al. May 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
20040167967 Bastian et al. Aug 2004 A1
20040213156 Smallwood et al. Oct 2004 A1
20040215665 Edgar et al. Oct 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
20050044158 Malik Feb 2005 A1
20050117589 Douady et al. Jun 2005 A1
20050165656 Frederick et al. Jul 2005 A1
20050174944 Legault et al. Aug 2005 A1
20050175013 Le Pennec et al. Aug 2005 A1
20050198234 Leib 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
20050273456 Revanuru et al. Dec 2005 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
20060100752 Kim et al. May 2006 A1
20060112367 Harris May 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
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
20060282442 Lennon et al. Dec 2006 A1
20070005807 Wong Jan 2007 A1
20070016613 Foresti et al. Jan 2007 A1
20070038994 Davis et al. Feb 2007 A1
20070112775 Ackerman May 2007 A1
20070124415 Lev-Ran et al. May 2007 A1
20070124502 Li May 2007 A1
20070130255 Wolovitz et al. Jun 2007 A1
20070162891 Burner et al. Jul 2007 A1
20070168320 Borthakur et al. Jul 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
20080208917 Smoot et al. Aug 2008 A1
20080263401 Stenzel Oct 2008 A1
20080270578 Zhang et al. Oct 2008 A1
20080281908 McCanne et al. Nov 2008 A1
20090080440 Balyan et al. Mar 2009 A1
20090094311 Awadallah et al. Apr 2009 A1
20090106413 Salo et al. Apr 2009 A1
20090125955 DeLorme May 2009 A1
20090138314 Bruce May 2009 A1
20090161542 Ho Jun 2009 A1
20090187915 Chew et al. Jul 2009 A1
20090217163 Jaroker Aug 2009 A1
20090217386 Schneider Aug 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
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
20100093318 Zhu et al. Apr 2010 A1
20100131654 Malakapalli et al. May 2010 A1
20100179984 Sebastian Jul 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
20100306169 Pishevar et al. Dec 2010 A1
20110055921 Narayanaswamy et al. Mar 2011 A1
20110066736 Mitchell et al. Mar 2011 A1
20110072321 Dhuse Mar 2011 A1
20110185082 Thompson Jul 2011 A1
20120117028 Gold et al. May 2012 A1
20120150805 Pafumi et al. Jun 2012 A1
20130058229 Casado et al. Mar 2013 A1
Foreign Referenced Citations (2)
Number Date Country
1081918 Jul 2001 EP
0058870 Oct 2000 WO
Non-Patent Literature Citations (36)
Entry
Baer, T., et al., “The elements of Web services” ADTmag.com, Dec. 1, 2002, pp. 1-6, (http://www.adtmag.com).
Blue Coat, “Technology Primer: CIFS Protocol Optimization,” Blue Coat Systems Inc., 2007, pp. 1-3, (http://www.bluecoat.com).
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., “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., “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).
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., “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., “Case Information Log for ‘Issues with BoNY upgrade to 4.3’”, as early as Feb. 2008.
F5 Networks Inc., “F5 WANJet CIFS Acceleration”, White Paper, F5 Networks Inc., Mar. 2006, pp. 1-5, Seattle, Washington.
Fajardo V., “Open Diameter Software Architecture,” Jun. 25, 2004, pp. 1-6, Version 1.0.7.
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).
International Search Report for International Patent Application No. PCT/US2012/038228 (Oct. 19, 2012).
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).
“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).
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.
Wikipedia, “Diameter (protocol)”, pp. 1-11, last accessed Oct. 27, 2010, (http://en.wikipedia.org/wiki/Diameter—(protocol)).
UDDI “UDDI Version 3.0.1”, UDDI Spec Technical Committee Specification, Oct. 14, 2003, pp. 1-383, uddi.org, (http://www.uddi.org/).
“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).
UDDI, “UDDI Technical White Paper,” Sep. 6, 2000, pp. 1-12, uddi-org, (http://www.uddi.org/).
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/).
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.
UDDI, “UDDI Overview”, Sep. 6, 2000, pp. 1-21, uddi.org, (http://www.uddi.org/).
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.
Shohoud, Y., “Building XML Web Services with VB .Net and VB 6”, Addison Wesley, Sep. 17, 2002, pp. 1-14.
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.
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.
Related Publications (1)
Number Date Country
20130212295 A1 Aug 2013 US
Provisional Applications (1)
Number Date Country
60976645 Oct 2007 US
Continuations (2)
Number Date Country
Parent 13250556 Sep 2011 US
Child 13750188 US
Parent 12209968 Sep 2008 US
Child 13250556 US