Data flow path determination
AssigneeHewlett Packard Enterprise Development LP
InventorLeslie R. Stuart
Life of this patent
Estimating the term…
Abstract
A method of determining a data flow path within a computing network includes, with the processor executing a data flow path determination module, determining a number of data flow paths between a first node and a second node within the computing network, and with a with the processor executing a graphical user interface (GUI) module, displaying the data flow paths to a user.
Claims19
A software-defined networking (SDN) manager, comprising:
- a processor;
- and
- a memory coupled to the processor, in which the memory comprises:
- a topology mapping module to map a topology of a computing network;
- and
- a data flow monitoring module to, when executed by the processor, determine a number of data flow paths through the topology based on a number of user-selected parameters;
- wherein the user-selected parameters comprise a selection of a first node, a second node, and an intermediate node intermediate to the first and second node and wherein the data flow monitoring module determines the number of data flow paths as the number of data flow paths pass through the intermediate node.
A computer program product for determining a number of data flow paths within a computing network, the computer program product comprising:
- a non-transitory computer readable storage medium comprising computer usable program code embodied therewith, the computer usable program code comprising:
- computer usable program code to, when executed by a processor, determine a number of data flow paths between a first node and a second node with the computing network;
- computer usable program code to, when executed by a processor, determine which of the number of data flow paths flow through a user selected intermediate node intermediate between the first node and second node;
- and
- computer usable program code to, when executed by a processor, determine an optimized data flow path, the optimized data flow path defining a data flow path within the network with the most available bandwidth, in which the optimized data flow path is determined based on bandwidth requirements of a number of applications executed within said network;
- computer usable program code to, when executed by a processor, determine a shortest data flow path, the shortest data flow path defining a data flow path within the network with the least amount of hops between the first node and the second node;
- and
- computer usable program code to, when executed by a processor, monitor the number of data flow paths and maintain isolation of any data flow paths such that data flow paths operating through the network do not overlap.
A method of determining a data flow path within a computing network comprising:
- with a processor executing a data flow path determination module, determining a number of data flow paths between a first node and a second node within the computing network;
- and
- with the processor executing a graphical user interface (GUI) module, displaying the data flow paths to a user;
- with the processor, determining an optimized data flow path;
- with the processor, determining a shortest data flow path;
- receiving a user selection of the optimized data flow path or the shortest data flow path as a selected data flow path for communication between the first and second node;
- wherein, when the selection of the optimized data flow path is received, receiving a selection of a node intermediate to the first and second node through which the data flow determination module calculates the optimized data flow path.
Dependencies are inferred from the claim text.