Patent Grant
9380008
The present invention generally relates to network elements in computer networks. The invention relates more specifically to a method and apparatus for high-speed processing of structured application messages in a network device.
The approaches described in this section could be pursued, but are not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated herein, the approaches described in this section are not prior art to the claims in this application and are not admitted to be prior art by inclusion in this section.
In a business-to-business environment, applications executing on computers commonly communicate with other applications that execute on other computers. For example, an application “A” executing on a computer “X” might send, to an application “B” executing on a computer “Y,” a message that indicates the substance of a purchase order.
Computer “X” might be remote from computer “Y.” In order for computer “X” to send the message to computer “Y,” computer “X” might send the message through a computer network such as a local area network (LAN), a wide-area network (WAN), or an inter-network such as the Internet. In order to transmit the message through such a network, computer “X” might use a suite of communication protocols. For example, computer “X” might use a network layer protocol such as the Internet Protocol (IP) in conjunction with a transport layer protocol such as the Transport Control Protocol (TCP) to transmit the message.
Assuming that the message is transmitted using TCP, the message is encapsulated into one or more data packets; separate portions of the same message may be sent in separate packets. Continuing the above example, computer “X” sends the data packets through the network toward computer “Y.” One or more network elements intermediate to computer “X” and computer “Y” may receive the packets, determine a next “hop” for the packets, and send the packets towards computer “Y.”
For example, a router “U” might receive the packets from computer “X” and determine, based on the packets being destined for computer “Y,” that the packets should be forwarded to another router “V” (the next “hop” on the route). Router “V” might receive the packets from router “U” and send the packets on to computer “Y.” At computer “Y,” the contents of the packets may be extracted and reassembled to form the original message, which may be provided to application “B.” Applications “A” and “B” may remain oblivious to the fact that the packets were routed through routers “U” and “V.” Indeed, separate packets may take separate routes through the network.
A message may be transmitted using any of several application layer protocols in conjunction with the network layer and transport layer protocols discussed above. For example, application “A” may specify that computer “X” is to send a message using Hypertext Transfer Protocol (HTTP). Accordingly, computer “X” may add HTTP-specific headers to the front of the message before encapsulating the message into TCP packets as described above. If application “B” is configured to receive messages according to HTTP, then computer “Y” may use the HTTP-specific headers to handle the message.
In addition to all of the above, a message may be structured according to any of several message formats. A message format generally indicates the structure of a message. For example, if a purchase order comprises an address and a delivery date, the address and delivery date may be distinguished from each other within the message using message format-specific mechanisms. For example, application “A” may indicate the structure of a purchase order using Extensible Markup Language (XML). Using XML as the message format, the address might be enclosed within “<address>” and “</address>” tags, and the delivery date might be enclosed within “<delivery-date>” and “</delivery-date>” tags. If application “B” is configured to interpret messages in XML, then application “B” may use the tags in order to determine which part of the message contains the address and which part of the message contains the delivery date.
Often, though, different applications are designed to use different application layer protocols to send and receive messages. For example, application “A” might be designed to send messages using only HTTP, but application “B” might be designed to receive messages using only File Transfer Protocol (FTP), another application layer protocol. Furthermore, different applications may be designed to use different message formats to format and interpret messages. For example, application “A” might be designed to format messages using only XML, but application “B” might be designed to interpret messages using only Electronic Data Interchange (EDI).
Usually, it is not practical or even possible to design or update an application so that the application can converse with other applications using all possible message formats and application layer protocols. Some message formats and application layer protocols may be proprietary and not publicly disclosed. Some message formats and application layer protocols may be relatively new and obscure. Some message formats and application layer protocols may be so old as to be considered generally obsolete.
In order to reduce the amount of application modification required to allow an application to converse with other applications that might use different message formats and/or application layer protocols, intermediary network elements separate from such applications may be designed to receive messages, “translate” the messages, and then send the messages. This translation may be achieved by looking for a specified bit pattern beginning at a specified bit location in a packet, and then altering bits at the specified bit location if the specified bit pattern is found. For example, a network appliance “J” might be designed to receive messages that have been sent using HTTP and send those messages using FTP instead. For another example, a network appliance “K” might be designed to receive messages that are in XML format and translate those messages into EDI format. Thus, if application “A” sends messages in XML using HTTP, and application “B” receives messages in EDI using FTP, then application “A” can be configured so that messages that application “A” normally would address to application “B” are addressed to network appliance “J” instead. The network administrator can configure network appliance “J” to send messages to network appliance “K,” and the network administrator can configure network appliance “K” to send messages to application “B.”
Unfortunately, this approach requires a lot of effort from the network administrator. As the number of possible different application layer protocols and message formats used by communicating applications increases, the number of network appliances and paths between those network appliances rises dramatically. For each pair of sending and receiving applications, a network administrator following this approach must configure the applications and network appliances involved to ensure that the messages will follow the correct path through the relevant network appliances. Thus, if each of applications “A,” “B,” “C,” “D,” and “E” needed to communicate with each other, the network administrator following this approach might need to configure 25 different “paths” of one or more network appliances each. As applications are added, removed, and modified, the network administrator may need to add and/or remove certain network appliances from certain paths between application pairs. When many applications are involved, the burden can be more than most network administrators can bear.
Additionally, if multiple paths are configured to contain the same network appliance, then the network appliance may become a bottleneck that degrades network performance.
Thus, this “pair-wise path configuration” approach is impractical when applied to systems in which large numbers of diverse applications communicate. A more practical technique for allowing a multitude of diverse applications to communicate is needed.
Further, it is desirable to have a network appliance analyze messages as the messages are passed through the network appliance and route messages according to the content of each message. For example, if application “A” sends messages in XML and applications “B” and “C” both receive messages in XML, the network appliance can analyze the message content, either partially or entirely, and route the message to the proper destination. Messages sent to applications “B” and “C” might be load balanced by the network appliance. Messages might be categorized via rules on the network appliance and, depending on the results of a message analysis, the network appliance may send high-priority messages to application “B” and low-priority messages to application “C”.
Unfortunately, network appliances have not performed this type of analysis. Applications are responsible for selecting the destinations of their own messages. This creates the problems with message translation as discussed above as well as requiring each application to keep track of the destination of each type of message. A technique for analyzing message content in a network appliance that does not require applications to monitor the destinations of each message is needed.
The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
A method and apparatus for high-speed processing of structured application messages in a network device is described. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
Embodiments are described herein according to the following outline:
The needs identified in the foregoing Background, and other needs and objects that will become apparent for the following description, are achieved in the present invention, which comprises, in one aspect, a method for high-speed processing of structured application messages in a network device. According to one embodiment, the network device monitors traffic between a plurality of client applications and server applications.
In an embodiment, a network device receives a set of message classification rules that have been prepared beforehand by a system administrator or customer. The system analyzes the message classification rules to determine what part(s) of the message are necessary to classify a message according to the message classification rules. The analysis is performed off-line. This allows the system to consider only the relevant parts of the message and ignore the rest of the message. The system first extracts the portion of the message necessary for classifying the message using pre-determined structured message format information.
The message is then classified using the values of the extracted information. The message classification rules are used to evaluate the extracted information. The classification can be based on a certain value, name, destination, combinations of information, etc. In most instances, message classification is based on either the message header or, in addition to the header, some small initial part of the message body itself.
A unique sequence of operations is implied by the message classification and those operations must then be applied to the message. As with the classification, these operations are also known a priori and are pre-analyzed to make intelligent decisions about the parts of the message that need to be accessed. The operations may tell the system that the message is to be routed to a destination different from the originally addressed destination or is to be stored in a local database or an external database.
In other aspects, the invention encompasses a computer apparatus and a computer-readable medium configured to carry out the foregoing steps.
2.0 Structural and Functional Overview
Client application 110 is coupled communicatively with network element 102. A server application 112 is coupled communicatively to network element 106. A server application 114 is coupled communicatively to network element 108. Each of client application 110 and server applications 112 and 114 may be a separate computer. Alternatively, each of client application 110 and server applications 112 and 114 may be a separate process executing on the same computer.
Network elements 102 and 104 are coupled communicatively with a network 116. Network elements 104 and 106 are coupled communicatively with a network 118. Network elements 104 and 108 are coupled communicatively with a network 120. Each of networks 116, 118, and 120 is a computer network, such as, for example, a local area network (LAN), wide area network (WAN), or internetwork such as the Internet. Networks 116, 118, and 120 may contain additional network elements such as routers.
In one embodiment, client application 110 addresses messages to server applications 112 and 114, and network elements 102, 104, 106, and 108 intercept the data packets that contain the messages. In an alternative embodiment, client application 110 explicitly addresses messages to network element 102. Network elements 102, 104, 106, and 108 assemble one or more data packets to determine at least a portion of a message contained therein. Based on the message, network elements 102, 104, 106, and 108 perform one or more actions. Examples of some of these actions are described in further detail below.
In block 202, a network element receives user-specified input. The user-specified input indicates a message classification and one or more actions that are associated with the message classification. For example, network element 104 may receive such user-specified input from a network administrator. The message classification defines a category or class of messages. For example, all purchase orders might belong to the same message classification. Messages that satisfy user-specified criteria or rules associated with the message classification belong to the message classification, while messages that do not satisfy these criteria or rules do not belong to the message classification.
In block 204, the network element receives one or more data packets. For example, network element 104 may intercept one or more data packets that are destined for server application 112. For another example, network element 102 may receive one or more data packets that are destined for network element 102. Network element 102 is capable of determining application layer message boundaries, so, in one embodiment, network element 102 may perform operations (as described below) on an application layer message contained in a stream, or portions thereof, even if network element 102 has not yet received all of the data packets that contain all of the portions of the application layer message.
In block 206, based on the data packets, it is determined that an application layer message collectively contained in payload portions of the data packets belongs to the particular message classification. For example, network element 104 may assemble at least some of the data packets. Network element 104 may inspect the contents of the payload portions of the assembled data packets to determine at least a portion of an application layer message that client application 110 is trying to send. The message may be, for example, a purchase order formatted according to XML and transmitted using HTTP. As such, the message may contain HTTP and XML headers. Based on the message content and/or information in the data packet headers, network element 104 may determine that the message belongs to the particular message classification indicated in the user-specified input. For example, network element 104 may determine, based on a portion of the message, that the message is a purchase order.
In block 208, at least a portion of the message is processed via the performance, relative to at least the portion of the message, of the actions that are associated with the particular message classification. For example, in response to determining that the message belongs to the “purchase order” message classification, network element 104 may perform one or more specified actions that are associated with the “purchase order” message classification. The specified actions may include, for example, modifying the message's format (e.g., from XML to EDI) and sending the message toward server application 112 using a different application layer protocol (e.g., FTP) than the protocol that client application 110 used to send the message. Examples of other possible actions are described below.
3.0 Implementation Examples
3.1 Multi-Blade Architecture
According to one embodiment, an Application-Oriented Network Services (AONS) blade in a network element such as a router, a switch, an appliance that performs L2-L4 processing, etc., performs the actions discussed above.
Router 600 receives packet flows such as packet flows 610A-B. More specifically, in one embodiment, packet flows 610A-B received by router 600 are received by supervisor blade 602. Supervisor blade 602 may comprise a forwarding engine and/or a route processor such as those commercially available from Cisco Systems, Inc. In an alternative embodiment, router 600 comprises one or more network I/O modules that may comprise a forwarding engine; in such an alternative embodiment, the operations described below as being performed by supervisor blade 602 are performed instead by a forwarding engine that is not situated within supervisor blade 602, so that packets may be forwarded to AONS blade 604 without ever going through supervisor blade 602.
In one embodiment, supervisor blade 602 classifies packet flows 610A-B based on one or more parameters contained in the packet headers of those packet flows. If the parameters contained in the packet header of a particular packet match specified parameters, then supervisor blade 602 sends the packets to a specified one of AONS blade 604 and/or other blades 606A-N. Alternatively, if the parameters contained in the packet header do not match any specified parameters, then supervisor blade 602 performs routing functions relative to the particular packet and forwards the particular packet on toward the particular packet's destination.
For example, supervisor blade 602 may determine that packet headers in packet flow 610B match specified parameters. Consequently, supervisor blade 602 may send packets in packet flow 610B to AONS blade 604. Supervisor blade 602 may receive packets back from AONS blade 604 and/or other blades 606A-N and send the packets on to the next hop in a network path that leads to those packets' destination. For another example, supervisor blade 602 may determine that packet headers in packet flow 610A do not match any specified parameters. Consequently, without sending any packets in packet flow 610A to AONS blade 604 or other blades 606A-N, supervisor blade 602 may send packets in packet flow 610A on to the next hop in a network path that leads to those packets' destination.
AONS blade 604 and other blades 606A-N receive packets from supervisor blade 602, perform operations relative to the packets, and return the packets to supervisor blade 602. Supervisor blade 602 may send packets to and receive packets from multiple blades before sending those packets out of router 600. For example, supervisor blade 602 may send a particular group of packets to other blade 606A. Other blade 606A may perform firewall functions relative to the packets and send the packets back to supervisor blade 602. Supervisor blade 602 may receive the packet from other blade 606A and send the packets to AONS blade 604. AONS blade 604 may perform one or more message payload-based operations relative to the packets and send the packets back to supervisor blade 602.
According to one embodiment, the following events occur at an AONS router such as router 600. First, packets, containing messages from clients to servers, are received. Next, access control list-based filtering is performed on the packets and some of the packets are sent to an AONS blade or module. Next, TCP termination is performed on the packets. Next, Secure Sockets Layer (SSL) termination is performed on the packets if necessary. Next, Universal Resource Locator (URL)-based filtering is performed on the packets. Next, message header-based and message content-based filtering is performed on the packets. Next, the messages contained in the packets are classified into AONS message types. Next, a policy flow that corresponds to the AONS message type is selected. Next, the selected policy flow is executed. Then the packets are either forwarded, redirected, dropped, copied, modified, or fanned-out as specified by the selected policy flow.
3.2 Performing Message Payload Processing Functions at a Network Element
Referring first to
The user-specified input may indicate multiple sets of criteria that are to be associated, respectively, with multiple separate message classifications, and multiple sets of actions that are to be associated with the multiple message classifications. For example, the user-specified input may indicate a first set of criteria that is to be associated with a first message classification, a second set of criteria that is to be associated with a second message classification, a first set of actions that are to be associated with the first message classification, and a second set of actions that are to be associated with the second message classification.
In block 304, an association is established, at the network element, between the particular message classification and the one or more criteria. For example, AONS blade 604 may establish an association between a particular message classification and one or more criteria. For example, the criteria may indicate a particular string of text that a message needs to contain in order for the message to belong to the associated message classification. For another example, the criteria may indicate a particular path that needs to exist in the hierarchical structure of an XML-formatted message (or based in an XPath boolean expression) in order for the message to belong to the associated message classification. For another example, the criteria may indicate one or more source IP addresses and/or destination IP addresses from or to which a message needs to be addressed in order for the message to belong to the associated message classification.
Multiple associations may be established between separate sets of criteria and separate message classifications. For example, AONS blade 604 may establish a first association between a first set of criteria and a first message classification, and a second association between a second set of criteria and a second message classification.
In block 306, an association is established, at the network element, between the particular message classification and the one or more actions. One or more actions that are associated with a particular message classification comprise a “policy” that is associated with that particular message classification. A policy may comprise a “flow” of one or more actions that are ordered according to a particular order specified in the user-specified input, and/or one or more other actions that are not ordered. For example, AONS blade 604 may establish an association between a particular message classification and one or more actions. Collectively, the operations of blocks 302-306 comprise “provisioning” the network element.
Multiple associations may be established between separate sets of actions and separate message classifications. For example, AONS blade 604 may establish a first association between a first set of actions and a first message classification, and a second association between a second set of actions and a second message classification.
In block 308, one or more data packets that are destined for a device other than the network element are received by the network element. The data packets may be, for example, data packets that contain IP and TCP headers. The IP addresses indicated in the IP headers of the data packets may differ from the network element's IP address; thus, the data packets may be destined for a device other than the network element. For example, network element 104, and more specifically supervisor blade 602, may intercept data packets that client application 110 originally sent. The data packets might be destined for server application 112, for example.
In block 310, based on one or more information items indicated in the headers of the data packets, an application layer protocol that was used to transmit a message contained in the payload portions of the data packets (hereinafter “the message”) is determined. The information items may include, for example, a source IP address in an IP header, a destination IP address in an IP header, a TCP source port in a TCP header, and a TCP destination port in a TCP header. For example, network element 104, and more specifically AONS blade 604, may store mapping information that maps FTP (an application layer protocol) to a first combination of IP addresses and/or TCP ports, and that maps HTTP (another application layer protocol) to a second combination of IP addresses and/or TCP ports. Based on this mapping information and the IP addresses and/or TCP ports indicated by the data packets, network element 104 may determine which application layer protocol (FTP, HTTP, Simple Mail Transfer Protocol (SMTP), etc.) was used to transmit the message.
In block 312, a message termination technique that is associated with the application layer protocol used to transmit the message is determined. For example, network element 104, and more specifically AONS blade 604, may store mapping information that maps FTP to a first procedure, that maps HTTP to a second procedure, and that maps SMTP to a third procedure. The first procedure may employ a first message termination technique that can be used to extract, from the data packets, a message that was transmitted using FTP. The second procedure may employ a second message termination technique that can be used to extract, from the data packets, a message that was transmitted using HTTP. The third procedure may employ a third message termination technique that can be used to extract, from the data packets, a message that was transmitted using SMTP. Based on this mapping information and the application layer protocol used to transmit the message, network element 104 may determine which procedure should be called to extract the message from the data packets.
In block 314, the contents of the message are determined based on the termination technique that is associated with the application layer protocol that was used to transmit the message. For example, network element 104, and more specifically AONS blade 604, may provide the data packets as input to a procedure that is mapped to the application layer protocol determined in block 312. The procedure may use the appropriate message termination technique to extract the contents of the message from the data packets. The procedure may return the message as output to AONS blade 604. Thus, in one embodiment, the message extracted from the data packets is independent of the application layer protocol that was used to transmit the message.
In one embodiment, determining the contents of the message involves assembling the contents of the payload portions of two or more of the data packets. For example, network element 104 may determine the proper order of two or more TCP data packets (based on TCP sequence numbers, for example), extract the contents of the payload portions of the TCP data packets, and concatenate the contents according to the proper order to form at least a portion of the message. The message may be a multi-part (MIME) message, and each part may be handled separately as though it were a separate message; each part may be associated with a different message classification.
In block 316, a message classification that is associated with criteria that the message satisfies is determined. For example, network element 104 may store mapping information that maps different criteria to different message classifications. The mapping information indicates, among possibly many different associations, the association established in block 304. Network element 104 may determine whether the contents of the message satisfy criteria associated with any of the known message classifications. In one embodiment, if the contents of the message satisfy the criteria associated with a particular message classification, then it is determined that the message belongs to the particular message classification.
Although, in one embodiment, the contents of the message are used to determine a message's classification, in alternative embodiments, information beyond that contained in the message may be used to determine the message's classification. For example, in one embodiment, a combination of the contents of the message and one or more IP addresses and/or TCP ports indicated in the data packets that contain the message is used to determine the message's classification. For another example, in one embodiment, one or more IP addresses and/or TCP ports indicated in the data packets that contain the message are used to determine the message's classification, regardless of the contents of the message.
In block 318, one or more actions that are associated with the message classification determined in block 316 are performed. If two or more of the actions are associated with a specified order of performance, as indicated by the user-specified input, then those actions are performed in the specified order. If the output of any of the actions is supposed to be provided as input to any of the actions, as indicated by the user-specified input, then the output of the specified action is provided as input to the other specified action.
A variety of different actions may be performed relative to the message. For example, an action might indicate that the message is to be dropped. In this case, the message is prevented from being forwarded out of the network element toward that message's destination. For another example, an action might indicate that a message is to be compressed using a specified compression technique before being forwarded out of the network element.
For another example, an action might indicate that the content of the message is to be altered in a specified manner. For example, an action might indicate that specified text is to be inserted into a specified location in the message. A path in an XML hierarchical structure of the message might specify such a location, for example, or a specified string of text occurring in the message might specify such a location. For another example, an action might indicate that specified text is to be deleted from the message. For another example, an action might indicate that specified text is to be substituted for other specified text in the message. Text inserted into the message might be obtained dynamically (“on the fly”) from a database that is external to the network element.
For another example, an action might indicate that the message format of a message is to be altered in a specified manner. For example, an action might indicate that a message's format is to be changed from XML to some other format such as EDI. For another example, an action might indicate that a message's format is to be changed from some format other than XML into XML. The message format may be altered without altering the core content of the message, which is independent of the message format.
For another example, an action might indicate that the message is to be forwarded using a specified application layer protocol other than the application layer protocol that the message's origin used to transmit the message. For example, client application 110 might have used a first application layer protocol, such as HTTP, to transmit the message. Thus, when intercepted by network element 104, and more specifically supervisor blade 602, the message might have contained an HTTP header. However, in accordance with a specified action, before network element 104 forwards the message towards the message's destination, network element 104, and more specifically AONS blade 604, may modify the message so that the message will be carried using an application layer protocol other than HTTP (such as FTP, SMTP, etc.).
For another example, an action might indicate that the message's destination is to be altered so that the message will be forwarded towards a device that is different from the device that the message's source originally specified. For example, in accordance with a specified action, network element 104, and more specifically AONS blade 604, might encapsulate the message in one or more new IP data packets that indicate a new destination IP address that differs from the destination IP address that originally intercepted IP data packets indicated. Network element 104 may then forward the new IP data packets toward the new destination. In this manner, message content-based routing may be achieved.
For another example, an action might indicate that a specified event is to be written into a specified log that might be external to the network element. For example, in accordance with a specified action, network element 104, and more specifically AONS blade 604, might write at least a portion of the message, along with the IP address from which the message was received, to a log file.
For another example, an action might indicate that the message is to be encrypted using a specified key before being forwarded to a destination. For example, in accordance with a specified action, network element 104, and more specifically AONS blade 604, might encrypt at least a portion of the message using a specified key and then forward data packets that contain the encrypted message towards the message's destination. Encryption also places a constraint on the subsequent action (e.g. The encrypted portion cannot be modified).
For another example, an action might indicate that a response cached at the network element is to be returned to the device from which the message originated, if such a response is cached at the network element. For example, network element 104, and more specifically AONS blade 604, may determine whether a response to the message is cached at network element 104; such a response might have be cached at network element 104 at the time a previous response to the same message passed through network element 104. If network element 104 determines that such a response is cached, then network element 104 may return the response to the message's origin. For read-only operations without any persistent state change, network element 104 does not need to forward the message to the message's destination, and the message's destination does not need to issue another response to the message.
For another example, an action might indicate that some authentication information in the message, such as a user identifier and associated password, is to be used to authenticate the message. For example, network element 104, and more specifically AONS blade 604, might authenticate a message by comparing authentication information in the message with trusted information stored at network element 104.
If the message was modified in some way (e.g., content, format, or protocol modification) during the performance of the actions, and if the modified message is supposed to be forwarded out of the network element, then the network element encapsulates the modified message into new data packets and sends the new data packets towards the modified message's destination—which also might have been modified.
A message might not belong to any known message classification. In this case, according to one embodiment, the network element does not perform any user-specified actions relative to the message. Instead, the network element simply forwards the data packets to the next hop along the path to the data packets' indicated destination.
The method illustrated in flow diagram 300 may be performed relative to multiple sets of data packets, each set carrying a separate message. For example, network element 104 may perform the method illustrated relative to a first set of data packets that carry a first message, and then network element 104 may perform the method relative to a second set of data packets that carry a second message. The first message might satisfy a first set of criteria associated with a first message classification, and the second message might satisfy a second set of criteria associated with a second message classification. Thus, network element 104 might perform a first set of actions relative to the first message, and a second set of actions relative to the second message.
As a result of the method illustrated in flow diagram 300, applications such as client application 110, server application 112, and server application 114 can communicate with each other as though no network elements acted as intermediaries, and as though each other application communicated using the same message format and application layer protocol.
3.3 Action Flows
In other embodiments, any one of actions 402-414 may be performed individually or in combination with any others of actions 402-414.
3.4 Filtered Processing
Typically, inspecting, parsing, and modifying an application layer message is a processing resource-intensive operation that cannot be performed as quickly as routing operations that are based only on information in TCP and IP packet headers. Referring again to
Therefore, in one embodiment, supervisor blade 602 sends only some selected packets to AONS blade 604. The technique by which supervisor blade 602 selects these packets may be referred to as “filtering.” As a result of filtering, AONS blade 604 does not receive as many packets with which AONS blade 604 is likely to do nothing.
In block 654, the packet is sent to an AONS blade. For example, supervisor blade 602 may direct the packet to AONS blade 604. AONS blade 604 may then perform more resource-intensive message level processing on an application layer message that is at least partially contained in the packet.
Alternatively, in block 656, the packet is forwarded on towards the packet's destination. For example, supervisor blade 602 may route the packet toward the packet's next hop without sending the packet to AONS blade 604. Message level processing is not performed on the packet.
3.5 AONS Examples
3.5.1 AONS General Overview
Application-Oriented Network Systems (AONS) is a technology foundation for building a class of products that embed intelligence into the network to better meet the needs of application deployment. AONS complements existing networking technologies by providing a greater degree of awareness of what information is flowing within the network and helping customers to integrate disparate applications by routing information to the appropriate destination, in the format expected by that destination; enforce policies for information access and exchange; optimize the flow of application traffic, both in terms of network bandwidth and processing overheads; provide increased manageability of information flow, including monitoring and metering of information flow for both business and infrastructure purposes; and provide enhanced business continuity by transparently backing up or re-routing critical business data.
AONS provides this enhanced support by understanding more about the content and context of information flow. As such, AONS works primarily at the message rather than at the packet level. Typically, AONS processing of information terminates a TCP connection to inspect the full message, including the “payload” as well as all headers. AONS also understands and assists with popular application-level protocols such as HTTP, FTP, SMTP and de facto standard middleware protocols.
AONS differs from middleware products running on general-purpose computing systems in that AONS' behavior is more akin to a network appliance, in its simplicity, total cost of ownership and performance. Furthermore, AONS integrates with network-layer support to provide a more holistic approach to information flow and management, mapping required features at the application layer into low-level networking features implemented by routers, switches, firewalls and other networking systems.
AONS provides a framework for broader functional support, a broader class of applications and a greater degree of control and management of application data.
3.5.2 AONS Terminology
An “application” is a software entity that performs a business function either running on servers or desktop systems. The application could be a packaged application, software running on application servers, a legacy application running on a mainframe, or custom or proprietary software developed in house to satisfy a business need or a script that performs some operation. These applications can communicate with other applications in the same department (departmental), across departments within a single enterprise (intra enterprise), across an enterprise and its partners (inter-enterprise or B2B) or an enterprise and its customers (consumers or B2C). AONS provides value added services for any of the above scenarios.
An “application message” is a message that is generated by an application to communicate with another application. The application message could specify the different business level steps that should be performed in handling this message and could be in any of the message formats described in the section below. In the rest of the document, unless otherwise specified explicitly, the term “message” also refers to an application message.
An “AONS node” is the primary AONS component within the AONS system (or network). As described later, the AONS node can take the shape of a client proxy, server proxy or an intermediate device that routes application messages. There may be multiple AONS nodes across the network performing different functions of which some may be federated.
Each application message, when received by the first AONS node, gets assigned an AONS message ID and is considered to be an “AONS message” until that message gets delivered to the destination AONS node. The concept of the AONS message exists within the AONS cloud. A single application message may map to more than one AONS message. This may be the case, for example, if the application message requires processing by more than one business function. For example, a “LoanRequest” message that is submitted by a requesting application and that needs to be processed by both a “CreditCheck” application and a “LoanProcessing” application would require processing by more than one business function. In this example, from the perspective of AONS, there are two AONS messages: The “LoanRequest” to the “CreditCheck” AONS message from the requesting application to the CreditCheck application; and the “LoanRequest” to the “LoanProcessing” AONS message from the CreditCheck application to the LoanProcessing Application.
In one embodiment, AONS messages are encapsulated in an AONP (AON Protocol) message that contains AONP headers, and are translated to a “canonical” format. AONP is a mechanism to enable federation between two or more AONS nodes. For example, a first AONS node may know that it is acting in conjunction with a second or other AONS node; thus the AONS nodes are “federated.” The first AONS node might have performed one or more actions, such as encryption, signing, authentication, etc., relative to a particular message. The first AONS node may indicate, in one or more AONP headers, the actions that the first AONS node performed. Upon receiving the AONP message, the second AONS node may determine from the AONP headers that the actions have been performed. As a result, the second AONS node may forego performing those actions, or perform other functions in an efficient and optimal way. Reliability, logging and security services are provided from an AONS message perspective.
The set of protocols or methods that applications typically use to communicate with each other are called “application access protocols” (or methods) from an AONS perspective. Applications can communicate to the AONS network (typically end point proxies: a client proxy and a server proxy) using any supported application access methods. Some examples of application access protocols include: IBM MQ Series, Java Message Service (JMS), TIBCO, Simple Object Access Protocol (SOAP) over Hypertext Transfer Protocol (HTTP)/HTTPS, Simple Mail Transfer Protocol (SMTP), File Transfer Protocol (FTP), Java Database Connectivity (JDBC), TCP, etc. Details about various access methods are explained in later sections of this document.
There are a wide variety of “message formats” that are used by applications. These message formats may range from custom or proprietary formats to industry-specific formats to standardized formats. Extensible Markup Language (XML) is gaining popularity as a universal language or message format for applications to communicate with each other. AONS supports a wide variety of these formats.
In addition, in one embodiment, AONS provides content translation services from one format to another based on the needs of applications. A typical deployment might involve a first AONS node that receives an application message (the client proxy) translating the message to a “canonical” format, which is carried as an AONS message through the AONS network. The server proxy might translate the message from the “canonical” format to the format understood by the receiving application before delivering the message. However, proxies are not required. For understanding some of the non-industry standard formats, a message dictionary may be used.
A node that performs the gateway functionality between multiple application access methods or protocols is called a “protocol gateway.” An example of this would be a node that receives an application message through File Transfer Protocol (FTP) and sends the same message to another application as a HTTP post. In AONS, the client and server proxies are typically expected to perform the protocol gateway functionality.
If an application generates a message in Electronic Data Interchange (EDI) format and if the receiving application expects the message to be in an XML format, then the message format needs to be translated but the content of the message needs to be kept intact through the translation. In AONS, the end point proxies typically perform this “message format translation” functionality.
In some cases, AONS may filter, modify, combine, split a message content into multiple messages or a single message.
In some cases, even though the sending and receiving application use the same message format, the content needs to be translated for the receiving application. For example, if a United States-resident application is communicating with a United Kingdom-resident application, then the date format in the messages between the two applications might need to be translated (from mm/dd/yyyy to dd/mm/yyyy) even if the applications use the same data representation (or message format). This translation is called “content translation.”
3.5.3 AONS Functional Overview
As defined previously, AONS can be defined as network-based intelligent intermediary systems that efficiently and effectively integrate business and application needs with more flexible and responsive network services.
In particular, AONS can be understood through the following characteristics:
AONS operates at a higher layer (layers 5-6) than traditional network element products (layers 2-4). AONS uses message-level inspection as a complement to packet-level inspection—by understanding application messages, AONS adds value to multiple network element products, such as switches, firewalls, content caching systems and load balancers, on the “message exchange route.” AONS provides increased flexibility and granularity of network responsiveness in terms of security, reliability, traffic optimization (compression, caching), visibility (business events and network events) and transformation (e.g., from XML to EDI).
AONS is a comprehensive technology platform, not just a point solution. AONS can be implemented through distributed intelligent intermediary systems that sit between applications, middleware, and databases in a distributed intra- and inter-enterprise environment (routing messages, performing transformations, etc.). AONS provides a flexible framework for end user configuration of business flows and policies and partner-driven extensibility of AONS services.
AONS is especially well suited for network-based deployment. AONS is network-based rather than general-purpose server-based. AONS is hybrid software-based and hardware-based (i.e., application-specific integrated circuit (ASIC)/field programmable gate array (FPGA)-based acceleration). AONS uses out-of-band or in-line processing of traffic, as determined by policy. AONS is deployed in standalone products (network appliances) as well as embedded products (service blades for multiple switching, routing, and storage platforms).
3.5.4 AONS System Overview
This section outlines the system overview of an example AONS system.
Within AONS network 702, key building blocks include AONS Endpoint Proxies (AEPs) 704-710, which are located at the edge of the AONS network and serve as the entry and exit points, and an AONS Router (AR), which is located within the AONS network. Visibility into application intent may begin within AEP 704 placed at the edge of a logical AONS “cloud.” As a particular client application of client applications 714A-N attempts to send a message across the network to a particular server application destination of server applications 716A-N and 718A-N, the particular client application will first interact with AEP 704.
AEP 704 serves as either a transparent or explicit messaging gateway which aggregates network packets into application messages and infers the message-level intent by examining the header and payload of a given message, relating the message to the appropriate context, optionally applying appropriate policies (e.g. message encryption, transformation, etc.) and then routing the message towards the message's application destination via a network switch.
AONS Router (AR) 712 may intercept the message en route to the message's destination endpoint. Based upon message header contents, AR 712 may determine that a new route would better serve the needs of a given application system. AR 712 may make this determination based upon enterprise-level policy, taking into account current network conditions. As the message nears its destination, the message may encounter AEP 706, which may perform a final set of operations (e.g. message decryption, acknowledgement of delivery) prior to the message's arrival. In one embodiment, each message is only parsed once: when the message first enters the AONS cloud. It is the first AEP that a message traverses that is responsible for preparing a message for optimal handling within the underlying network.
AEPs 704-708 can further be classified into AEP Client Proxies and AEP Server Proxies to explicitly highlight roles and operations performed by the AEP on behalf of the specific end point applications.
A typical message flow involves a particular client application 714A submitting a message to the AEP Client Proxy (CP) 704 through one of the various access protocols supported by AONS. On receiving this message, AEP CP 704 assigns an AONS message id to the message, encapsulates the message with an AONP header, and performs any necessary operations related to the AONS network (e.g. security and reliability services). Also, if necessary, the message is converted to a “canonical” format by AEP CP 704. The message is carried over a TCP connection to AR 710 along the path to the destination application 718A. The AONS routers or switches along the path perform the infrastructure services necessary for the message and can change the routing based on the policies configured by the customer. The message is received at the destination AEP Server Proxy (SP) 706. AEP SP 706 performs necessary security and reliability functions and translates the message to the format that is understood by the receiving application, if necessary. AEP SP 706 then sends the message to receiving application 718A using any of the access protocols that application 718A and AONS support. A detailed message flow through AONS network 702 is described in later sections.
The message processing described herein may be performed with respect to the content of different kinds of messages that an AONS node may encounter. AONS nodes may process request messages, response messages, messages that called out from an AONS node or that are brought into an AONS node, or exception messages; AONS nodes may process contents of messages beyond those or the type that are sent between client and server applications. For example, in response to intercepting a message from a client application, an AONS node may generate and send another message to a database server. The AONS may subsequently receive yet another message from the database server. The AONS node may perform message processing in the manner described herein on any of the messages mentioned above, not just on the messages from the client.
An AONS node may perform specified actions in response to determining that the delivery of a message will cause a failure. For example, an AONS node may determine that a message is larger than the maximum size that can be accepted by a server application for which the message is destined. In response, the AONS node may prevent the message from being forwarded to the server application. Instead, the AONS node may log the message for later inspection by an administrator. For another example, in response to determining that a message contains a virus or other malignant content, an AONS node may “inoculate” the message (e.g., by encrypting and/or compressing the message content), and then store the “inoculated” message in a log for later inspection by an administrator.
3.5.5 AONS System Elements
This section outlines the different concepts that are used from an AONS perspective.
An “AEP Client Proxy” is an AONS node that performs the services necessary for applications on the sending side of a message (a client). In the rest of this document, an endpoint proxy also refers to a client or server proxy. Although AONS nodes may fulfill the roles of proxies, they are typically not designated as such; “AEP proxy” is a term used to define a role. The typical responsibilities of the client proxy in processing a message are: message pre-classification & early rejection, protocol management, message identity management, message encapsulation in an AONP header, end point origination for reliable delivery, security end point service origination (encryption, digital signature, authentication), flow selection & execution/infrastructure services (logging, compression, content transformation, etc.), routing—next hop AONS node or destination, AONS node and route discovery/advertising role and routes, and end point origination for the reliable delivery mechanism (guaranteed delivery router).
Not all functionalities described above need to be performed for each message. The functionalities performed on the message are controlled by the policies configured for the AONS node.
An “AEP Server Proxy” is an AONS node that performs the services necessary for applications on the receiving side of a message (a server). In the rest of the document, a Server Proxy may also be referred as an end point proxy. The typical responsibilities of the Server Proxy in processing a message are: protocol management, end point termination for reliable delivery, security end point service termination (decryption, verification of digital signature, etc.), flow selection & execution/infrastructure services (logging, compression, content translation, etc.), message de-encapsulation in AONP header, acknowledgement to sending AONS node, application routing/request message delivery to destination, response message correlation, and routing to entry AONS node.
Note that not all the functionalities listed above need to be performed for each message. The functionalities performed on the message are controlled by the policies configured for the AONS node and what the message header indicates.
An “AONS Router” is an AONS node that provides message-forwarding functionalities along with additional infrastructure services within an AONS network. An AONS Router communicates with Client Proxies, Server Proxies and other AONS Routers. An AONS Router may provide service without parsing a message; an AONS Router may rely on an AONP message header and the policies configured in the AONS network instead of parsing messages. An AONS Router provides the following functionalities: scalability in the AONS network in terms of the number of TCP connections needed; message routing based on message destination, policies configured in the AONS cloud, a route specified in the message, and/or content of the message; a load at the intended destination—re-routing if needed; availability of the destination—re-routing if needed; cost of transmission (selection among multiple service providers); and infrastructure services such as sending to a logging facility, sending to a storage area network (SAN) for backup purposes, and interfacing to a cache engine for cacheable messages (like catalogs).
AONS Routers do not need to understand any of the application access protocols and, in one embodiment, deal only with messages encapsulated with an AONP header.
Application-Oriented Networking Protocol (AONP) is a protocol used for communication between the nodes in an AONS network. In one embodiment, each AONS message carries an AONP header that conveys the destination of the message and additional information for processing the message in subsequent nodes. AONP also addresses policy exchange (static or dynamic), fail-over among nodes, load balancing among AONS nodes, and exchange of routing information. AONP also enables application-oriented message processing in multiple network elements (like firewalls, cache engines and routers/switches). AONP supports both a fixed header and a variable header (formed using type-length-value (TLV) fields) to support efficient processing in intermediate nodes as well as flexibility for additional services.
Unless explicitly specified otherwise, “router” or “switch” refers herein to a typical Layer 3 or Layer 2 switch or a router that is currently commercially available.
3.5.6 AONS Example Features
In one embodiment, an underlying “AONS foundation platform of subsystem services” (AOS) provides a range of general-purpose services including support for security, compression, caching, reliability, policy management and other services. On top of this platform, AONS then offers a range of discreet functional components that can be wired together to provide the overall processing of incoming data traffic. These “bladelets™” are targeted at effecting individual services in the context of the specific policy or action demanded by the application or the information technology (IT) manager. A series of access method adaptors ensure support for a range of ingress and egress formats. Finally, a set of user-oriented tools enable managers to appropriately view, configure and set policies for the AONS solution. These four categories of functions combine to provide a range of end-customer capabilities including enhanced security, infrastructure optimization, business continuity, application integration and operational visibility.
The enhanced visibility and enhanced responsiveness enabled by AONS solutions provides a number of intelligent, application-oriented network services. These intelligent services can be summarized in four primary categories:
Enhanced security and reliability: enabling reliable message delivery and providing message-level security in addition to existing network-level security.
Infrastructure optimization: making more efficient use of network resources by taking advantage of caching and compression at the message level as well as by integrating application and network quality-of-service (QoS).
Business and infrastructure activity monitoring and management: by reading information contained in the application layer message, AONS can log, audit, and manage application-level business events, and combine these with network, server, and storage infrastructure events in a common, policy-driven management environment.
Content-based routing and transformation: message-based routing and transformation of protocol, content, data, and message formats (e.g., XML transformation). The individual features belonging to each of these primary categories are described in greater detail below.
3.5.6.1 Enhanced Security and Reliability
Authentication: AONS can verify the identity of the sender of an inbound message based upon various pieces of information contained within a given message (username/password, digital certificate, Security Assertion Markup Language (SAML) assertion, etc.), and, based upon these credentials, determine whether or not the message should be processed further.
Authorization: Once principal credentials are obtained via message inspection, AONS can determine what level of access the originator of the message should have to the services it is attempting to invoke. AONS may also make routing decisions based upon such derived privileges or block or mask certain data elements within a message once it's within an AONS network as appropriate.
Encryption/Decryption: Based upon policy, AONS can perform encryption of message elements (an entire message, the message body or individual elements such as credit card number) to maintain end-to-end confidentiality as a message travels through the AONS network. Conversely, AONS can perform decryption of these elements prior to arrival at a given endpoint.
Digital Signatures: In order to ensure message integrity and allow for non-repudiation of message transactions, AONS can digitally sign entire messages or individual message elements at any given AEP. The decision as to what gets signed will be determined by policy as applied to information derived from the contents and context of each message.
Reliability: AONS can complement existing guaranteed messaging systems by intermediating between unlike proprietary mechanisms. It can also provide reliability for HTTP-based applications (including web services) that currently lack reliable delivery. As an additional feature, AONS can generate confirmations of successful message delivery as well as automatically generate exception responses when delivery cannot be confirmed.
3.5.6.2 Infrastructure Optimization
Compression and stream-based data extraction: AEPs can compress message data prior to sending the message data across the network in order to conserve bandwidth and conversely decompress it prior to endpoint delivery. AEPs can also extract data to perform message classification without waiting for the whole message to be read in.
Caching: AONS can cache the results of previous message inquires based upon the rules defined for a type of request or based upon indicators set in the response. Caching can be performed for entire messages or for certain elements of a message in order to reduce application response time and conserve network bandwidth utilization. Message element caching enables delta processing for subsequent message requests.
TCP Connection Pooling: By serving as an intermediary between message clients and servers AONS can consolidate the total number of persistent connections required between applications. AONS thereby reduces the client and server-processing load otherwise associated with the ongoing initiation and teardown of connections between a mesh of endpoints.
Batching: An AONS intermediary can batch transactional messages destined for multiple destinations to reduce disk I/O overheads on the sending system. Similarly, transactional messages from multiple sources can be batched to reduce disk I/O overheads on the receiving system.
Hardware Acceleration: By efficiently performing compute-intensive functions such as encryption and Extensible Stylesheet Language Transformation (XSLT) transformations in an AONS network device using specialized hardware, AONS can offload the computing resources of endpoint servers, providing potentially lower-cost processing capability.
Quality of Service: AONS can integrate application-level QoS with network-level QoS features based on either explicit message prioritization (e.g., a message tagged as “high priority”) or via policy that determines when a higher quality of network service is required for a message as specific message content is detected.
Policy Enforcement: At the heart of optimizing the overall AONS solution is the ability to ensure business-level polices are expressed, implemented and enforced by the infrastructure. The AONS Policy Manager ensures that once messages are inspected, the appropriate actions (encryption, compression, routing, etc.) are taken against that message as appropriate.
3.5.6.3 Activity Monitoring and Management
Auditing/Logging/Metering: AONS can selectively filter messages and send them to a node or console for aggregation and subsequent analysis. Tools enable viewing and analysis of message traffic. AONS can also generate automatic responses to significant real-time events, both business and infrastructure-related. By intelligently gathering statistics and sending them to be logged, AONS can produce metering data for auditing or billing purposes.
Management: AONS can combine both message-level and network infrastructure level events to gain a deeper understanding of overall system health. The AONS management interface itself is available as a web service for those who wish to access it programmatically.
Testing and Validation: AONS' ability to intercept message traffic can be used to validate messages before allowing them to reach destination applications. In addition to protecting from possible application or server failures, this capability can be leveraged to test new web services and other functions by examining actual message flow from clients and servers prior to production deployment. AONS also provides a “debug mode” that can be turned on automatically after a suspected failure or manually after a notification to assist with the overall management of the device.
Workload Balancing and Failover: AONS provides an approach to workload balancing and failover that is both policy- and content-driven. For example, given an AONS node's capability to intermediate between heterogeneous systems, the AONS node can balance between unlike systems that provide access to common information as requested by the contents of a message. AONS can also address the issue of message affinity necessary to ensure failover at the message rather than just the session level as is done by most existing solutions. Balancing can also take into account the response time for getting a message reply, routing to an alternate destination if the preferred target is temporarily slow to respond.
Business Continuity: By providing the ability to replicate inbound messages to a remote destination, AONS enables customers to quickly recover from system outages. AONS can also detect failed message delivery and automatically re-route to alternate endpoints. AONS AEPs and ARs themselves have built-in redundancy and failover at the component level and can be clustered to ensure high availability.
3.5.6.4 Content-Based Routing and Transformation
Content-based Routing: Based upon its ability to inspect and understand the content and context of a message, AONS provides the capability to route messages to an appropriate destination by matching content elements against pre-established policy configurations. This capability allows AONS to provide a common interface (service virtualization) for messages handled by different applications, with AONS examining message type or fields in the content (part number, account type, employee location, customer zip code, etc.) to route the message to the appropriate application. This capability also allows AONS to send a message to multiple destinations (based on either statically defined or dynamic subscriptions to message types or information topics), with optimal fan-out through AONS routers. This capability further allows AONS to redirect all messages previously sent to an application so that it can be processed by a new application. This capability additionally allows AONS to route a message for a pre-processing step that is deemed to be required before receipt of a message (for example, introducing a management pre-approval step for all travel requests). This capability also allows AONS to route a copy of a message that exceeds certain criteria (e.g. value of order) to an auditing system, as well as forwarding the message to the intended destination. This capability further allows AONS to route a message to a particular server for workload or failover reasons. This capability also allows AONS to route a message to a particular server based on previous routing decisions (e.g., routing a query request based on which server handled for the original order). This capability additionally allows AONS to route based on the source of a message. This capability also allows AONS to route a message through a sequence of steps defined by a source or previous intermediary.
Message Protocol Gateway: AONS can act as a gateway between applications using different transport protocols. AONS supports open standard protocols (e.g. HTTP, FTP, SMTP), as well as popular or de facto standard proprietary protocols such as IBM MQ and JMS.
Message Transformations: AONS can transform the contents of a message to make them appropriate for a particular receiving application. This can be done for both XML and non-XML messages, the latter via the assistance of either a message dictionary definition or a well-defined industry standard format.
3.5.7 AONS Functional Modules
In one embodiment, AOS common services 806 include: security services, standard compression services, delta compression services, caching service, message logging service, policy management service, reliable messaging service, publish/subscribe service, activity monitoring service, message distribution service, XML parsing service, XSLT transformation service, and QoS management service.
In one embodiment, AOS protocol/access methods 810 include: TCP/SSL, HTTP/HTTPS, SOAP/HTTP, SMTP, FTP, JMS/MQ and JMS/RV, and Java Database Connectivity (JDBC).
In one embodiment, AOS message execution controller 808 includes: an execution controller, a flow subsystem, and a bladelet™ subsystem.
In one embodiment, AOS bladelets™ 818 and scriptlets™ 820 include: message input (read message), message output (send message), logging/audit, decision, external data access, XML parsing, XML transformation, caching, scriptlet container, publish, subscribe, message validation (schema, format, etc.), filtering/masking, signing, authentication, authorization, encryption, decryption, activity monitoring sourcing, activity monitoring marking, activity monitoring processing, activity monitoring notification, message discard, firewall block, firewall unblock, message intercept, and message stop-intercept.
In one embodiment, AOS configuration and management module 802 includes: configuration, monitoring, topology management, capability exchange, failover redundancy, reliability/availability/serviceability (RAS) services (tracing, debugging, etc.), archiving, installation, upgrades, licensing, sample scriptlets™, sample flows, documentation, online help, and language localization.
In one embodiment, supported platforms include: Cisco Catalyst 6503, Cisco Catalyst 6505, Cisco Catalyst 6509, and Cisco Catalyst 6513. These products are typically deployed in data centers. Other products, such as “branch office routers” (e.g., the Cisco Volant router series) and “edge routers” are also supported. In one embodiment, supported supervisor modules include: Sup2 and Sup720. In one embodiment, specific functional areas relating to the platform include: optimized TCP, SSL, public key infrastructure (PM), encryption/decryption, interface to Cat6K supervisor, failover/redundancy, image management, and QoS functionality. Although some embodiments of the invention are described herein with reference to PMI keys, embodiments of the invention are not limited to PMI keys. Other keys and/or tokens, such as Kerberos tokens and/or PGP tokens, may be used in conjunction with embodiments of the invention.
In one embodiment, cryptographic key distribution and processing is controlled by user-specified policies that are stored, with the keys, at a central console called an AMC. The policies may state, for example, that different kinds of keys are to be used to encrypt/decrypt/sign different kinds of data traffic. Keys may be associated with policies. The AMC may automatically distribute the key-to-policy associations to user-specified AONS nodes.
3.5.8 AONS Modes of Operation
AONS may be configured to run in multiple modes depending on application integration needs, and deployment scenarios. According to one embodiment, the primary modes of operation include implicit mode, explicit mode, and proxy mode. In implicit mode, an AONS node transparently intercepts relevant traffic with no changes to applications. In explicit mode, applications explicitly address traffic to an intermediary AONS node. In proxy mode, applications are configured to work in conjunction with AONS nodes, but applications do not explicitly address traffic to AONS nodes.
In implicit mode, applications are unaware of AONS presence. Messages are addressed to receiving applications. Messages are redirected to AONS via configuration of application “proxy” or middleware systems to route messages to AONS, and/or via configuration of networks (packet interception). For example, domain name server (DNS)-based redirection could be used to route messages. For another example, a 5-tuple-based access control list (ACL) on a switch or router could be used. Network-based application recognition and content switching modules may be configured for URL/URI redirection. Message-based inspection may be used to determine message types and classifications. In implicit mode, applications communicate with each other using AONS as an intermediary (implicitly), using application-native protocols.
Traffic redirection, message classification, and “early rejection” (sending traffic out of AONS layers prior to complete processing within AONS layers) may be accomplished via a variety of mechanisms, such as those depicted in
At the lowest layer, layer 902, all traffic passes through. At the next highest layer, layer 904, traffic may be filtered based on 5-tuples. A supervisor blade or a network operating system such as Internetwork Operating System (IOS) may perform such filtering. Traffic that passes the filters at layer 904 passes to layer 906. At layer 906, traffic may be further filtered based on network-based application recognition-like filtering and/or message classification and rejection. Traffic that passes the filters at layer 906 passes to layer 908. At layer 908, traffic may be further filtered based on protocol headers. For example, traffic may be filtered based on URLs/URIs in the traffic. Traffic that passes the filters at layer 908 passes to layer 910. At layer 910, traffic may be processed based on application layer messages, include headers and contents. For example, XPath content identification technology within messages may be used to process traffic at layer 910. An AONS blade may perform processing at layer 910. Thus, a select subset of all network traffic may be provided to an AONS blade.
In explicit mode, applications are aware of AONS presence. Messages are explicitly addressed to AONS nodes. Applications may communicate with AONS using AONP. AONS may perform service virtualization and destination selection.
In proxy mode, applications are explicitly unaware of AONS presence. Messages are addressed to their ultimate destinations (i.e., applications). However, client applications are configured to direct traffic via a proxy mode.
3.5.9 AONS Message Routing
Components of message management in AONS may be viewed from two perspectives: a node view and a cloud view.
Within AONS cloud 1010, the message is routed using AONP. Thus, using AONP, the message may be routed from AONS CP 1006 to an AONS router 1012, or from AONS CP 1006 to AONS SP 1008, or from AONS router 1012 to another AONS router, or from AONS router 1012 to AONS SP 1008. Messages processed at AONS nodes are processed in AONP format.
When the message reaches AONS SP 1008, AONS SP 1008 transforms the message into the message format used by server application 1014. AONS SP 1008 routes the message to server application 1014 using the message protocol of server application 1014. Alternatively, if AONS SP 1008 is not present, AONS CP 1006 may route the message to server application 1014.
The details of the message processing within AONS cloud 1010 can be understood via the following perspectives: Request/Response Message Flow, One-Way Message Flow, Message Flow with Reliable Delivery, Node-to-Node Communication, and multicast publish-subscribe.
Referring to
According to one embodiment, AONP is used in node-to-node communication with the next hop. In one embodiment, AONP uses HTTP. AONP headers may include HTTP or TCP headers. AONP may indicate RM ACK, QoS level, message priority, and message context (connection, message sequence numbers, message context identifier, entry node information, etc.). The actual message payload is in the message body. Asynchronous messaging may be used between AONS nodes. AONS may conduct route and node discovery via static configuration (next hop) and/or via dynamic discovery and route advertising (“lazy” discovery).
At circumscribed numeral 4, AEP CP 1506 sends the AONP message to an AONS router 1508. At circumscribed numeral 5, AONS router 1508 receives the AONP message. At circumscribed numeral 6, AONS router 1508 sends the AONP message to an AEP SP 1510. At circumscribed numeral 7, AEP SP 1510 receives the AONP message and removes the AONP header from the message, thus decapsulating the message. At circumscribed numeral 8, AEP SP 1510 sends the message to receiving application 1504.
At circumscribed numeral 9, AEP SP 1510 sends a reliable messaging (RM) acknowledgement (ACK) to AONS router 1508. At circumscribed numeral 10, AONS router 1508 receives the RM ACK and sends the RM ACK to AEP CP 1506. At circumscribed numeral 11, AEP CP 1506 receives the RM ACK and, in response, deletes the copy of the message that is stored in data store 1512. Because the delivery of the message has been acknowledged, there is no further need to store a copy of the message in data store 1512. Alternatively, if AEP CP 1506 does not receive the RM ACK within a specified period of time, then AEP CP 1506 resends the message.
Referring to
At circumscribed numeral 10, AEP SP 1610 sends a reliable messaging (RM) acknowledgement (ACK) to AONS router 1608. At circumscribed numeral 11, AONS router 1608 receives the RM ACK and sends the RM ACK to AEP CP 1606. At circumscribed numeral 12, AEP CP 1606 receives the RM ACK and, in response, deletes the copy of the message that is stored in data store 1612. Because the delivery of the message has been acknowledged, there is no further need to store a copy of the message in data store 1612. Alternatively, if AEP CP 1606 does not receive the RM ACK within a specified period of time, then AEP CP 1606 resends the message. If the resend is not successful within a timeout period, a “delivery-failure” notification message will be send to the original sending application.
At circumscribed numeral 6, AONS node 1706 receives a response message from server 1708 on the same connection on which AONS node 1706 sent the request message. At circumscribed numeral 7, AONS node 1706 reads the message, correlates the message with the request message, executes a flow, and adds an AONP header to the message. At circumscribed numeral 8, AONS node 1706 sends the message to AONS node 1704. At circumscribed numeral 9, AONS node 1704 reads the message, correlates the message with the request message, executes a flow, and removes the AONP header from the message, formatting the message according to the message format expected by client 1702. At circumscribed numeral 10, AONS node 1704 sends the message to client 1702 on the same connection on which client 1702 sent the request message to AONS node 1704.
According to the node view, the message lifecycle within an AONS node, involves ingress/egress processing, message processing, message execution control, and flow execution.
In one embodiment, executing the flow comprises executing each step (i.e., bladelet™/action) of the flow. If a bladelet™ is to be run within a separate context, then AMEC framework 1902 may enqueue into bladelet™-specific queues, and, based on thread availability, dequeue appropriate bladelet™ states from each bladelet™ queue.
3.5.10 Flows, Bladelets™, and Scriptlets™
According to one embodiment, flows string together bladelets™ (i.e., actions) to customize message processing logic. Scriptlets™ provide a mechanism for customers and partners to customize or extend native AONS functionality. Some bladelets™ and services may be provided with an AONS node.
3.5.11 AONS Services
As mentioned in the previous section, a set of core services may be provided by AONS to form the underlying foundation of value-added functionality that can be delivered via an AONS node. In one embodiment, these include: Security Services, Standard Compression Services, Delta Compression Services, Caching Service, Message Logging Service, Policy Management Service (Policy Manager), Reliable Messaging Service, Publish/Subscribe Service, Activity Monitoring Service, Message Distribution Service, XML Parsing Service, XSLT Transformation Service, and QoS Management Service. In one embodiment, each AONS core service is implemented within the context of a service framework.
3.5.12 AONS Configuration and Management
In one embodiment, an AONS node is provisioned and configured for a class of application messages, where it enforces the policies that are declaratively defined on behalf-of the application end-points, business-domains, security-domains, administrative domains, and network-domains. Furthermore, the AONS node promotes flexible composition and customization of different product functional features by means of configurability and extensibility of different software and hardware sub-systems for a given deployment scenario. Due to the application and network embodiments of the AONS functionality, the AONS architecture framework should effectively and uniformly address different aspects of configurability, manageability, and monitorability of the various system components and their environments.
The AONS Configuration and Management framework is based upon five functional areas (“FCAPS”) for network management as recommended by the ISO network management forum. The functional areas include fault management, configuration management, accounting management, performance management, and security management. Fault management is the process of discovering, isolating, and fixing the problems or faults in the AONS nodes. Configuration management is the process of finding and setting up the AONS nodes. Accounting management involves tracking usage and utilization of AONS resources to facilitate their proper usage. Performance management is the process of measuring the performance of the AONS system components and the overall system. Security management controls access to information on the AONS system. Much of the above functionality is handled via proper instrumentation, programming interfaces, and tools as part of the overall AONS solution.
3.5.13 AONS Monitoring
In one embodiment, AONS is instrumented to support well-defined events for appropriate monitoring and visibility into internal processing activities. The monitoring of AONS nodes may be accomplished via a pre-defined JMX MBean agent that is running on each AONS node. This agent communicates with a remote JMX MBean server on the PC complex. An AONS MIB is leveraged for SNMP integration to third party consoles.
3.5.14 AONS Tools
In one embodiment, the following tool sets are provided for various functional needs of AONS: a design studio, an admin studio, and a message log viewer. The design studio is a visual tool for designing flows and applying message classification and mapping policies. The admin studio is a web-based interface to perform all administration and configuration functions. The message log viewer is a visual interface to analyze message traffic, patterns, and trace information.
3.5.15 AONS Structured Application Message Processing
Having AONS in the data path of the network offers a unique ability to analyze and modify packets as they pass through the network. Network elements such as routers, switches, and bridges typically operate at layers 4 and below of the OSI stack. An embodiment of the invention operates in the context of deeper content processing in a network element on behalf of applications running on end systems connected by a computer network or a network of networks.
One embodiment analyzes packet information as they pass through the AONS blade. As discussed above, the various protocol layers are first peeled away by the AONS blade to reveal the packet payload. The embodiment modifies any packet information needed before determining the packet destination. A packet may be routed to a destination that is different than the destination originally addressed in the packet. This is determined by the packet payload information.
The AONS blade 2602 analyzes the packet using pre-determined rules described in further detail below. The AONS blade 2602 may modify packet information based on the rules. Once the packet is analyzed to determine its classification, the AONS blade 2602 routes the packet 2603A to the destination through port 2609. The destination may be different than the destination originally addressed in the packet. This may be due to the information parsed from the packet or the result of an operation that changed part of the packet information. The packet may also be stored on the AONS blade 2602 for later use.
An embodiment analyzes any structured message packet. Structured message formats include XML, proprietary formats such as FIX, well-known structures such as tables, comma-separated values, etc.
The system then applies the specified sequence of operations to the message in a specified order 2702. For example, a certain sub-tree of the message may have to be extracted and replaced by a different sub-tree stored in the AONS blade or in an external database. Validation of the message can occur before the message is modified, although the two operations are not required to be performed in a particular sequence.
The system either sends the message out to one or more destinations (which may be specified in the table), or stores it in an internal or external database for later use (as specified by the last operation in the sequence) 2703.
An embodiment of the invention is discussed below in the context of eXtensible Markup Language, or XML, formatted messages, but, as discussed above, other embodiments handle any type of structured message.
An XML message is structurally organized as a hierarchy or tree. The message consists of one or more “elements”. Each element may have a number of other items associated with it, such as “attributes”, “text value”, and special items such as namespace and processing instructions.
A beginning and an end indicator denote element boundaries. For example, the beginning of an element of name “Name” is indicated by <Name>, while the end of that element is indicated by </Name>. All items that occur within the two delimiters of an element are understood to be within that element's scope.
A “root” node in the tree represents an entire message. For example, any element X that occurs within the scope of another element Y is a descendent of Y; conversely, Y is an ancestor of X. If X is not the descendent of any other element within the scope of Y, then X is a child of Y; conversely, Y is the parent of X
One or more of the following operations can be performed on a message encoded in the XML format:
Two standard forms of data structures are the Document Object Model (DOM) and Simple API to XML (SAX). DOM captures all the information present in a message and presents to the application, a tree structure to work with, while SAX simply captures each “event” in the message (such as the beginning of an element, end of an element, beginning of an attribute, value, etc.) and expects the application to infer the structural relationships
The system uses the data structures developed during parsing to access the necessary information inside the message and manipulate that information as required by a specified operation 2803.
If the content of the message is modified during an operation, then the new message is re-parsed and the data structures are re-created so they can be used in subsequent operations 2804.
Given the current performance of processors and the cost of memory, this approach has several weaknesses that affect system performance. First, it is unusual for an application to require access to all parts of a message. In fact, only small portions of a message are accessed in most instances. But the above approach simply assumes that the entire message is arbitrarily accessed and gathers all of that information a priori, whether or not it is utilized by the application.
Secondly, the sequence of operations applied to a message is pre-determined. Once the message is classified, whereby the sequence of operations to be applied is determined, neither the sequence nor the specific operations changes. Again, the above approach assumes implicitly that any arbitrary sequence of operations is possible and prepares a priori for that eventuality.
Finally, the data structures created from parsing tend to be space-intensive. For example, it is not unusual that the data structures use 5-20 fold more space than the original XML message. This can be deadly in a multiprocessor system if these data structures have to be moved around between processors if they do not share memory.
It is well known in the industry that parsing an XML message and creating its DOM representation is a very expensive operation, typically consuming on the order of 50 CPU cycles per one bit of input. This means that about 50 GHz of compute power is needed to be able to parse a message-traffic of 1 Gb/s. This will increase substantially when all other operations are added, particularly validation and complex transformations, which tend to be even more expensive than parsing. However, such a straightforward implementation can be used when processor performance reaches the threshold that will accommodate such computations.
Another embodiment operates more efficiently than the straightforward approach. This embodiment parses only parts of the message that contain the information needed to identify and classify the message. It further improves efficiency by scanning a message for different sets of items in a single pass. Another embodiment pushes some of the expensive operations into hardware such as a custom ASIC or FPGA to further improve performance.
Structured messages have a distinct format that can be searched or parsed to discover desired portions of a message. This allows an administrator or customer to easily specify what types of messages need special treatment. Given that the structure of a message is known ahead of time, an embodiment of the invention can be told by an administrator or customer what information to find in a message to use for classifying the message, how to access the information, and what operations to perform on the message depending upon the value of the information. The system first extracts the portion of the message necessary for classifying the message using pre-determined message format information 2901.
Using the XML message example, the system is told how to parse the XML message through XPath expressions (XPath is a standard language developed by the World Wide Web Consortium, or W3C). An XPath expression can specify structural relationships as well as value requirements of the parts of the message to be used. The XPath expressions are downloaded to the AONS blade through provisioning or some other management interface.
The XPath expressions are analyzed and the system determines what parts of the message are of interest. For example, the analysis can tell the system that at least one of the following parts of the message is used to classify the message:
The system extracts the part(s) of the message that is/are needed from the analysis. The XPath analysis is performed off-line by the system, independent of the incoming messages, and before receiving a message to which the analysis will have to be applied. No such analysis is required while processing the message itself.
The message is then classified using the values of the extracted information. The XPath expressions are used to evaluate the extracted information 2902. The classification can be based on a certain value, name, destination, combinations of information, etc. In most instances, message classification is based on either the message header or, in addition to the header, some small initial part of the message body itself. It is rare to have to look deep into a message to classify it. The system does not make any assumption about which parts of a message need to be looked at for the purpose of classifying the message. The important point to observe is that the system knows beforehand how a message will have to be classified given the value of certain information.
When a message is received by the system, it classifies the message by first extracting the information from the message necessary for classification and then applying the XPath expressions to that information. The result is that zero or more expressions are satisfied and, if multiple expressions are satisfied, then the first expression is chosen and the corresponding classification type is assigned to the message.
Prudent pre-processing and analysis of both the classification requirements and the operations sequences makes it possible to identify the precise sets of elements, attributes, or other items that need to be extracted/aggregated. The analysis further indicates where the items can be found. This information in turn is used to limit the fraction of the incoming message that needs to be processed in order to provide data for classification and/or the subsequent operations on the message. These two facets of the analysis are used to ensure that no item in the incoming message is accessed more than once (i.e., single-pass) to extract the necessary parts of the message.
For example, consider a Purchase Order formatted in XML. The Purchase Order contains the ordering party's information represented by elements—company name, street address, city, zip, and phone number, and multiple instances of an item element, where each item element has a name, a number, a description, and a price as its child elements. The system allows the administrator or customer to classify such messages based on the total amount of the order. The message is of type 1 if the total amount exceeds $100,000, type 2 if the total amount is between $50,000 and $100,000, and type 3 if the total amount is under $50,000. This can be expressed by three XPath expressions: sum(price)>100000; sum(price)>50000 and sum(price)=<100000; and sum(price)<50000. It is clear in this example that only the “price” elements need to be accessed and their values accumulated.
Thus, by analyzing a given set of XPath expressions for message classification the system is able consider only the relevant parts of the message and ignore the rest of the message. In addition, as the above example shows, all that needs to be done in many cases is to extract some information from the message, aggregate it in some fashion, and then compare it to some known value or directly compare it to a known value (or values). Special data structures do not need to be built, nor does a representation of the original message as a DOM, SAX, or any other means need be developed for this purpose.
A unique sequence of operations is implied by the classification and those operations must then be applied to the message 2903. As with the classification XPath expressions, these operations are also known a priori and can be pre-analyzed to make intelligent decisions about the parts of the message that need to be accessed. Some of the operations can be identical to the classification process itself. For example, extracting parts of the message and routing the message are two such operations. The system treats them in the same manner as above and extracts the relevant parts of the message without having to build any explicit data structures representing the message for that purpose.
The operations may tell the system that the message is to be routed to a destination different from the originally addressed destination or is to be stored in a local database or an external database 2904.
Given the example above, the operations may specify that type 1 messages are to be routed to machine A, type 2 messages are to be routed to machine B, and type 3 messages are to be routed to machine C.
A validation operation operates on the entire message, while most of the transformation operations listed above can be accomplished without having to access the entire message. For instance, if the system needs to replace a sub-tree in the message, then it is sufficient to extract that sub-tree. Only in the most general case of global changes to the message does the system need to work on the entire message.
As discussed above, it is currently not possible to achieve gigabit throughputs with a small number of general-purpose processors when the operations take 50 or more cycles per bit. One could use an array of servers in a general setting, but the interest here is with a system that is physically limited to a single chassis or even to a single board within a chassis. This prohibits the use of a large number of processors simply due to space and electric power constraints. It also makes it essential that at least some of the more expensive operations be pushed into hardware. Although not all functions can be pushed into hardware. For example, some of the operations are still evolving through the standardization process. For instance, XPath 2.0 is a new version of XPath (the current version being 1.0) and an alternative to XPath itself, XQuery, is also gaining momentum.
Operations such as extracting some selected parts from an XML message can be largely performed in flexible custom hardware that can also provide some amount of programmability. Since the extraction operation can be reused in several other operations, including most types of transformations, it can be a prime candidate for custom hardware. Such a device can receive a set of XPath expressions pre-processed into instructions that specify the parts of the message that need to be extracted (for the purposes of classifying the message and performing operations on the message) and then applies the instructions to an incoming XML message. The output of the device could be the set of XPath expressions satisfied by the message.
The efficiency of the embodiment of the invention comes from multiple sources:
The impact of all of these techniques together is substantial, particularly when the ratio of the message size to the size of the parts of the message accessed is high. Such scenarios frequently arise during classification and also in transformations that do not perform global modifications to the message. When the message size is large, the custom hardware makes it possible to quickly extract the parts of interest that can then be processed during the operations. This leads to a dual positive effect:
Consider the following example:
Thus, as compared to first generating a DOM representation and then applying each of the operations to the message, this embodiment can provide a phenomenal increase in performance, as a linear function of the message size reduction (i.e., the fraction of message utilizing for processing). A typical message of 5 kB can be classified using a few hundred bytes (on the order of 200-300 in most instances), giving a ratio of nearly 20. This embodiment speeds up the process by a similar factor.
4.0 Implementation Mechanisms—Hardware Overview
Computer system 500 includes a bus 502 or other communication mechanism for communicating information, and a processor 504 coupled with bus 502 for processing information. Computer system 500 also includes a main memory 506, such as a random access memory (RAM), flash memory, or other dynamic storage device, coupled to bus 502 for storing information and instructions to be executed by processor 504. Main memory 506 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 504. Computer system 500 further includes a read only memory (ROM) 508 or other static storage device coupled to bus 502 for storing static information and instructions for processor 504. A storage device 510, such as a magnetic disk, flash memory or optical disk, is provided and coupled to bus 502 for storing information and instructions.
A communication interface 518 may be coupled to bus 502 for communicating information and command selections to processor 504. Interface 518 is a conventional serial interface such as an RS-232 or RS-322 interface. An external terminal 512 or other computer system connects to the computer system 500 and provides commands to it using the interface 514. Firmware or software running in the computer system 500 provides a terminal interface or character-based command interface so that external commands can be given to the computer system.
A switching system 516 is coupled to bus 502 and has an input interface 514 and an output interface 519 to one or more external network elements. The external network elements may include a local network 522 coupled to one or more hosts 524, or a global network such as Internet 528 having one or more servers 530. The switching system 516 switches information traffic arriving on input interface 514 to output interface 519 according to pre-determined protocols and conventions that are well known. For example, switching system 516, in cooperation with processor 504, can determine a destination of a packet of data arriving on input interface 514 and send it to the correct destination using output interface 519. The destinations may include host 524, server 530, other end stations, or other routing and switching devices in local network 522 or Internet 528.
The invention is related to the use of computer system 500 for avoiding the storage of client state on computer system 500. According to one embodiment of the invention, computer system 500 provides for such updating in response to processor 504 executing one or more sequences of one or more instructions contained in main memory 506. Such instructions may be read into main memory 506 from another computer-readable medium, such as storage device 510. Execution of the sequences of instructions contained in main memory 506 causes processor 504 to perform the process steps described herein. One or more processors in a multi-processing arrangement may also be employed to execute the sequences of instructions contained in main memory 506. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
The term “computer-readable medium” as used herein refers to any medium that participates in providing instructions to processor 504 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 510. Volatile media includes dynamic memory, such as main memory 506. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 502. Transmission media can also take the form of acoustic or light waves, such as those generated during radio wave and infrared data communications.
Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punch cards, paper tape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to processor 504 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 500 can receive the data on the telephone line and use an infrared transmitter to convert the data to an infrared signal. An infrared detector coupled to bus 502 can receive the data carried in the infrared signal and place the data on bus 502. Bus 502 carries the data to main memory 506, from which processor 504 retrieves and executes the instructions. The instructions received by main memory 506 may optionally be stored on storage device 510 either before or after execution by processor 504.
Communication interface 518 also provides a two-way data communication coupling to a network link 520 that is connected to a local network 522. For example, communication interface 518 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 518 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 518 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 520 typically provides data communication through one or more networks to other data devices. For example, network link 520 may provide a connection through local network 522 to a host computer 524 or to data equipment operated by an Internet Service Provider (ISP) 526. ISP 526 in turn provides data communication services through the worldwide packet data communication network now commonly referred to as the “Internet” 528. Local network 522 and Internet 528 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 520 and through communication interface 518, which carry the digital data to and from computer system 500, are exemplary forms of carrier waves transporting the information.
Computer system 500 can send messages and receive data, including program code, through the network(s), network link 520 and communication interface 518. In the Internet example, a server 530 might transmit a requested code for an application program through Internet 528, ISP 526, local network 522 and communication interface 518. In accordance with the invention, one such downloaded application provides for avoiding the storage of client state on a server as described herein.
Processor 504 may execute the received code as it is received and/or stored in storage device 510 or other non-volatile storage for later execution. In this manner, computer system 500 may obtain application code in the form of a carrier wave.
5.0 Extensions and Alternatives
In the foregoing specification, the invention has been described with reference to specific embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
This application claims the benefit as a Continuation of U.S. patent application Ser. No. 11/089,794, filed Mar. 24, 2005, which is a continuation-in-part of U.S. patent application Ser. No. 11/005,978, filed on Dec. 6, 2004, the entire contents of which are hereby incorporated by reference for all purposes as if fully set forth herein. The applicant(s) hereby rescind any disclaimer of claim scope in the parent application(s) or the prosecution history thereof and advise the USPTO that the claims in this application may be broader than any claim in the parent application(s).
| Number | Name | Date | Kind |
|---|---|---|---|
| 4688026 | Scribner et al. | Aug 1987 | A |
| 5339073 | Dodd et al. | Aug 1994 | A |
| 5646616 | Komatsu | Jul 1997 | A |
| 5790542 | Kim et al. | Aug 1998 | A |
| 5796743 | Bunting et al. | Aug 1998 | A |
| 5850187 | Carrender et al. | Dec 1998 | A |
| 5887176 | Griffith et al. | Mar 1999 | A |
| 5960200 | Eager et al. | Sep 1999 | A |
| 6012090 | Chung et al. | Jan 2000 | A |
| 6021135 | Ishihara et al. | Feb 2000 | A |
| 6070187 | Subramaniam et al. | May 2000 | A |
| 6085234 | Pitts et al. | Jul 2000 | A |
| 6111517 | Atick et al. | Aug 2000 | A |
| 6115079 | McRae | Sep 2000 | A |
| 6115378 | Hendel et al. | Sep 2000 | A |
| 6125391 | Meltzer et al. | Sep 2000 | A |
| 6145079 | Mitty et al. | Nov 2000 | A |
| 6167438 | Yates et al. | Dec 2000 | A |
| 6226675 | Meltzer et al. | May 2001 | B1 |
| 6300903 | Richards et al. | Oct 2001 | B1 |
| 6321264 | Fletcher et al. | Nov 2001 | B1 |
| 6337856 | Schanhals et al. | Jan 2002 | B1 |
| 6341130 | Lakshman et al. | Jan 2002 | B1 |
| 6356951 | Gentry | Mar 2002 | B1 |
| 6363477 | Fletcher et al. | Mar 2002 | B1 |
| 6389462 | Cohen et al. | May 2002 | B1 |
| 6510434 | Anderson et al. | Jan 2003 | B1 |
| 6510464 | Grantges et al. | Jan 2003 | B1 |
| 6539281 | Wan et al. | Mar 2003 | B2 |
| 6553489 | Osler et al. | Apr 2003 | B1 |
| 6587431 | Almulhem et al. | Jul 2003 | B1 |
| 6597918 | Kim | Jul 2003 | B1 |
| 6611526 | Chinnaswamy et al. | Aug 2003 | B1 |
| 6678827 | Rothermel et al. | Jan 2004 | B1 |
| 6683881 | Mijares et al. | Jan 2004 | B1 |
| 6718326 | Uga et al. | Apr 2004 | B2 |
| 6745041 | Allison et al. | Jun 2004 | B2 |
| 6766330 | Chen et al. | Jul 2004 | B1 |
| 6766361 | Venigalla | Jul 2004 | B1 |
| 6771646 | Sarkissian et al. | Aug 2004 | B1 |
| 6772211 | Lu et al. | Aug 2004 | B2 |
| 6772223 | Corl, Jr. et al. | Aug 2004 | B1 |
| 6785673 | Fernandez et al. | Aug 2004 | B1 |
| 6785732 | Bates et al. | Aug 2004 | B1 |
| 6792002 | Tezuka et al. | Sep 2004 | B2 |
| 6813690 | Lango et al. | Nov 2004 | B1 |
| 6816455 | Goldberg et al. | Nov 2004 | B2 |
| 6820133 | Grove et al. | Nov 2004 | B1 |
| 6826694 | Dutta et al. | Nov 2004 | B1 |
| 6832249 | Ciscon et al. | Dec 2004 | B2 |
| 6836778 | Manikutty et al. | Dec 2004 | B2 |
| 6862270 | Ho | Mar 2005 | B1 |
| 6868426 | Mankoff | Mar 2005 | B1 |
| 6901445 | McCanne et al. | May 2005 | B2 |
| 6944678 | Lu et al. | Sep 2005 | B2 |
| 6950822 | Idicula et al. | Sep 2005 | B1 |
| 6963282 | Yeates et al. | Nov 2005 | B1 |
| 6965599 | Sakurai et al. | Nov 2005 | B1 |
| 6976085 | Aviani et al. | Dec 2005 | B1 |
| 6996842 | Strahm et al. | Feb 2006 | B2 |
| 7031314 | Craig et al. | Apr 2006 | B2 |
| 7032031 | Jungck et al. | Apr 2006 | B2 |
| 7051042 | Krishnaprasad et al. | May 2006 | B2 |
| 7057511 | Shanks et al. | Jun 2006 | B2 |
| 7058973 | Sultan | Jun 2006 | B1 |
| 7064660 | Perkins et al. | Jun 2006 | B2 |
| 7065086 | Basso et al. | Jun 2006 | B2 |
| 7075412 | Reynolds et al. | Jul 2006 | B1 |
| 7080158 | Squire | Jul 2006 | B1 |
| 7081819 | Martinez de Velasco Cortina et al. | Jul 2006 | B2 |
| 7089586 | Kilgore | Aug 2006 | B2 |
| 7103611 | Murthy et al. | Sep 2006 | B2 |
| 7103886 | Haller et al. | Sep 2006 | B2 |
| 7111076 | Abjanic et al. | Sep 2006 | B2 |
| 7111163 | Haney | Sep 2006 | B1 |
| 7114008 | Jungck et al. | Sep 2006 | B2 |
| 7120645 | Manikutty et al. | Oct 2006 | B2 |
| 7126907 | Carpini et al. | Oct 2006 | B2 |
| 7129837 | Shannon et al. | Oct 2006 | B2 |
| 7134075 | Hind et al. | Nov 2006 | B2 |
| 7149222 | Wiryaman et al. | Dec 2006 | B2 |
| 7177952 | Wurch et al. | Feb 2007 | B1 |
| 7185063 | Kasriel et al. | Feb 2007 | B1 |
| 7185365 | Tang et al. | Feb 2007 | B2 |
| 7188216 | Rajkumar et al. | Mar 2007 | B1 |
| 7205897 | Lin | Apr 2007 | B2 |
| 7215637 | Ferguson et al. | May 2007 | B1 |
| 7215641 | Bechtolsheim et al. | May 2007 | B1 |
| 7239634 | Chakravorty | Jul 2007 | B1 |
| 7245620 | Shankar | Jul 2007 | B2 |
| 7281205 | Brook | Oct 2007 | B2 |
| 7281206 | Schnelle et al. | Oct 2007 | B2 |
| 7296268 | Darling et al. | Nov 2007 | B2 |
| 7299361 | Kim et al. | Nov 2007 | B1 |
| 7321556 | Parekh et al. | Jan 2008 | B1 |
| 7330908 | Jungck | Feb 2008 | B2 |
| 7345585 | Singhal et al. | Mar 2008 | B2 |
| 7362763 | Wybenga et al. | Apr 2008 | B2 |
| 7363353 | Ganesan et al. | Apr 2008 | B2 |
| 7376750 | Simu | May 2008 | B1 |
| 7376755 | Pandya | May 2008 | B2 |
| 7386567 | Manikutty et al. | Jun 2008 | B2 |
| 7392259 | Lee et al. | Jun 2008 | B2 |
| 7415512 | Moon | Aug 2008 | B1 |
| 7421695 | Murray et al. | Sep 2008 | B2 |
| 7437451 | Tang et al. | Oct 2008 | B2 |
| 7451392 | Chalecki et al. | Nov 2008 | B1 |
| 7469300 | De Bonet et al. | Dec 2008 | B2 |
| 7475108 | Di Giulio et al. | Jan 2009 | B2 |
| 7483421 | Compton | Jan 2009 | B2 |
| 7590704 | Yuan et al. | Sep 2009 | B2 |
| 7590843 | Khalil et al. | Sep 2009 | B1 |
| 7725934 | Kumar et al. | May 2010 | B2 |
| 7987271 | O'Toole et al. | Jul 2011 | B1 |
| 8255932 | Clem et al. | Aug 2012 | B1 |
| 20010000083 | Crow et al. | Mar 2001 | A1 |
| 20010027104 | Hameleers et al. | Oct 2001 | A1 |
| 20010028308 | De La Huerga | Oct 2001 | A1 |
| 20010047422 | McTernan et al. | Nov 2001 | A1 |
| 20010056504 | Kuznetsov | Dec 2001 | A1 |
| 20020012433 | Haverinen et al. | Jan 2002 | A1 |
| 20020015485 | Bhusri | Feb 2002 | A1 |
| 20020016739 | Ogasawara | Feb 2002 | A1 |
| 20020059428 | Susai et al. | May 2002 | A1 |
| 20020069279 | Romero et al. | Jun 2002 | A1 |
| 20020072379 | Chen et al. | Jun 2002 | A1 |
| 20020083187 | Sim et al. | Jun 2002 | A1 |
| 20020083817 | Hoshino | Jul 2002 | A1 |
| 20020101848 | Lee et al. | Aug 2002 | A1 |
| 20020105911 | Pruthi et al. | Aug 2002 | A1 |
| 20020107951 | Teague et al. | Aug 2002 | A1 |
| 20020114274 | Sturges et al. | Aug 2002 | A1 |
| 20020126672 | Chow et al. | Sep 2002 | A1 |
| 20020136403 | Henson et al. | Sep 2002 | A1 |
| 20020141393 | Eriksson et al. | Oct 2002 | A1 |
| 20020143981 | DeLima et al. | Oct 2002 | A1 |
| 20020152399 | Smith | Oct 2002 | A1 |
| 20020161907 | Moon | Oct 2002 | A1 |
| 20020163933 | Benveniste | Nov 2002 | A1 |
| 20020165957 | Devoe et al. | Nov 2002 | A1 |
| 20020191622 | Zdan | Dec 2002 | A1 |
| 20020194342 | Lu et al. | Dec 2002 | A1 |
| 20020194345 | Lu et al. | Dec 2002 | A1 |
| 20020194350 | Lu et al. | Dec 2002 | A1 |
| 20030005117 | Kang et al. | Jan 2003 | A1 |
| 20030009571 | Bavadekar | Jan 2003 | A1 |
| 20030014665 | Anderson et al. | Jan 2003 | A1 |
| 20030018726 | Low et al. | Jan 2003 | A1 |
| 20030026268 | Navas | Feb 2003 | A1 |
| 20030028599 | Kolsky | Feb 2003 | A1 |
| 20030028616 | Aoki et al. | Feb 2003 | A1 |
| 20030036897 | Flores et al. | Feb 2003 | A1 |
| 20030046429 | Sonksen | Mar 2003 | A1 |
| 20030055818 | Faybishenko et al. | Mar 2003 | A1 |
| 20030065711 | Acharya | Apr 2003 | A1 |
| 20030069975 | Abjanic et al. | Apr 2003 | A1 |
| 20030078031 | Masuda | Apr 2003 | A1 |
| 20030084279 | Campagna | May 2003 | A1 |
| 20030093530 | Syed | May 2003 | A1 |
| 20030095569 | Wengrovitz et al. | May 2003 | A1 |
| 20030105903 | Garnett et al. | Jun 2003 | A1 |
| 20030112802 | Ono et al. | Jun 2003 | A1 |
| 20030112809 | Bharali et al. | Jun 2003 | A1 |
| 20030115448 | Bouchard | Jun 2003 | A1 |
| 20030140140 | Lahtinen | Jul 2003 | A1 |
| 20030163539 | Piccinelli | Aug 2003 | A1 |
| 20030163603 | Fry et al. | Aug 2003 | A1 |
| 20030177183 | Cabrera et al. | Sep 2003 | A1 |
| 20030188192 | Tang et al. | Oct 2003 | A1 |
| 20030189935 | Warden et al. | Oct 2003 | A1 |
| 20030202535 | Foster et al. | Oct 2003 | A1 |
| 20030204626 | Wheeler | Oct 2003 | A1 |
| 20030204719 | Ben-Itzhak | Oct 2003 | A1 |
| 20030217171 | Von Stuermer et al. | Nov 2003 | A1 |
| 20030217176 | Beunings | Nov 2003 | A1 |
| 20030236883 | Takeshima et al. | Dec 2003 | A1 |
| 20040001444 | Sadot et al. | Jan 2004 | A1 |
| 20040006613 | Lemieux et al. | Jan 2004 | A1 |
| 20040021569 | Lepkofker et al. | Feb 2004 | A1 |
| 20040022250 | Chen et al. | Feb 2004 | A1 |
| 20040022255 | Chen et al. | Feb 2004 | A1 |
| 20040024868 | Drummond | Feb 2004 | A1 |
| 20040024881 | Elving et al. | Feb 2004 | A1 |
| 20040032881 | Arai | Feb 2004 | A1 |
| 20040039940 | Cox et al. | Feb 2004 | A1 |
| 20040044766 | Pauly et al. | Mar 2004 | A1 |
| 20040054886 | Dickinson et al. | Mar 2004 | A1 |
| 20040061646 | Andrews et al. | Apr 2004 | A1 |
| 20040064586 | Weigand | Apr 2004 | A1 |
| 20040068576 | Lindbo et al. | Apr 2004 | A1 |
| 20040069852 | Seppinen et al. | Apr 2004 | A1 |
| 20040088460 | Poisner | May 2004 | A1 |
| 20040088585 | Kaler et al. | May 2004 | A1 |
| 20040100383 | Chen et al. | May 2004 | A1 |
| 20040108795 | Meek et al. | Jun 2004 | A1 |
| 20040121789 | Lindsey | Jun 2004 | A1 |
| 20040128389 | Kopchik | Jul 2004 | A1 |
| 20040133775 | Callas et al. | Jul 2004 | A1 |
| 20040136371 | Muralidhar et al. | Jul 2004 | A1 |
| 20040162871 | Pabla et al. | Aug 2004 | A1 |
| 20040167986 | Gilfix et al. | Aug 2004 | A1 |
| 20040170182 | Higashida et al. | Sep 2004 | A1 |
| 20040177160 | Seto et al. | Sep 2004 | A1 |
| 20040186883 | Nyman et al. | Sep 2004 | A1 |
| 20040194112 | Whittenberger et al. | Sep 2004 | A1 |
| 20040205136 | Whittenberger et al. | Oct 2004 | A1 |
| 20040205336 | Kessler et al. | Oct 2004 | A1 |
| 20040205770 | Zhang et al. | Oct 2004 | A1 |
| 20040221319 | Zenoni | Nov 2004 | A1 |
| 20040257202 | Coughlin et al. | Dec 2004 | A1 |
| 20040264481 | Darling et al. | Dec 2004 | A1 |
| 20040267920 | Hydrie et al. | Dec 2004 | A1 |
| 20040267930 | Giulio et al. | Dec 2004 | A1 |
| 20040267933 | Przybylski et al. | Dec 2004 | A1 |
| 20040268357 | Joy et al. | Dec 2004 | A1 |
| 20050005031 | Gordy et al. | Jan 2005 | A1 |
| 20050015619 | Lee | Jan 2005 | A1 |
| 20050021626 | Prajapat et al. | Jan 2005 | A1 |
| 20050021836 | Reed et al. | Jan 2005 | A1 |
| 20050025091 | Patel et al. | Feb 2005 | A1 |
| 20050041670 | Lin et al. | Feb 2005 | A1 |
| 20050050000 | Kwok et al. | Mar 2005 | A1 |
| 20050050021 | Timmons | Mar 2005 | A1 |
| 20050050362 | Peles | Mar 2005 | A1 |
| 20050054346 | Windham et al. | Mar 2005 | A1 |
| 20050063377 | Bryant et al. | Mar 2005 | A1 |
| 20050071508 | Brown et al. | Mar 2005 | A1 |
| 20050076332 | Jawaharlal et al. | Apr 2005 | A1 |
| 20050080914 | Lerner et al. | Apr 2005 | A1 |
| 20050086342 | Burt et al. | Apr 2005 | A1 |
| 20050093679 | Zai et al. | May 2005 | A1 |
| 20050094611 | Cheong et al. | May 2005 | A1 |
| 20050097455 | Zhou et al. | May 2005 | A1 |
| 20050099270 | Diorio et al. | May 2005 | A1 |
| 20050102393 | Murray et al. | May 2005 | A1 |
| 20050114394 | Kaipa et al. | May 2005 | A1 |
| 20050117576 | McDysan et al. | Jun 2005 | A1 |
| 20050148314 | Taglienti et al. | Jul 2005 | A1 |
| 20050165828 | Lango et al. | Jul 2005 | A1 |
| 20050169171 | Cheng et al. | Aug 2005 | A1 |
| 20050188103 | Chen | Aug 2005 | A1 |
| 20050198351 | Nog et al. | Sep 2005 | A1 |
| 20050199716 | Shafer et al. | Sep 2005 | A1 |
| 20050209947 | Shafer | Sep 2005 | A1 |
| 20050213591 | Nakazawa et al. | Sep 2005 | A1 |
| 20050216727 | Chattopadhyay et al. | Sep 2005 | A1 |
| 20050228893 | Devarapalli et al. | Oct 2005 | A1 |
| 20050229243 | Svendsen et al. | Oct 2005 | A1 |
| 20050252957 | Howarth et al. | Nov 2005 | A1 |
| 20050252970 | Howarth et al. | Nov 2005 | A1 |
| 20050252971 | Howarth et al. | Nov 2005 | A1 |
| 20050253717 | Howarth et al. | Nov 2005 | A1 |
| 20050253718 | Droms et al. | Nov 2005 | A1 |
| 20050253722 | Droms et al. | Nov 2005 | A1 |
| 20050264420 | Vogel et al. | Dec 2005 | A1 |
| 20050283539 | Betts et al. | Dec 2005 | A1 |
| 20050286461 | Zhang et al. | Dec 2005 | A1 |
| 20060005035 | Coughlin | Jan 2006 | A1 |
| 20060010086 | Klein | Jan 2006 | A1 |
| 20060015699 | Fujiwara et al. | Jan 2006 | A1 |
| 20060021010 | Atkins et al. | Jan 2006 | A1 |
| 20060031374 | Lu et al. | Feb 2006 | A1 |
| 20060033606 | Howarth et al. | Feb 2006 | A1 |
| 20060044111 | Kollar et al. | Mar 2006 | A1 |
| 20060064467 | Libby | Mar 2006 | A1 |
| 20060074981 | Mauceri et al. | Apr 2006 | A1 |
| 20060077221 | Vaideesvuaran et al. | Apr 2006 | A1 |
| 20060080467 | Gould et al. | Apr 2006 | A1 |
| 20060091999 | Howarth | May 2006 | A1 |
| 20060106941 | Singhal et al. | May 2006 | A1 |
| 20060123226 | Kumar et al. | Jun 2006 | A1 |
| 20060123425 | Ramarao et al. | Jun 2006 | A1 |
| 20060123467 | Kumar et al. | Jun 2006 | A1 |
| 20060123477 | Raghavan et al. | Jun 2006 | A1 |
| 20060123479 | Kumar et al. | Jun 2006 | A1 |
| 20060129575 | Lee et al. | Jun 2006 | A1 |
| 20060129650 | Ho et al. | Jun 2006 | A1 |
| 20060129689 | Ho et al. | Jun 2006 | A1 |
| 20060146879 | Anthias et al. | Jul 2006 | A1 |
| 20060149840 | Thompson et al. | Jul 2006 | A1 |
| 20060155862 | Kathi et al. | Jul 2006 | A1 |
| 20060155969 | Yoda et al. | Jul 2006 | A1 |
| 20060167975 | Chan et al. | Jul 2006 | A1 |
| 20060168334 | Potti et al. | Jul 2006 | A1 |
| 20060236062 | Boss et al. | Oct 2006 | A1 |
| 20060248225 | Batz et al. | Nov 2006 | A1 |
| 20060253590 | Nagy et al. | Nov 2006 | A1 |
| 20060256768 | Chan | Nov 2006 | A1 |
| 20060266832 | Howarth et al. | Nov 2006 | A1 |
| 20070013518 | Howarth | Jan 2007 | A1 |
| 20070027966 | Singhal et al. | Feb 2007 | A1 |
| 20070055864 | Tock et al. | Mar 2007 | A1 |
| 20070080784 | Kim et al. | Apr 2007 | A1 |
| 20070192444 | Ackaouy et al. | Aug 2007 | A1 |
| 20080021916 | Schnelle et al. | Jan 2008 | A1 |
| 20080047008 | Cho et al. | Feb 2008 | A1 |
| 20100094945 | Chan et al. | Apr 2010 | A1 |
| 20130132518 | Dashora | May 2013 | A1 |
| Number | Date | Country |
|---|---|---|
| 0986229 | Mar 2000 | EP |
| 0 986 229 | Apr 2000 | EP |
| 1 011 244 | Jun 2000 | EP |
| 1217804 | Feb 2002 | EP |
| 1217804 | Jun 2002 | EP |
| WO 9907116 | Feb 1999 | WO |
| WO 0127766 | Apr 2001 | WO |
| WO 0227507 | Apr 2002 | WO |
| WO 0237730 | May 2002 | WO |
| WO 02075547 | Sep 2002 | WO |
| WO 03021465 | Mar 2003 | WO |
| WO 2006055406 | May 2006 | WO |
| Entry |
|---|
| U.S. Appl. No. 13/745,692, filed Jan. 18, 2013, Final Office Action, Mar. 24, 2014. |
| U.S. Appl. No. 12/638,159, filed Dec. 15, 2009, Notice of Allowance, Mar. 20, 2014. |
| Snoeren, Alex C., et al., “Single-packet IP Traceback”, IEEE/ACM Transactions on Networking (ToN) 10.6 dated 2002, pp. 721-734. |
| European Patent Office, “Search Report” in application No. 05 854 364.6-1870, dated May 6, 2105, 4 pages. |
| Claims in European Application No. 05 854 364.6-1870, dated May 2015, 4 pages. |
| Brewer, Eric, et al., “A Network Architecture for Heterogeneous Mobile Computing”, Personal Communications, IEEE 5.5 dated 1998, pp. 8-24. |
| The Patent Office of the People'S Republic of China, “The Fourth Office Action”, in application No. 200580041996.X, dated Jun. 26, 2012, 8 pages. |
| Current Claims in application No. 200580041996.X, dated Jun. 2012, 5 pages. |
| European Patent Office, “Search Report” in application No. 05852737.5-1853, dated Aug. 21, 2013, 6 pages. |
| Current Claims in application No. 05852737.5-1853, dated Aug. 2013, 5 pages. |
| International Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” PCT/US05/44171, dated Nov. 30, 2006, 7 pages. |
| Current Claims, PCT/US05/44171, 9 pages. |
| International Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” PCT/US05/43599, dated Feb. 28, 2007, 8 pages. |
| Current Claims, PCT/US05/43599, 8 pages. |
| International Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” PCT/US05/41254, dated Mar. 28, 2007, 7 pages. |
| Current Claims, PCT/US05/41254, 11 pages. |
| Bilorusets, Ruslan et al., “Web Services Reliable Messaging Protocol (WS—ReliableMessaging)”, Mar. 2004. |
| Fujitsu Limited, et al., “Web Services Reliability (WS—Reliability),” Ver1.0. , Jan. 8, 2003. pp. 1-45. |
| Girardot, Marc et al., “Millau: an encoding format for efficient representation and exchange for XMLover the web,” [retrieved on Jan. 31, 2005]. Retrieved from the internet: <URL: http://www9.org/w9cdrom/154/154.html>, 25 pages. |
| International Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration”, International application No. PCT/US05/46149, dated Jul. 20, 2007, 9 pages. |
| Claims, International application No. PCT/US05/46149, 10 pages. |
| International Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” PCT/US05/45625, dated Oct. 20, 2006, 7 pages. |
| Current Claims PCT/US05/45625, 9 pages. |
| International Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” PCT/US05/40861, dated Nov. 17, 2006, 7 pages. |
| Current Claims PCT/US05/40861, 6 pages. |
| International Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” PCT/US2006/024375, dated Oct. 17, 2006, 10 pages. |
| Current Claims, PCT/US2006/024375, 6 pages. |
| Decasper, Dan et al., “Router Plugins: A Software Architecture for Next-Generation Routers,” IEEE ACM Transactions on Networking, vol. 9, No. 1, Feb. 2000, XP011038838, 14 pages. |
| Girardot, Marc, et al., “Millau: An Encoding Format for Efficient Representation and Exchange of XML Over the Web”, Computer Networks, Netherlands, vol. 33, Jun. 2000, 22 pages. |
| International Preliminary Examining Authority, “Written Opinion of the International Preliminary Examining Authority”, International application No. PCT/US05/43599, mailed May 12, 2008, 4 pages. |
| Claims, International application No. PCT/US05/43599, 8 pages. |
| Burns, Michael, et al., “Implementing Address Assurance in the Intel IXP Router”, Western Network Processors Conference, Oct. 2002, 17 pages. |
| Current Claims, PCT/US05/41254, 12 pages. |
| Current Claims, PCT/US05/44171, 12 pages. |
| Current Claims, PCT/US2006/024375, 5 pages. |
| Current Claims PCT/US05/45625, 8 pages. |
| Current Claims PCT/US05/40861, 5 pages. |
| Decasper, Dan et al., “Router Plugins: A Software Architecture for Next Generation Routers,” IEEE ACM Transactions on Networking, vol. 9, No. 1, Feb. 2000, XP011038838, 14 pages. |
| Droms, R., Dynamic Host Configuration Protocol, RFC 2131, Mar. 1997, 43 pages. |
| Alexander, S., et al., DHCP Options and BOOTP Vendor Extensions, RFC 2132, Mar. 1997, 32 pages. |
| Stump, G., et al., The User Class Option for DHCP, RFC 3004, Nov. 2000, 6 pages. |
| T'Joens, Y., DHCP Reconfigure Extension, RFC 3203, Dec. 2001, 6 pages. |
| Patrick, M., DHCP Relay Agent Information Option, RFC 3046, Jan. 2001, 14 pages. |
| Lonvick, C., The BSD Syslog Protocol, RFC 3164, Aug. 2001, 28 pages. |
| Johnston, M., DHCP Preboot Execution Environment (PXE) Options draft-ietf-dhc-pxe-options-01.txt, Internet-Draft, Jan. 21, 2005, 7 pages. |
| Johnson, R., TFTP Server Address DHCP Option draft-raj-dhc-tftp-addr-option-00.txt, Internet-Draft, Feb. 6, 2005, 7 pages. |
| Littlefield, J., Vendor-Identifying Vendor Options for Dynamic Host Configuration Protocol version 4 (DPHCPv4), RFC 3925, Oct. 2004, 9 pages. |
| Schulzrinne, H., Dynamic Host Configuration Protocol (DHCPv4 and DHCPv6) Option for Civic Addresses Configuration Information, draft-ietf-geopriv-dhcp-civil-05. Internet-Draft. Feb. 19. 2004. |
| Polk, J., et al., Dynamic Host Configuration Protocol Option for Coordinate-based Location Configuration Information, RFC 3825, Jul. 2004, 15 pages. |
| AeroScout Visibility System: Bridging the Gap Between Wi-Fi, Active RFID and Telemetry, AeroScout Enterprise Visibility Solutions, http://www.aeroscout.com/content.asp?p.=SystemOverview, printed Apr. 16, 2005, 3 pages. |
| WhereNet, Products, http://wherenet.com/products—main.html, printed Apr. 16, 2005, 2 pages. |
| Simple Network Management Protocol, Internetworking Technologies Handbook, Chapter-56, printed Jul. 14, 2005, 12 pages. |
| International Search Report dated Oct. 13, 2005, from (related) International Application No. PCT/US05/16484, 6 pages. including Notification of Transmittal (CISCP377WO). |
| Written Opinion of the International Searching Authority dated Oct. 13, 2005, from (related) International Application No. PCT/US05/16484, 5 pages. (CISCP377WO). |
| Harrington, D., et al, An Architecture for DescribingSimple Network Management Protocol (SNMP) Management Frameworks, RFC 3411, Dec. 2002, 64 pages. |
| Presuhn, R., Editor, Version 2 of the Protocol Operations for the Simple Network Management Protocol (SNMP), RFC 3416, Dec. 2002, 31 pages. |
| Global Location No. (GLN) Implementation Guide, Uniform Code Council, Inc., May 2002, 13 pages. |
| Mockapetris, P., “Domain Names—Concepts and Facilities”, RFC 1034, Nov. 1987, 43 pages. |
| Mockapetris, P., “Domain Names—Implementation and Specification”, RFC 1035, 55 pages. |
| International Search Report dated Jul. 13, 2006, from (related) International Application No. PCT/US05/16319, 5 pp. including Notification of Transmittal (CISCP430WO). |
| Written Opinion of the International Searching Authority dated Jul. 13, 2006, from (related) International Application No. PCT/US05/16319, 5 pp. (CISCP430WO). |
| International Search Report dated Feb. 17, 2006, from related International Application No. PCT/US05/15322, 5 pp. including Notification of Transmittal (CISCP378WO). |
| Written Opinion of the International Searching Authority dated Feb. 17, 2006, from related International Application No. PCT/US05/15322, 3 pp. (CISCP378WO). |
| “EPCg1, Frequently Asked Questions”, Retrieved from the internet: http://www.epcglobalinc.com/about/faqs.html, [Retrieved Mar. 24, 2005], 9 pages. |
| “EPCTM Tag Data Standards Version 1.1 Rev.1.24”, EPCglobal, Standard Specification, Apr. 1, 2004, 78 pages. |
| “The Global Language of Business”, Retrieved from the internet: http://www.ean-int.org/locations.html, [Retrieved Mar. 24, 2005], 5 pages. |
| “Cisco Application-Oriented Networking: A Network-Based Intelligent Message Routing System”, http://www.cisco.com/en/US/products/ps6438/products—data—sheet0900aecd802c1f9c.html Data Sheet, Cisco Systems, Inc., Jul. 13, 2005, pp. 1-7. |
| “Cisco Catalyst 6500 Series Application-Oriented Networking Module”, http://www.cisco.com/en/US/products/ps6438/products—data—sheet0900aecd802c1fe9.html Data Sheet, Cisco Systems, Inc. Jul. 13, 2005, pp. 1-3. |
| “Cisco Application-Oriented Networking—A Network Embedded Intelligent Message Routing System”, http://www.cisco.com/en/US/products/ps6438/prod—bulletin0900aecd802c201b.html Product Bulletin No. 2886, Cisco Systems, Inc. Jul. 13, 2005, pp. 1-3. |
| “Cisco Catalyst 6500 Series Application-Oriented Networking Module: Large Photo”, Photo, Retrieved from the internet: http://www.cisco.com/en/US/products/ps6448/prod—view—selector.html [Retrieved Jul. 13, 2005], Cisco Systems, Inc. 1 page. |
| “The EPCglobal Architecture Framework” EPCglobal Final Version of Jul. 1, 2005, pp. 1-53. |
| Marc Girardot and Neel Sundaresan. “Millau: an encoding format for efficient representation and exchange of XML over the web” [Retrieved Jan. 31, 2005]. Retrieved from the internet: http://www9.org/w9cdrom/154/154.html 25 pages. |
| Fujitsu Limited, et al., “Web Services Reliability (WS-Reliability) Ver1.0”, Jan. 8, 2003. p. 1-45. |
| Ruslan Bilorusets et al., “Web Services Reliable Messaging Protocol (WS-ReliableMessaging)”, Mar. 2004, pp. 1-40. |
| International Searching Authority, Notification of Tranmittal of the International Search Report and the Written Opinion on the International Searching Authority, or the Declaration, International application No. PCT/US05/46149, dated Jul. 20, 2007, 9 pages. |
| State Intellectual Property Office of the People'S Republic of China, “The First Office Action”, application No. 200580031604.1. |
| Claims, application No. 200580031604.1, 6 pages |
| Chiu, Kenneth, et al., “Investigating the Limits of SOAP Performance for Scientific Computing”, Nov. 7, 2002, IEEE Computer Society, 8 pages. |
| State Intellectual Property Office of the People'S Republic of China, “The First Office Action”, filing No. 200580031571.0, Dated Dec. 19, 2008, 9 pages. |
| Claims, filing No. 200580031571.0, 8 pages. |
| State Intellectual Property Office of the People'S Republic of China, “The First Office Action”, filing No. 200580045932.7, Dated Nov. 28, 2008, 8 pages. |
| Claims, filing No. 200580045932.7, 8 pages. |
| European Patent Office, “European Search Report”, application No. EP 05820894, Feb. 6, 2009, 8 pages. |
| Claims, application No. EP 05820894, 6 pages. |
| The Patent Office of the People'S Republic of China, “The Second Office Action”, Application No. 200580045932.7, dated May 8, 2009, 9 pages. |
| Pending Claims, Application No. 200580045932.7, 8 pages. |
| European Patent Office, “Communication pursuant to Article 94(3) EPC”, Application No. 05820894.3-2211/1812870, dated May 28, 2009, 9 pages. |
| Amended Claims, Application No. 05820894.3-2211/1812870, 6 pages. |
| Schramm, C. et al., “Application-Oriented Network Modeling with Mobile Agents,” 1998, IEEE (5 pages). |
| Sharp R L et al. “Network Security in a Heterogeneous Environment,” AT & T Technical Journal, American Telephone and Telegraph Co. New York, US vol. 73, No. 5 Sep. 1, 1994, pp. 52-59. |
| European Patent Office, “European Search Report,” dated Dec. 6, 2010, application No. EP 05 85 3162, 11 pages. |
| Current Claims for European application No. EP 05 85 3162, 6 pages. |
| European Patent Office, “European Search Report”, dated Nov. 30, 2010, application No. EP 05 85 3164, 8 pages. |
| Current Claims for European application No. EP 05 85 3164, 5 pages. |
| Sharp R.L. et al. “Network Security in a Heterogeneous Environment”, AT&T Journal, American Telephone and Telegraph Co. New York, US, vol. 73, No. 5, Sep. 1, 1994 pp. 52-59. |
| European Patent Office, “European Search Report”, application No. 0583164.1, applicant: Cisco Technology Inc., Dated Nov. 30, 2010, 8 pages. |
| Current Claims for European application 0583164.1, 5 pages. |
| European Patent Office, “European Search Report”, application No. 05853162.5, applicant Cisco Technology, Inc., Dated Dec. 6, 2010, 11 pages. |
| Current Claims for European application 05853162.5, 6 pages. |
| State Intellectual Property Office of the Peoples Republic of China, Office Action PCT Application No. 200580041997.4, Applicant: Cisco Technology Inc., Dated Feb. 11, 2011, 5 pages. |
| Current Claims, Application No. 200580041997.4, Applicant: Cisco Technology Inc., 6 pages. |
| Oracle, “Oracle Application Developer's Guide—Advanced Queuing Release” A Same Application Using AQ, http://www.lorentzcenter.nl/awcourse/oracle/appdev.920/a96587/qsample.htm, 2002, 93 pages. |
| The Patent Office of the People'S Republic of China, Office Action in Application No. 200580041996, Applicant: Cisco Technology, Inc., dated May 25, 2011, 11 pages. |
| Current Claims for Application No. 200580041996, Application: Cisco Technology Inc., dated May 2011, 9 pages. |
| First Examination Report from IN for foreign patent application No. 3288/DELNP/2007 dated Aug. 26, 2011, 1 pages. |
| Current claims in IN patent application No. 3288/DELNP/2007, 6 pages dated Aug. 2011. |
| The Patent Office of the People'S Republic of China, The Third Office Action in Application No. 200580041996.X, Applicant: Cisco Technology, Inc., dated Sep. 15, 2011, 5 pages. |
| Current Claims in Application No. 200580041996, dated Sep. 2011, 5 pages. |
| Government of India Patent Office Intellectual Property Building, “Office Action in Application No. 2216/DELNP/2007”, Applicant: Cisco Technology, Inc., Dated Jul. 14, 2011, 2 pages. |
| Current Claims in Application No. 2216/DELNP/2007, Dated Jul. 2011, 9 pages. |
| India Patent Office, India First Examination Report received in International Application No. 2212/DELNP/2007 dated Oct. 14, 2011, 1 page. |
| Current Claims, Application No. 2212/DELNP/2007, 6 pages. |
| India Patent Office, India First Examination Report received in International Application No. 3205/DELNP/2007dated Oct. 14, 2011, 1 page. |
| Current Claims, Application No. 3205/DELNP/2007, 10 pages. |
| European Patent Office, “European Search Report” in application No. 05822298.5-1244, dated Nov. 30, 2012, 12 pages. |
| Current Claims in application No. 05822298.5-1244, dated Nov. 2012, 9 pages. |
| Sharp R. L. et al., “Network security in a Heterogeneous Environment”, AT&T Technical Journal, American Telephone & Telegraph Co. New York, US, vol. 73, No. 5, Sep. 1, 1994 (8 pages) XP000475911, ISSN: 8756-2324. |
| India Patent Office, IN Office Action received in International Application No. 3290/DELNP/2007 dated Dec. 21, 2011 (2 pages). |
| Current Claims, Application No. 3290/DELNP/2007 (3 pages). |
| China Patent Office, CN Office Action received in International Application No. 201010622659.2 dated Oct. 17, 2011 (12 pages). |
| Current Claims, Application No. 201010622659.2 (7 pages). |
| India Patent Office, IN First Examination Report received in International Application No. 3287/DELNP/2007 dated Jan. 24, 2012 (2 pages). |
| India Patent Office, IN First Examination Report received in International Application No. 3155/DELNP/2007 dated Mar. 1, 2012 (1 pages). |
| Current Claims, Application No. 3155/DELNP/2007 6 pages). |
| China Patent Office, CN 4th Office Action received in International Application No. 200580041996.X dated Jun. 26, 2012 (8 pages). |
| Current Claims, Application No. 200580041996.X (5 pages). |
| State Intellectual Property Office of the People's Republic of China, “The Fifth Office Action” in application No. 200580041996, dated Oct. 8, 2012, 8 pages. |
| Current Claims in application No. 200580041996, dated Oct. 2012, 5 pages. |
| European Patent Office, “European Search Report” in application No. 05854804.1-1244, dated Nov. 23, 2012, 6 pages. |
| Current Claims in Application No. 05854804.1-1244, dated Nov. 2012, 6 pages. |
| State Intellectual Property Office of the People'S Republic of China, “The Third Office Action” in application No. 200580041997.4 dated Apr. 19, 2013, 7 pages. |
| Current Claims in application No. 200580041997.4, dated Apr. 2013, 7 pages. |
| European Patent Office, “Search Report”, in application No. 05 820 894.3-1954, dated Oct. 7, 2013, 7 pages. |
| Current Claims in application No. 05 820 894.3-1954, dated Oct. 2013, 5 pages. |
| Roesch, M., “Snort—Lightweight Intrusion Detection for Networks”, Proceedings of the Systems Administration Conference, dated Nov. 7, 1999, 11 pages. |
| European Patent Office, “Search Report” in application No. 05854364.6-1870, dated Nov. 25, 2014, 7 pages. |
| Claims in European Application No. 05854364.6-1870, dated Nov. 2014, 4 pages. |
| International Searching Authority, “Search Report” in application No. PCT/US2015/024930, Dated Jul. 21, 2015, 12 pages. |
| Claims in application No. PCT/US2015/024930, Dated Jul. 2015, 6 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20140032690 A1 | Jan 2014 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 11089794 | Mar 2005 | US |
| Child | 14042587 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 11005978 | Dec 2004 | US |
| Child | 11089794 | US |
