Name
Abstract | ||
|---|---|---|
We propose measures of network vulnerability and study some of their properties. We define a network as a triplet (G,R,F), where G is the graph of the network, R is the routing protocol specifying how traffic flows on G, and F is the traffic load (typically random). Based on this structure, we calculate the expected loss of traffic from an "attack" which eliminates ttimes100% of the network's link... |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/LSP.2006.888290 | IEEE Signal Processing Letters |
Keywords | Field | DocType |
Routing protocols,Telecommunication traffic,Statistics,Loss measurement,Telecommunication network reliability,Communication networks,Network topology,Probability distribution | Graph theory,Expected loss,Traffic flow,Traffic load,Computer science,Computer network,Self-similarity,Vulnerability,Bernoulli's principle,Routing protocol | Journal |
Volume | Issue | ISSN |
14 | 5 | 1070-9908 |
Citations | PageRank | References |
4 | 0.75 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yehuda Vardi | 1 | 73 | 11.34 |
| Cun-Hui Zhang | 2 | 174 | 18.38 |