IP Library Granted Patent US 8,976,710
Granted Patent B2
US 8,976,710 · App. 13/530,791 · Granted Mar 10, 2015

Methods for discovering and analyzing network topologies and devices thereof

Inventors: Kishore Varma Indukuri (Tanuku Taluku, IN); Shahanaz Syed (Guntur, IN); Radha Krishna Pisipati (Hyderabad, IN)
Assignee: Infosys Limited
G06Q10/00H04L12/42H04L12/44
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,976,710
App. No.
13/530,791
Granted
Mar 10, 2015
Kind
B2
Abstract

A method, non-transitory computer readable medium, and apparatus for discovering and analyzing a network topology includes obtaining information regarding a network including a relationship of a plurality of nodes of the network. At least one value for each of a plurality of centrality parameters is determined for each of the plurality of nodes. At least one topology score for each of the plurality of nodes is generated based on one or more of the centrality parameter values. One or more relatively significant nodes are identified based on one or more of the topology scores and output.

Claims (91)

1. A method for discovering and analyzing a network topology, the method comprising:

obtaining, by a network topology discovery and analyzing computing apparatus, information regarding a network including a relationship of a plurality of nodes of the network;

determining, by the network topology discovery and analyzing computing apparatus, a value for each of at least three of a plurality of centrality parameters for each of the plurality of nodes, wherein the plurality of centrality parameters comprise betweenness, closeness, degree, clustering coefficient, or eccentricity;

generating, by the network topology discovery and analyzing computing apparatus, at least one topology score for each of the plurality of nodes based on the centrality parameter values;

identifying, by the network topology discovery and analyzing computing apparatus, one or more relatively significant nodes based on one or more of the topology scores; and

outputting, by the network topology discovery and analyzing computing apparatus, the identified one or more relatively significant nodes.

2. The method as set forth in claim 1 wherein the information regarding the network includes an identifier for each of the plurality of nodes without any private information associated with the node.

3. The method as set forth in claim 1 wherein the topology score comprises one or more of a star topology score, a ring topology score, or a mesh topology score.

4. The method as set forth in claim 3 wherein the one or more relatively significant nodes are relatively significant due to a relative influential ability and wherein the identifying further comprises one or more of ranking the star topology scores to identify one or more nodes likely to be relatively influential with respect to one or more other nodes, ranking the ring network scores to identify one or more nodes likely to be relatively influential with an increased number of groups of nodes, or ranking the mesh topology scores to identify one or more nodes likely to be relatively influential with respect to other members of a shared group.

5. The method as set forth in claim 1 wherein at least one of the centrality parameters comprise betweenness, degree, closeness, and clustering coefficient and the topology score comprises a star topology score, the centrality parameters comprise eccentricity, closeness, and degree and the topology score comprises a ring topology score, or the centrality parameters comprise clustering coefficient, degree, closeness, and eccentricity and the topology score comprises a mesh topology score.

6. The method as set forth in claim 1 wherein the closeness centrality parameter value is determined based on a mean geodesic distance between one of the plurality of nodes and each other of the plurality of nodes reachable by the one of the plurality of nodes and the eccentricity centrality parameter value is determined based on a maximum length of a shortest one of a plurality of paths between one of the plurality of nodes and each other of the plurality of nodes reachable by the one of the plurality of nodes.

7. A method for discovering and analyzing a network topology, the method comprising:

obtaining, by a network topology discovery and analyzing computing apparatus, information regarding a network including a relationship of a plurality of nodes of the network, wherein the information regarding the network includes an identifier for each of the plurality of nodes without any private information associated with the node;

determining, by the network topology discovery and analyzing computing apparatus, a value for each of a plurality of centrality parameters for each of the plurality of nodes, wherein the plurality of centrality parameters comprise betweenness, closeness, degree, clustering coefficient, or eccentricity;

generating, by the network topology discovery and analyzing computing apparatus, at least one topology score for each of the plurality of nodes based on one or more of the centrality parameter values, the topology score comprising one or more of a star topology score, a ring topology score, or a mesh topology score, wherein the generating at least one topology score further comprises generating at least one of:

the star topology score based on the formula log((αb+b)×(αd+d)×(αcl+cl)×(αcc+(1−cc 2 ))), wherein b, d, cl, and cc are the betweenness, degree, closeness and clustering coefficient centrality parameter values, respectively, and αb, αd, αcl, and αcc are betweenness, degree, closeness, and clustering coefficient weight values, respectively;

