# US 2015/0103672 A1 · Data flow path determination

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0103672 A1
- Document ID: US20150103672A1
- Status: Published application
- Kind: A1
- Application number: 14/053,150
- Filed: 2013-10-14
- Published: 2015-04-16
- Earliest claimed: 2013-10-14
- Assignees: Hewlett-Packard Development Company, L.P.
- Applicants: Hewlett-Packard Development Company, L.P
- Inventors: Leslie R. Stuart
- Web page: https://patentgrep.com/patent/US20150103672A1

## CPC

- H04L 45/122: by minimising distances, e.g. by selecting a route with minimum of number of hops
- H04L 43/10: Active monitoring, e.g. heartbeat, ping or trace-route
- H04L 45/02: Topology update or discovery
- H04L 45/14: {Routing performance; Theoretical aspects}
- H04L 45/38: {Flow based routing}
- H04L 47/2475: for supporting traffic characterised by the type of applications
- H04L 41/12: Discovery or management of network topologies
- H04L 41/22: comprising specially adapted graphical user interfaces [GUI]
- H04L 41/40: using virtualisation of network functions or resources, e.g. SDN or NFV entities
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## 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.

## Claims

### Claim 1

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.

### Claim 2 (depends on 1)

The system of claim 1, further comprising a graphical user interface (GUI) module to displaying a number of GUIs to a user; in which the GUI module displays a number of representations of the data flow paths in the GUIs.

### Claim 3 (depends on 2)

The system of claim 2, in which the representations of the data flow paths comprise:
a number of nodes; and
a number of paths between the nodes,
in which the nodes represent a number of devices within the network and the paths represent communication paths between the devices.

### Claim 4 (depends on 2)

The system of claim 2, in which the data flow paths represent an optimized data flow path, the optimized data flow path defining a data flow path within the network with the most available bandwidth.

### Claim 5 (depends on 4)

The system of claim 4, in which the optimized data flow path is determined based on a number of bandwidth requirements of a number of applications executed within the network.

### Claim 6 (depends on 2)

The system of claim 2, in which the data flow paths represent 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 a first node and a second node.

### Claim 7 (depends on 2)

The system of claim 2, in which the GUIs are displayed to a user on a display device coupled to the SDN manager.

### Claim 8

A computer program product for determining a number of data flow paths within a computing network, the computer program product comprising:
a 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; 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; and
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 a first node and a second node.

### Claim 9 (depends on 8)

The computer program product of claim 8, further comprising computer usable program code to, when executed by a processor, display to a user the data flow paths.

### Claim 10 (depends on 8)

The computer program product of claim 8, further comprising computer usable program code to, when executed by a processor, receive 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.

### Claim 11 (depends on 8)

The computer program product of claim 8, further comprising computer usable program code to, when executed by a processor, utilize the selected data flow path as the data flow path through which the first node and a second node communicate.

### Claim 12

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.

### Claim 13 (depends on 12)

The method of claim 12, in which determining a data flow path between a first node and a second node within the computing network comprises:
determining 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; and
determining 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 a first node and a second node.

### Claim 14 (depends on 13)

The method of claim 13, further comprising 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.

### Claim 15 (depends on 14)

The method claim 14, further comprising computer usable program code to, when executed by a processor, utilize the selected data flow path as the data flow path through which the first node and a second node communicate.
