Data flow path determination

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.

What is claimed is: 
     
         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. 
   
     
     
         2 . 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. 
     
     
         3 . 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.   
     
     
         4 . 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. 
     
     
         5 . 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. 
     
     
         6 . 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. 
     
     
         7 . The system of  claim 2 , in which the GUIs are displayed to a user on a display device coupled to the SDN manager. 
     
     
         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. 
   
     
     
         9 . 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. 
     
     
         10 . 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. 
     
     
         11 . 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. 
     
     
         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.   
     
     
         13 . 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.   
     
     
         14 . 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. 
     
     
         15 . 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.