Network traffic routing optimization

Patent metadata

Field	Value
Publication number	US-9397930-B2
Application number	US-201514829276-A
Country	US
Kind code	B2
Filing date	Aug 18, 2015
Priority date	Jul 23, 2013
Publication date	Jul 19, 2016
Grant date	Jul 19, 2016

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.

First claim

What is claimed is:

1. A computer-implemented method comprising:
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, wherein the minimum cost threshold value is added to the AccAD connection cost to generate a plurality of virtual neighborhoods of AccAD network nodes and to restrict acceleration within the AccAD network to between AccAD network nodes communicating across virtual neighborhood boundaries.

2. The method of claim 1 , wherein connection cost can include consideration of at least one of bandwidth, latency, a network hop count, a number of network links between the two points, CPU usage, memory usage, disk space usage, a quality-of-service (QoS) value, a round trip time (RTT) value, a network congestion value, an amount of network traffic, a number of network connections, network connection interval length, a traffic type, preference tables, or physical destination.

3. The method of claim 1 , comprising routing the network traffic directly between the two network points if the direct connection cost is less than or equal to the sum of the AccAD connection cost and the minimum cost threshold value.

4. The method of claim 1 , comprising routing the network traffic between the two points in the network through the at least one node of the AccAD network if the direct connection cost is greater than the sum of the AccAD connection cost and the minimum cost threshold value.

5. The method of claim 1 , wherein the AccAD network is divided into at least three virtual neighborhoods.

6. The method of claim 5 , wherein network traffic between AccAD network nodes in a virtual neighborhood is not accelerated.

7. The method of claim 5 , wherein network traffic between all virtual neighborhoods is accelerated if the network traffic between at least two virtual neighborhoods is accelerated.

8. The method of claim 5 , comprising accelerating at least one network link between the AccAD network nodes once an acceleration of another network link between any two AccAD network nodes is required.

9. The method of claim 8 , wherein the acceleration of the at least one network link between the AccAD network nodes is performed regardless of the minimum cost threshold value and an association of the AccAD network nodes to one or more virtual neighborhoods.

10. A non-transitory, computer-readable medium storing computer-readable instructions executable by a computer and operable to:
calculate 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;
calculate an AccAD connection cost for the network traffic between the two points in the network using at least one node of the AccAD network;
compare the calculated direct connection cost and the AccAD connection cost; and
determine whether the direct connection cost is greater than the sum of the AccAD connection cost and a minimum cost threshold value, wherein the minimum cost threshold value is added to the AccAD connection cost to generate a plurality of virtual neighborhoods of AccAD network nodes and to restrict acceleration within the AccAD network to between AccAD network nodes communicating across virtual neighborhood boundaries.

11. The medium of claim 10 , wherein connection cost can include consideration of at least one of bandwidth, latency, a network hop count, a number of network links between the two points, CPU usage, memory usage, disk space usage, a quality-of-service (QoS) value, a round trip time (RTT) value, a network congestion value, an amount of network traffic, a number of network connections, network connection interval length, a traffic type, preference tables, or physical destination.

12. The medium of claim 10 , comprising instructions to route the network traffic directly between the two network points if the direct connection cost is less than or equal to the sum of the AccAD connection cost and the minimum cost threshold value.

13. The medium of claim 10 , comprising instructions to route the network traffic between the two points in the network through the at least one node of the AccAD network if the direct connection cost is greater than the sum of the AccAD connection cost and the minimum cost threshold value.

14. The medium of claim 10 , wherein the AccAD network is divided into at least three virtual neighborhoods.

15. The medium of claim 14 , wherein network traffic between AccAD network nodes in a virtual neighborhood is not accelerated.

16. The medium of claim 14 , wherein network traffic between all virtual neighborhoods is accelerated if the network traffic between at least two virtual neighborhoods is accelerated.

17. The medium of claim 14 , comprising instructions to accelerate at least one network link between the AccAD network nodes once an acceleration of another network link between any two AccAD network nodes is required.

18. The medium of claim 17 , wherein the acceleration of the at least one network link between the AccAD network nodes is performed regardless of the minimum cost threshold value and an association of the AccAD network nodes to one or more virtual neighborhoods.

19. A system, comprising:
a memory configured to contain at least one node of an accelerated application delivery (AccAD) network;
at least one computer interoperably coupled with the memory and configured to:
calculate a direct connection cost for network traffic between two points in a network, the network including one or more nodes of the AccAD network;
calculate an AccAD connection cost for the network traffic between the two points in the network using at least one node of the AccAD network;
compare the calculated direct connection cost and the AccAD connection cost; and
determine whether the direct connection cost is greater than the sum of the AccAD connection cost and a minimum cost threshold value, wherein the minimum cost threshold value is added to the AccAD connection cost to generate a plurality of virtual neighborhoods of AccAD network nodes and to restrict acceleration within the AccAD network to between AccAD network nodes communicating across virtual neighborhood boundaries.

20. The system of claim 19 , wherein connection cost can include consideration of at least one of bandwidth, latency, a network hop count, a number of network links between the two points, CPU usage, memory usage, disk space usage, a quality-of-service (QoS) value, a round trip time (RTT) value, a network congestion value, an amount of network traffic, a number of network connections, network connection interval length, a traffic type, preference tables, or physical destination.

21. The system of claim 19 , configured to route the network traffic directly between the two network points if the direct connection cost is less than or equal to the sum of the AccAD connection cost and the minimum cost threshold value.

22. The system of claim 19 , configured to route the network traffic between the two points in the network through the

Assignees

• Sap Se

Inventors

• Drobinsky Alex
• Eliassi Isaac
• Igelka Or

Classifications

• H04L45/22 Primary

  Alternate routing · CPC title

• H04L45/124 Primary

  using a combination of metrics · CPC title

• H04L67/32

  Electricity · mapped topic

• H04L45/306

  Route determination based on the nature of the carried application · CPC title

• H04L47/12

  Avoiding congestion; Recovering from congestion · CPC title