Splitting a network traffic flow
First Claim
Patent Images
1. A method for splitting a flow of data in a data network into a set of flow paths comprising:
- retrieving, from a memory, map data comprising a plurality of network nodes and a plurality of data links between the network nodes, wherein each data link has an associated flow value and an associated flow capacity;
receiving, at a processing circuit, a selection of a source node and a selection of a destination node from the plurality of network nodes;
sorting the data links based in part on the associated flow values;
determining, by the processing circuit, a submap of the map data using the sorted data links, wherein the submap has a maximum flow between the selected source node and the selected destination node that is greater than a predefined percentage of a maximum flow between the selected source node and the selected destination node in the map data;
adjusting flow capacities of data links in the submap based on a smallest flow capacity of a data link in the submap; and
determining, by the processing circuit, a set of flow paths from the source node to the destination node using the adjusted flow capacities.
2 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods for splitting a network traffic flow in a data network are described. A flow of traffic between a source node and a destination node in the data network is split into a set of data paths. A data path includes one or more data links between nodes in the data network. A submap of the data network that excludes at least one data link is used to determine the set of flow paths.
-
Citations
20 Claims
-
1. A method for splitting a flow of data in a data network into a set of flow paths comprising:
-
retrieving, from a memory, map data comprising a plurality of network nodes and a plurality of data links between the network nodes, wherein each data link has an associated flow value and an associated flow capacity; receiving, at a processing circuit, a selection of a source node and a selection of a destination node from the plurality of network nodes; sorting the data links based in part on the associated flow values; determining, by the processing circuit, a submap of the map data using the sorted data links, wherein the submap has a maximum flow between the selected source node and the selected destination node that is greater than a predefined percentage of a maximum flow between the selected source node and the selected destination node in the map data; adjusting flow capacities of data links in the submap based on a smallest flow capacity of a data link in the submap; and determining, by the processing circuit, a set of flow paths from the source node to the destination node using the adjusted flow capacities. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system for splitting a flow of data in a data network into a set of flow paths comprising a processing circuit configured to:
-
retrieve map data comprising a plurality of network nodes and a plurality of data links between the network nodes, wherein each data link has an associated flow value and an associated flow capacity; receive a selection of a source node and a selection of a destination node from the plurality of network nodes; sort the data links based in part on the associated flow values; determine a submap of the map data using the sorted data links, wherein the submap has a maximum flow between the selected source node and the selected destination node that is greater than a predefined percentage of a maximum flow between the selected source node and the selected destination node in the map data; adjust flow capacities of data links in the submap based on a smallest flow capacity of a data link in the submap; and determine a set of flow paths from the source node to the destination node using the adjusted flow capacities. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. Non-transitory computer-readable media having instructions stored therein, the instructions being executable by one or more processors to cause the one or more processors to perform operations comprising:
-
retrieving, from a memory, map data comprising a plurality of network nodes and a plurality of data links between the network nodes, wherein each data link has an associated flow value and an associated flow capacity; receiving a selection of a source node and a selection of a destination node from the plurality of network nodes; sorting the data links based in part on the associated flow values; determining a submap of the map data using the sorted data links, wherein the submap has a maximum flow between the selected source node and the selected destination node that is greater than a predefined percentage of a maximum flow between the selected source node and the selected destination node in the map data; adjusting flow capacities of data links in the submap based on a smallest flow capacity of a data link in the submap; and determining a set of flow paths from the source node to the destination node using the adjusted flow capacities. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification