Robustness envelopes of networks

Journal of Complex Networks

Volumn 1, Issue 1, 2013, Pages 44-62

  Trajanovski, Stojan ^a   Martín Hernández, Javier ^a   Winterbach, Wynand ^a   Van Mieghem, Piet ^a  

^a Delft University of Technology   (Netherlands)

Author keywords

Network re design; Network robustness; Network vulnerability; Robustness framework

Indexed keywords

NETWORK PERFORMANCE; PROBABILITY DENSITY FUNCTION;

AVERAGE-CASE BEHAVIOR; CENTRALITY MEASURES; DEGREE CENTRALITY; EIGENVECTOR CENTRALITIES; NETWORK CENTRALITIES; NETWORK ROBUSTNESS; NETWORK VULNERABILITY; WORST-CASE BEHAVIORS;

NETWORK SECURITY;

EID: 84878366101     PISSN: 20511310     EISSN: 20511329     Source Type: Journal    
DOI: 10.1093/comnet/cnt004     Document Type: Article

References (45)

1. Cohen, R., Erez, K., ben-Avraham, D. & Havlin, S. (2000) Resilience of the internet to random breakdowns. Phys. Rev. Lett., 85, 4626-4628.
2. Scellato, S., Leontiadis, I., Mascolo, C., Basu, P. & Zafer, M. (2011) Understanding robustness of mobile networks through temporal network measures. Proceedings of INFOCOM. IEEE, Shanghai, China, pp. 1-5.
3. Holme, P., Kim, B. J., Yoon, C. N. & Han, S. K. (2002) Attack vulnerability of complex networks. Phys. Rev. E, 65.
4. Huang, X., Gao, J., Buldyrev, S. V., Havlin, S. & Stanley, H. E. (2011) Robustness of interdependent networks under targeted attack. Phys. Rev. E, 83, 065101.
5. Cohen, R., Erez, K., ben-Avraham, D. & Havlin, S. (2001) Breakdown of the internet under intentional attack. Phys. Rev. Lett., 86, 3682-3685.
6. Avizienis, A., Laprie, J.-C., Randell, B. & Landwehr, C. (2004) Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. Dependable Secure Comput., 1, 11-33.
7. Menth, M., Duelli, M., Martin, R. & Milbrandt, J. (2009) Resilience analysis of packet-switched communication networks. IEEE/ACM Trans. Netw., 17, 1950-1963.
8. Van Mieghem, P., Doerr, C., Wang, H., Martín-Hernández, J., Hutchison, D., Karaliopoulos, M. & Kooij, R. E. (2010) A framework for computing topological network robustness. Technical Report 20101218. Networks Architectures and Services, Delft University of Technology.
9. Doerr, C. & Martín-Hernández, J. (2010) A computational approach to multi-level analysis of network resilience. Third International Conference on Dependability (DEPEND), Venice/Mestre, Italy, pp. 125-132.
10. Meyer, J. F. (1992) Performability: a retrospective and some pointers to the future. Perform. Eval., 14, 139-156.
11. Meyer, J. F. (1980) On evaluating the performability of degradable computing systems. IEEE Trans. Comput., C-29, 720-731.
12. Cholda, P., Mykkeltveit, A., Helvik, B., Wittner, O. & Jajszczyk, A. (2007) A survey of resilience differentiation frameworks in communication networks. Commun. Surveys Tutorials, IEEE, 9, 32-55.
13. Satyanarayana, A. & Prabhakar, A. (1978) New topological formula and rapid algorithm for reliability analysis of complex networks. IEEE Trans. Reliab, R-27, 82-100.
14. Wilkov, R. (1972) Analysis and design of reliable computer networks. IEEE Trans. Commun., 20, 660-678.
15. Rai, S. & Aggarwal, K. K. (1978) An efficient method for reliability evaluation of a general network. IEEE Trans. Reliab., R-27, 206-211.
16. Frisch, H. L. & Hammersley, J. M. (1963) Percolation processes and related topics. SIAM J. Appl. Math., 11, 894-918.
17. Sykes, M. F. & Essam, J. W. (1964) Exact critical percolation probabilities for site and bond problems in two dimensions. J. Math. Phys., 5, 1117-1127.
18. Page, L. B. & Perry, J. E. (1994) Reliability polynomials and link importance in networks. IEEE Trans. Reliab., 43, 51-58.
19. Callaway, D. S., Newman, M. E. J., Strogatz, S. H. & Watts, D. J. (2000) Network robustness and fragility: percolation on random graphs. Phys. Rev. Lett., 85, 5468-5471.
20. Kostakos, V. (2009) Temporal graphs. Phys. A, 388, 1007-1023.
21. Tang, J., Musolesi, M., Mascolo, C. & Latora, V. (2009) Temporal distance metrics for social network analysis. Proceedings of WOSN '09, Barcelona, Spain, pp. 31-36.
22. Trajanovski, S., Scellato, S. & Leontiadis, I. (2012) Error and attack vulnerability of temporal networks. Phys. Rev. E, 85, 066105.
23. Schneider, C. M., Moreira, A. A., Andrade, J. S., Havlin, S. & Herrmann, H. J. (2011) Mitigation of malicious attacks on networks. Proc. Natl Acad. Sci. USA, 108, 3838-3841.
24. Çetinkaya, E., Broyles, D., Dandekar, A., Srinivasan, S. & Sterbenz, J. (2010) A comprehensive framework to simulate network attacks and challenges. International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), Moscow, Russia, pp. 538-544.
25. Latora, V. & Marchiori, M. (2001) Efficient behavior of small-world networks. Phys. Rev. Lett., 87, 198 701.
26. Dinh, T. N., Xuan, Y., Thai, M. T., Pardalos, P. M. & Znati, T. (2011) On new approaches of assessing network vulnerability: hardness and approximation. IEEE/ACM Trans. Netw., PP, 1.
27. Freeman, L. C. (1978-1979) Centrality in social networks conceptual clarification. Soc. Netw., 1, 215-239.
28. Scott, J. (2000) Social Network Analysis: a Handbook. SAGE Publications, ISBN 1446236161, 9781446236161.
29. Van Mieghem, P. (2011) Graph Spectra for Complex Networks. Cambridge University Press, Cambridge, UK.
30. Erdos, P. & Rényi, A. (1960) On the evolution of random graphs. Publ. Math. Inst. Hungarian Acad. Sci., 5, 17-61.
31. Gilbert, E. N. (1959) Random graphs. Ann. Math. Statist., 30, 1141.
32. Watts, D. J. & Strogatz, S. H. (1998) Collective dynamics of small world networks. Nature, 440-442.
33. Albert, R. & Barabasi, A.-L. (2002) Statistical mechanics of complex networks. Rev. Mod. Phys., 74, 47-97.
34. Jamakovic, A. & Uhlig, S. (2008) On the relationships between topological metrics in real-world networks. Netw. Heterogeneous Media, 3, 345-359.
35. Leskovec, J., Kleinberg, J. & Faloutsos, C. (2007) Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data, 1, doi: 10.1145/1217299.1217301.
36. Van Mieghem, P. (2006) Performance Analysis of Communications Networks and Systems. Cambridge University Press, Cambridge, UK.
37. Chung, F. & Lu, L. (2002) The average distances in random graphs with given expected degrees. Internet Math., 1, 15879-15882.
38. Smythe, R. & Wierman, J. (1978) First-passage Percolation on the Square Lattice. Lecture Notes in Mathematics, Springer-Verlag, 671.
39. Li, C.,Wang, H., de Haan, W., Stam, C. J. & Van Mieghem, P. (2011) The correlation of metrics in complex networks with applications in functional brain networks. J. Statist. Mech. Theory Exp., 2011, P11018.
40. Newman, M. E. J. (2003) Mixing patterns in networks. Phys. Rev. E, 67, 026126.
41. Van Mieghem, P., Wang, H., Ge, X., Tang, S. & Kuipers, F. A. (2010) Influence of assortativity and degreepreserving rewiring on the spectra of networks. Eur. Phys. J. B, 76, 643-652.
42. D'Agostino, G., Scala, A., Zlatić, V. & Caldarelli, G. (2012) Robustness and assortativity for diffusion-like processes in scale-free networks. Europhys Lett, 97, 68006.
43. Van Mieghem, P., Ge, X., Schumm, P., Trajanovski, S. & Wang, H. (2010) Spectral graph analysis of modularity and assortativity. Phys. Rev. E, 82, 056113.
44. Winterbach, W., de Ridder, D., Wang, H., Reinders, M. & Van Mieghem, P. (2012) Do greedy assortativity optimization algorithms produce good results? Eur. Phys. J. B, 85, 1-9.
45. Friedel, C. & Zimmer, R. (2007) Influence of degree correlations on network structure and stability in protein-protein interaction networks. BMC Bioinform., 8, 297+.