Skip to main content

Using Centrality Measures to Rank the Importance of the Components of a Complex Network Infrastructure

  • Conference paper
Critical Information Infrastructure Security (CRITIS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5508))

Abstract

Modern society is witnessing a continuous growth in the complexity of the infrastructure networks which it relies upon. This raises significant concerns regarding safety, reliability and security. These concerns are not easily dealt with the classical risk assessment approaches. In this paper, the concept of centrality measures introduced in complexity science is used to identify the contribution of the elements of a network to the efficiency of its connection, accounting for the reliability of its elements. As an example of application, the centrality measures are computed for an electrical power transmission system of literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nieminen, J.: On Centrality in a Graph. Scandinavian Journal of Psychology 15, 322–336 (1974)

    Article  Google Scholar 

  2. Freeman, L.C.: Centrality in Social Networks: Conceptual Clarification. Social Networks 1, 215–239 (1979)

    Article  Google Scholar 

  3. Sabidussi, G.: The Centrality Index of a Graph. Psychometrika 31, 581–603 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  4. Wasserman, S., Faust, K.: Social Networks Analysis. Cambridge U.P., Cambridge (1994)

    Book  MATH  Google Scholar 

  5. Latora, V., Marchiori, M.: A Measure of Centrality Based on the Network Efficiency. New Journal of Physics 9, 188 (2007)

    Article  Google Scholar 

  6. The IEEE 14 BUS data can be found on, http://www.ee.washington.edu/research/pstca/

  7. Floyd, R.W.: Algorithm 97: shortest path. Communications of the ACM 5(6), 345 (1962)

    Article  Google Scholar 

  8. Fortunato, S., Latora, V., Marchiori, M.: Method to find community structures based on information centrality. Physical Review E 70, 056104 (2004)

    Google Scholar 

  9. Latora, V., Marchiori, M.: Efficient Behavior of Small-World Networks. Physical Review Letters 87(19) (2001)

    Google Scholar 

  10. Zio, E.: From Complexity Science to Reliability Efficiency: A New Way of Looking at Complex Network Systems and Critical Infrastructures. Int. J. Critical Infrastructures 3(3/4), 488–508 (2007)

    Article  Google Scholar 

  11. Pajek program for large network analysis, http://vlado.fmf.uni-lj.si/pub/networks/pajek/

  12. Billinton, R., Li, W.: Reliability Assessment of Electric Power Systems Using Monte Carlo Methods, pp. 19–20 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cadini, F., Zio, E., Petrescu, CA. (2009). Using Centrality Measures to Rank the Importance of the Components of a Complex Network Infrastructure. In: Setola, R., Geretshuber, S. (eds) Critical Information Infrastructure Security. CRITIS 2008. Lecture Notes in Computer Science, vol 5508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03552-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03552-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03551-7

  • Online ISBN: 978-3-642-03552-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics