Abstract: The present disclosure describes methods, systems, and computer program products for providing network traffic routing optimizations. One computer-implemented method includes calculating a direct connection cost for network traffic between two points in a network, the network including one or more nodes of an accelerated application delivery (AccAD) network, calculating an AccAD connection cost for the network traffic between the two points in the network using at least one node of the AccAD network, comparing the calculated direct connection cost and the AccAD connection cost, and determining whether the direct connection cost is greater than the sum of the AccAD connection cost and a minimum cost threshold value.

Abstract: The present disclosure describes methods, systems, and computer program products for providing network traffic routing optimizations. One computer-implemented method includes calculating a direct connection cost for network traffic between two points in a network, the network including one or more nodes of an accelerated application delivery (AccAD) network, calculating an AccAD connection cost for the network traffic between the two points in the network using at least one node of the AccAD network, comparing the calculated direct connection cost and the AccAD connection cost, and determining whether the direct connection cost is greater than the sum of the AccAD connection cost and a minimum cost threshold value.

Abstract: The present disclosure describes methods, systems, and computer program products for providing network traffic routing optimizations. One computer-implemented method includes calculating a direct connection cost for network traffic between two points in a network, the network including one or more nodes of an accelerated application delivery (AccAD) network, calculating an AccAD connection cost for the network traffic between the two points in the network using at least one node of the AccAD network, comparing the calculated direct connection cost and the AccAD connection cost, and determining whether the direct connection cost is greater than the sum of the AccAD connection cost and a minimum cost threshold value.

Abstract: The present disclosure describes methods, systems, and computer program products for providing network traffic routing optimizations. One computer-implemented method includes calculating a direct connection cost for network traffic between two points in a network, the network including one or more nodes of an accelerated application delivery (AccAD) network, calculating an AccAD connection cost for the network traffic between the two points in the network using at least one node of the AccAD network, comparing the calculated direct connection cost and the AccAD connection cost, and determining whether the direct connection cost is greater than the sum of the AccAD connection cost and a minimum cost threshold value.

Abstract: A method and apparatus for applying a uniform processing policy within a distributed computer network. A message is received at a termination point from an application used by a user. At the termination point tagging information is attached to the message, the tagging information indicating which processes the message should undergo, and with which parameters or configurations. The message is then processed in the distributed network according to the tagging information so that uniform processing is assured. If required, a response message is generated, and is assigned substantially the same tagging information as the original message.

Abstract: A method and apparatus for applying a uniform processing policy within a distributed computer network. A message is received at a termination point from an application used by a user. At the termination point tagging information is attached to the message, the tagging information indicating which processes the message should undergo, and with which parameters or configurations. The message is then processed in the distributed network according to the tagging information so that uniform processing is assured. If required, a response message is generated, and is assigned substantially the same tagging information as the original message.

Abstract: A compression and decompression method and apparatus comprising at least one data source providing a stream of data to at least one data destination, employing at least one pattern classifier processing the stream of data of the at least one data source into a single stream of messages and generating at least one pattern event, a message encoder and a message decoder changing an internal state in response to the at least one pattern event.

Abstract: A compression and decompression method and apparatus comprising at least one data source providing a stream of data to at least one data destination, employing at least one pattern classifier processing the stream of data of the at least one data source into a single stream of messages and generating at least one pattern event, a message encoder and a message decoder changing an internal state in response to the at least one pattern event.