the ring topology score based on the formula log((βecc+ecc)×(βcl+cl)×(βd+d 2 )), wherein ecc, cl, and d are the eccentricity, closeness, and degree centrality parameter values, respectively, and βecc, βcl, and βd are eccentricity, closeness, and degree weight values, respectively; or

the mesh topology score based on the formula log(((γcc+cc)×(γd+d 2 )×(γcl+cl))/(ecc 2 +γecc)), wherein cc, d, cl, and ecc are the clustering coefficient, degree, closeness, and eccentricity centrality parameter values, respectively, and γcc, γd, γcl, and γecc, are clustering coefficient, degree, closeness, and eccentricity weight values, respectively;

identifying, by the network topology discovery and analyzing computing apparatus, one or more relatively significant nodes based on one or more of the topology scores; and

outputting, by the network topology discovery and analyzing computing apparatus, the identified one or more relatively significant nodes, wherein the one or more relatively significant nodes are relatively significant due to a relative influential ability and wherein the identifying further comprises one or more of ranking the star topology scores to identify one or more nodes likely to be relatively influential with respect to one or more other nodes, ranking the ring network scores to identify one or more nodes likely to be relatively influential with an increased number of groups of nodes, or ranking the mesh topology scores to identify one or more nodes likely to be relatively influential with respect to other members of a shared group.

8. A method for discovering and analyzing a network topology, the method comprising:

obtaining, at a network topology discovery and analyzing computing apparatus, information regarding a network including a relationship of a plurality of nodes of the network;

determining, with the network topology discovery and analyzing computing apparatus, a value for each of a plurality of centrality parameters for each of the plurality of nodes;

generating, with the network topology discovery and analyzing computing apparatus, at least one topology score for each of the plurality of nodes based on one or more of the centrality parameter values;

identifying, with the network topology discovery and analyzing computing apparatus, one or more relatively significant nodes based on one or more of the topology scores;

outputting, with the network topology discovery and analyzing computing apparatus, the identified one or more relatively significant nodes;

prior to generating at least one topology score, storing, at the network topology discovery and analyzing computing apparatus, the value for each of the plurality of centrality parameters as associated with each of the respective nodes;

identifying, with the network topology discovery and analyzing computing apparatus, one or more changes to the relationship information; and

updating, with the network topology discovery and analyzing computing apparatus, only one or more of the centrality parameter values associated with those nodes affected by the one or more changes to the relationship information.

9. A non-transitory computer readable medium having stored thereon instructions for discovering and analyzing a network topology comprising machine executable code which when executed by at least one processor, causes the processor to perform steps comprising:

obtaining information regarding a network including a relationship of a plurality of nodes of the network;

determining at least one value for each of at least three of a plurality of centrality parameters for each of the plurality of nodes, wherein the plurality of centrality parameters comprise betweenness, closeness, degree, clustering coefficient, or eccentricity;

generating at least one topology score for each of the plurality of nodes based the centrality parameter values;

identifying one or more relatively significant nodes based on one or more of the topology scores; and

outputting the identified one or more relatively significant nodes.

10. The medium as set forth in claim 9 wherein the information regarding the network includes an identifier for each of the plurality of nodes without any private information associated with the node.

11. The medium as set forth in claim 9 wherein the topology score comprises one or more of a star topology score, a ring topology score, or a mesh topology score.

12. The medium as set forth in claim 11 wherein the one or more relatively significant nodes are relatively significant due to a relative influential ability and wherein the identifying further comprises one or more of ranking the star topology scores to identify one or more nodes likely to be relatively influential with respect to one or more other nodes, ranking the ring network scores to identify one or more nodes likely to be relatively influential with an increased number of groups of nodes, or ranking the mesh topology scores to identify one or more nodes likely to be relatively influential with respect to other members of a shared group.

13. The medium as set forth in claim 9 wherein at least one of the centrality parameters comprise betweenness, degree, closeness, and clustering coefficient and the topology score comprises a star topology score, the centrality parameters comprise eccentricity, closeness, and degree and the topology score comprises a ring topology score, or the centrality parameters comprise clustering coefficient, degree, closeness, and eccentricity and the topology score comprises a mesh topology score.

14. The medium as set forth in claim 9 wherein the closeness centrality parameter value is determined based on a mean geodesic distance between one of the plurality of nodes and each other of the plurality of nodes reachable by the one of the plurality of nodes and the eccentricity centrality parameter value is determined based on a maximum length of a shortest one of a plurality of paths between one of the plurality of nodes and each other of the plurality of nodes reachable by the one of the plurality of nodes.

