Techniques for end-to-end network bandwidth optimization using software defined networking
First Claim
1. A method comprising:
- receiving, by a computer system, information regarding a flow to be admitted to a network, the flow being associated with a source and a destination;
for a shortest path in a plurality of paths between the source and the destination, calculating, by the computer system, a projected utilization of the shortest path in view of the flow;
if the projected utilization of the shortest path is less than or equal to a target utilization threshold, assigning, by the computer system, the flow to the shortest path;
else if the projected utilization of the shortest path is greater than the target utilization threshold;
selecting, by the computer system, another path in the plurality of paths distinct from the shortest path based on one or more selection criteria; and
assigning, by the computer system, the flow to the selected path.
2 Assignments
0 Petitions
Accused Products
Abstract
Techniques for end-to-end network bandwidth optimization using software defined networking are provided. In one embodiment, a computer system can receive information regarding a flow to be admitted to a network, where the flow is associated with a source and a destination. The computer system can further calculate, for each path in a plurality of paths between the source and the destination, a projected utilization of the path in view of the flow. If the projected utilization of the shortest path in the plurality of paths is less than or equal to a target utilization threshold, the computer system can assign the flow to the shortest path. Otherwise, the computer system can select a path in the plurality of paths that comes closest to the target utilization threshold without exceeding the threshold and can assign the flow to that selected path.
-
Citations
18 Claims
-
1. A method comprising:
-
receiving, by a computer system, information regarding a flow to be admitted to a network, the flow being associated with a source and a destination; for a shortest path in a plurality of paths between the source and the destination, calculating, by the computer system, a projected utilization of the shortest path in view of the flow; if the projected utilization of the shortest path is less than or equal to a target utilization threshold, assigning, by the computer system, the flow to the shortest path; else if the projected utilization of the shortest path is greater than the target utilization threshold; selecting, by the computer system, another path in the plurality of paths distinct from the shortest path based on one or more selection criteria; and assigning, by the computer system, the flow to the selected path. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A non-transitory computer readable medium having stored thereon program code executable by a processor, the program code comprising:
-
code that causes the processor to receive information regarding a flow to be admitted to a network, the flow being associated with a source and a destination; for a shortest path in a plurality of paths between the source and the destination, code that causes the processor to calculate a projected utilization of the shortest path in view of the flow; if the projected utilization of the shortest path is less than or equal to a target utilization threshold, code that causes the processor to assign the flow to the shortest path; else if the projected utilization of the shortest path is greater than the target utilization threshold; code that causes the processor to select another path in the plurality of paths distinct from the shortest path based on one or more selection criteria; and code that causes the processor to assign the flow to the selected path.
-
-
18. A computer system comprising:
-
a processor; and a non-transitory computer readable medium having stored thereon executable program code which, when executed by the processor, causes the processor to; receive information regarding a flow to be admitted to a network, the flow being associated with a source and a destination; for a shortest path in a plurality of paths between the source and the destination, calculate a projected utilization of the shortest path in view of the flow; if the projected utilization of the shortest path is less than or equal to a target utilization threshold, assign the flow to the shortest path; else if the projected utilization of the shortest path is greater than the target utilization threshold; select another path in the plurality of paths distinct from the shortest path based on one or more selection criteria; and assign the flow to the selected path.
-
Specification