Node-centric analysis of dynamic networks

Patent metadata

Field	Value
Publication number	US-2017257291-A1
Application number	US-201615144627-A
Country	US
Kind code	A1
Filing date	May 2, 2016
Priority date	Mar 7, 2016
Publication date	Sep 7, 2017
Grant date	—

Abstract

A network analysis engine is configured to generate a network timeline that represents time-varying connectivity between nodes of the network over a time interval. The network timeline includes a sequence of network snapshots that illustrate links between nodes at specific, sequential sub-intervals of time. The network analysis engine is configured to organize the network timeline in order to reveal certain characteristics of the nodes in the network and the network as a whole. Based on these characteristics, the network can be optimized to improve overall network operation.

First claim

The invention claimed is:

1 . A non-transitory computer-readable medium that, when executed by a processor, causes the processor to generate a network timeline for a network by performing the steps of:
generating a first network snapshot that depicts, for a first sub-interval of time, a first set of nodes included in the network and a first set of connections associated with the first set of nodes; generating a second network snapshot that depicts, for a second sub-interval of time, a second set of nodes included in the network and a second set of connections associated with the second set of nodes; and generating a first node timeline included in the first network snapshot and the second network snapshot that is associated with a first node included in the network, wherein the first node timeline indicates one or more topological changes in the network between the first sub-interval of time and the second sub-interval of time.

2 . The non-transitory computer-readable medium of claim 1 , further comprising:
causing the first network snapshot to indicate a first subset of connections between the first node and the first set of nodes during the first sub-interval time; and causing the second network snapshot to indicate a second subset of connections between the first node and the second set of nodes during the second sub-interval time.

3 . The non-transitory computer-readable medium of claim 1 , further comprising:
identifying a first cluster of nodes within the network that includes the first node and is associated with at least one of the first sub-interval of time and the second sub-interval of time; and causing one or more visual attributes of the first node timeline to differ from one or more corresponding visual attributes of at least one other node timeline associated with at least one other node that is included within the network, but is not included in the first cluster.

4 . The non-transitory computer-readable medium of claim 3 , wherein the first node has more connections to other nodes in the first cluster of nodes than connections to other nodes that are within the network, but are not included in the first cluster.

5 . The non-transitory computer-readable medium of claim 3 , further comprising grouping a set of node timelines associated with the first cluster of nodes within at least one of the first network snapshot and the second network snapshot.

6 . The non-transitory computer-readable medium of claim 1 , further comprising:
generating a second node timeline included in at least one of the first network snapshot and the second network snapshot that is associated with a second node included in the network; and generating a connection sequence that indicates one or more connections between the first node and the second node.

7 . The non-transitory computer-readable medium of claim 6 , wherein the one or more connections include a direct connection between the first node and the second node, or a sequence of indirect connections between the first node, one or more intermediate nodes, and the second node.

8 . The non-transitory computer-readable medium of claim 1 , further comprising updating one or more visual attributes of each node timeline included in the network timeline to indicate a degree of betweenness for each node timeline included in the network timeline.

9 . The non-transitory computer-readable medium of claim 8 , wherein the degree of betweenness for a first node timeline included in the network timeline corresponds to a number of node clusters within the network that include a particular node associated with the first node timeline.

10 . The non-transitory computer-readable medium of claim 1 , further comprising generating a first envelope that includes a first set of node timelines associated with a first set of nodes within the network that have first-degree connections to the first node.

11 . The non-transitory computer-readable medium of claim 1 , further comprising:
generating a second node timeline associated with the first sub-interval of time and the second sub-interval of time and that is associated with a second node included in the network; and adding the second node timeline to the first network snapshot and the second network snapshot to keep the first node timeline and the second node timeline packed closely together.

12 . The computer-implemented method of claim 1 , wherein the first node timeline indicates one or more changes within the network between the first sub-interval of time and the second sub-interval of time.

13 . A computer-implemented method for generating a network timeline for a network, the method comprising:
generating a first network snapshot that depicts, for a first sub-interval of time, a first set of nodes included in the network and a first set of connections associated with the first set of nodes; generating a second network snapshot that depicts, for a second sub-interval of time, a second set of nodes included in the network and a second set of connections associated with the second set of nodes; and generating a first node timeline included in the first network snapshot and the second network snapshot that is associated with a first node included in the network, wherein the first node timeline indicates one or more topological changes in the network between the first sub-interval of time and the second sub-interval of time.

14 . The computer-implemented method of claim 13 , further comprising:
causing the first network snapshot to indicate a first subset of connections between the first node and the first set of nodes during the first sub-interval time; and causing the second network snapshot to indicate a second subset of connections between the first node and the second set of nodes during the second sub-interval time.

15 . The computer-implemented method of claim 13 , further comprising:
identifying a first cluster of nodes within the network that includes the first node and is associated with at least one of the first sub-interval of time and the second sub-interval of time; and causing one or more visual attributes of the first node timeline to differ from one or more corresponding visual attributes of at least one other node timeline associated with at least one other node that is included within the network, but is not included in the first cluster.

16 . The computer-implemented method of claim 15 , wherein the first node has more connections to other nodes in the first cluster of nodes than connections to other nodes that are within the network, but are not included in the first cluster, and further comprising grouping a set of node timelines associated with the first cluster of nodes within at least one of the first network snapshot and the second network snapshot.

17 . The computer-implemented method of claim 13 , further comprising:
generating a second node timeline included in at least one of the first network snapshot and the second network snapshot that is associated with a second node included in the network; and generating a connection sequence that indicates one or more connections between the first node and the second node, wherein the one or more connections include a direct connection between the first node and the second node, or a sequence of indirect connections between the first node, one or more intermediate nodes, and the second node.

18 . The computer-implemented method of claim 13 , further comprising:
generating a second node timeline associated with the first sub-interval of time and the second s

Assignees

• Autodesk Inc

Inventors

• Zhao Jian
• Glueck Michael
• Khan Azam

Classifications

• H04L41/12

  Discovery or management of network topologies · CPC title

• H04L43/06

  Generation of reports · CPC title

• H04L43/045 Primary

  for graphical visualisation of monitoring data · CPC title

• H04L41/22 Primary

  comprising specially adapted graphical user interfaces [GUI] · CPC title