15. A non-transitory computer readable medium having stored thereon instructions for discovering and analyzing a network topology comprising machine executable code which when executed by at least one processor, causes the processor to perform steps comprising:

obtaining information regarding a network including a relationship of a plurality of nodes of the network, wherein the information regarding the network includes an identifier for each of the plurality of nodes without any private information associated with the node;

determining at least one value for each of a plurality of centrality parameters for each of the plurality of nodes, wherein the plurality of centrality parameters comprise betweenness, closeness, degree, clustering coefficient, or eccentricity;

generating at least one topology score for each of the plurality of nodes based on one or more of the centrality parameter values, the topology score comprising one or more of a star topology score, a ring topology score, or a mesh topology score, wherein the generating at least one topology score further comprises generating at least one of:

the star topology score based on the formula log((αb+b)×(αd+d)×(αcl+cl)×(αcc+(1−cc 2 ))), wherein b, d, cl, and cc are the betweenness, degree, closeness and clustering coefficient centrality parameter values, respectively, and αb, αd, αcl, and αcc are betweenness, degree, closeness, and clustering coefficient weight values, respectively;

the ring topology score based on the formula log((βecc+ecc)×(βcl+cl)×(βd+d 2 )), wherein ecc, cl, and are the eccentricity, closeness, and degree centrality parameter values, respectively, and βecc, βcl, and βd are eccentricity, closeness, and degree weight values, respectively; or

the mesh topology score based on the formula log(((γcc+cc)×(γd+d 2 )×(γcl+cl))/(ecc 2 +γecc)), wherein cc, d, cl, and ecc are the clustering coefficient, degree, closeness, and eccentricity centrality parameter values, respectively, and γcc, γd, γcl, and γecc, are clustering coefficient, degree, closeness, and eccentricity weight values, respectively;

identifying one or more relatively significant nodes based on one or more of the topology scores; and

outputting the identified one or more relatively significant nodes, wherein the one or more relatively significant nodes are relatively significant due to a relative influential ability and wherein the identifying further comprises one or more of ranking the star topology scores to identify one or more nodes likely to be relatively influential with respect to one or more other nodes, ranking the ring network scores to identify one or more nodes likely to be relatively influential with an increased number of groups of nodes, or ranking the mesh topology scores to identify one or more nodes likely to be relatively influential with respect to other members of a shared group.

16. A non-transitory computer readable medium having stored thereon instructions for discovering and analyzing a network topology comprising machine executable code which when executed by at least one processor, causes the processor to perform steps comprising:

obtaining information regarding a network including a relationship of a plurality of nodes of the network;

determining at least one value for each of a plurality of centrality parameters for each of the plurality of nodes;

generating at least one topology score for each of the plurality of nodes based on one or more of the centrality parameter values;

identifying one or more relatively significant nodes based on one or more of the topology scores;

outputting the identified one or more relatively significant nodes;

prior to generating at least one topology score, storing the value for each of the plurality of centrality parameters as associated with each of the respective nodes;

identifying one or more changes to the relationship information;

updating only one or more of the centrality parameter values associated with those nodes affected by the one or more changes to the relationship information; and

outputting the identified one or more relatively significant nodes.

17. A network topology discovery and analyzing computing apparatus, comprising:

one or more processors; and

a memory coupled to the one or more processors which are configured to execute programmed instructions stored in the memory comprising:

obtaining information regarding a network including a relationship of a plurality of nodes of the network;

determining at least one value for each of at least three of a plurality of centrality parameters for each of the plurality of nodes, wherein the plurality of centrality parameters comprise betweenness, closeness, degree, clustering coefficient, or eccentricity;

generating at least one topology score for each of the plurality of nodes based on the centrality parameter values;

identifying one or more relatively significant nodes based on one or more of the topology scores.

18. The apparatus as set forth in claim 17 wherein the information regarding the network includes an identifier for each of the plurality of nodes without any private information associated with the node.

19. The apparatus as set forth in claim 17 wherein the topology score comprise one or more of a star topology score, a ring topology score, or a mesh topology score.

20. The apparatus as set forth in claim 19 wherein the one or more relatively significant nodes are relatively significant due to a relative influential ability and wherein the identifying further comprises one or more of ranking the star topology scores to identify one or more nodes likely to be relatively influential with respect to one or more other nodes, ranking the ring network scores to identify one or more nodes likely to be relatively influential with an increased number of groups of nodes, or ranking the mesh topology scores to identify one or more nodes likely to be relatively influential with respect to other members of a shared group.

