System and method for finding important nodes in a network
AssigneeInternational Business Machines Corporation
InventorCharu C. Aggarwal
Life of this patent
Estimating the term…
Abstract
Techniques for optimizing steady state flow of a network are provided. The techniques include determining a first set of two or more nodes in a network, computing a steady-state flow probability of the first set of two or more nodes, and iteratively interchanging nodes from a second set of two or more nodes into the first set of two or more nodes to determine an optimum total steady state flow of the network, wherein determining an optimum total steady-state flow of the network comprises iteratively interchanging nodes until no additional improvements in steady-state flow over the computed steady-state flow probability can be obtained.
Claims22
A method for optimizing steady state flow of a network, wherein the method comprises:
- determining a first set of two or more nodes in a network;
- computing a steady-state flow probability of the first set of two or more nodes;
- and
- iteratively interchanging nodes from a second set of two or more nodes into the first set of two or more nodes to determine an optimum total steady state flow of the network, wherein determining an optimum total steady-state flow of the network comprises iteratively interchanging nodes until no additional improvements in steady-state flow over the computed steady-state flow probability can be obtained, and wherein said iteratively interchanging nodes comprises selecting a node from the first set of nodes at random and selecting a node from the second set of nodes at random.
A computer program product comprising a tangible computer readable recordable storage medium including computer useable program code for optimizing steady state flow of a network, the computer program product including:
- computer useable program code for determining a first set of two or more nodes in a network;
- computer useable program code for computing a steady-state flow probability of the first set of two or more nodes;
- and
- computer useable program code for iteratively interchanging nodes from a second set of two or more nodes into the first set of two or more nodes to determine an optimum total steady state flow of the network, wherein determining an optimum total steady-state flow of the network comprises iteratively interchanging nodes until no additional improvements in steady-state flow over the computed steady-state flow probability can be obtained, and wherein said iteratively interchanging nodes comprises selecting a node from the first set of nodes at random and selecting a node from the second set of nodes at random.
A system for optimizing steady state flow of a network, comprising:
- a memory;
- and
- at least one processor coupled to the memory and operative to:
- determine a first set of two or more nodes in a network;
- compute a steady-state flow probability of the first set of two or more nodes;
- and
- iteratively interchange nodes from a second set of two or more nodes into the first set of two or more nodes to determine an optimum total steady state flow of the network, wherein determining an optimum total steady-state flow of the network comprises iteratively interchanging nodes until no additional improvements in steady-state flow over the computed steady-state flow probability can be obtained, and wherein said iteratively interchanging nodes comprises selecting a node from the first set of nodes at random and selecting a node from the second set of nodes at random.
An apparatus for optimizing steady state flow of a network, the apparatus comprising:
- means for determining a first set of two or more nodes in a network;
- means for computing a steady-state flow probability of the first set of two or more nodes;
- and
- means for iteratively interchanging nodes from a second set of two or more nodes into the first set of two or more nodes to determine an optimum total steady state flow of the network, wherein determining an optimum total steady-state flow of the network comprises iteratively interchanging nodes until no additional improvements in steady-state flow over the computed steady-state flow probability can be obtained, and wherein said iteratively interchanging nodes comprises selecting a node from the first set of nodes at random and selecting a node from the second set of nodes at random.
Dependencies are inferred from the claim text.