Name
Abstract | ||
|---|---|---|
Understanding which node failures in a network have more impact is an important problem. Current understanding, motivated by the scale free models of network growth, places emphasis on the degree of the node. This is not a satisfactory measure; the number of connections a node has does not capture how redundantly it is connected into the whole network. Conversely, the structural entropy of a graph... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TNSM.2017.2724301 | IEEE Transactions on Network and Service Management |
Keywords | Field | DocType |
Measurement,Network topology,Entropy,Monitoring,Topology,Algorithm design and analysis,Scalability | Psychological resilience,Locality,Algorithm design,Vertex (geometry),Computer science,Theoretical computer science,Network topology,Network monitoring,Scalability,Computation | Journal |
Volume | Issue | ISSN |
14 | 3 | 1932-4537 |
Citations | PageRank | References |
3 | 0.68 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philip Tee | 1 | 5 | 3.07 |
| George Parisis | 2 | 122 | 16.44 |
| Ian Wakeman | 3 | 436 | 129.40 |