21. The apparatus as set forth in claim 17 wherein at least one of the centrality parameters comprise betweenness, degree, closeness, and clustering coefficient and the topology score comprises a star topology score, the centrality parameters comprise eccentricity, closeness, and degree and the topology score comprises a ring topology score, or the centrality parameters comprise clustering coefficient, degree, closeness, and eccentricity and the topology score comprises a mesh topology score.

22. The apparatus as set forth in claim 17 wherein the closeness centrality parameter value is determined based on a mean geodesic distance between one of the plurality of nodes and each other of the plurality of nodes reachable by the one of the plurality of nodes and the eccentricity centrality parameter value is determined based on a maximum length of a shortest one of a plurality of paths between one of the plurality of nodes and each other of the plurality of nodes reachable by the one of the plurality of nodes.

23. A network topology discovery and analyzing computing apparatus comprising:

one or more processors; and

a memory coupled to the one or more processors which are configured to execute programmed instructions stored in the memory comprising:

obtaining information regarding a network including a relationship of a plurality of nodes of the network, wherein the information regarding the network includes an identifier for each of the plurality of nodes without any private information associated with the node;

determining at least one value for each of a plurality of centrality parameters for each of the plurality of nodes, wherein the plurality of centrality parameters comprise betweenness, closeness, degree, clustering coefficient, or eccentricity;

generating at least one topology score for each of the plurality of nodes based on one or more of the centrality parameter values, the topology score comprising one or more of a star topology score, a ring topology score, or a mesh topology score, wherein the generating at least one topology score further comprises generating at least one of:

the star topology score based on the formula log((αb+b)×(αd+d)×(αcl+cl)×(αcc+(1−cc 2 ))), wherein b, d, cl, and cc are the betweenness, degree, closeness and clustering coefficient centrality parameter values, respectively, and αb, αd, αcl, and αcc are betweenness, degree, closeness, and clustering coefficient weight values, respectively;

the ring topology score based on the formula log((βecc+ecc)×(βcl+cl)×(βd+d 2 )), wherein ecc, cl, and d are the eccentricity, closeness, and degree centrality parameter values, respectively, and βecc, βcl, and βd are eccentricity, closeness, and degree weight values, respectively; or

the mesh topology score based on the formula log(((γcc+cc)×(γd+d 2 )×(γcl+cl))/(ecc 2 +γecc)), wherein cc, d, cl, and ecc are the clustering coefficient, degree, closeness, and eccentricity centrality parameter values, respectively, and γcc, γd, γcl, and γecc, are clustering coefficient, degree, closeness, and eccentricity weight values, respectively; and

identifying one or more relatively significant nodes based on one or more of the topology scores, wherein the one or more relatively significant nodes are relatively significant due to a relative influential ability and wherein the identifying further comprises one or more of ranking the star topology scores to identify one or more nodes likely to be relatively influential with respect to one or more other nodes, ranking the ring network scores to identify one or more nodes likely to be relatively influential with an increased number of groups of nodes, or ranking the mesh topology scores to identify one or more nodes likely to be relatively influential with respect to other members of a shared group.

24. A network topology discovery and analyzing computing apparatus, comprising:

one or more processors; and

a memory coupled to the one or more processors which are configured to execute programmed instructions stored in the memory comprising:

obtaining information regarding a network including a relationship of a plurality of nodes of the network;

determining at least one value for each of a plurality of centrality parameters for each of the plurality of nodes;

generating at least one topology score for each of the plurality of nodes based on one or more of the centrality parameter values;

identifying one or more relatively significant nodes based on one or more of the topology scores; and

outputting the identified one or more relatively significant nodes prior to generating at least one topology score, storing the value for each of the plurality of centrality parameters as associated with each of the respective nodes;

identifying one or more changes to the relationship information; and

updating only one or more of the centrality parameter values associated with those nodes affected by the one or more changes to the relationship information.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2012
From: INDUKURI, KISHORE VARMA; SYED, SHAHANAZ; PISIPATI, RADHA KRISHNA
To: INFOSYS LIMITED
Reel/Frame 028428/0509 →
Priority Claims (1)
IN 4606/CHE/2011 · Dec 27, 2011 · national
Continuity (1)
Related Publication 20130163471A1 · Jun 27, 2013