Abstract
In this paper, we propose a quantification of the vulnerability of a communication network where links are subject to failures due to the actions of a strategic adversary. We model the adversarial nature of the problem as a 2-player game between a network manager who chooses a spanning tree of the network as communication infrastructure and an attacker who is trying to disrupt the communication by attacking a link. We use previously proposed models for the value of a network to derive payoffs of the players and propose the network’s expected loss-in-value as a metric for vulnerability. In the process, we generalize the notion of betweenness centrality: a metric largely used in Graph Theory to measure the relative importance of a link within a network. Furthermore, by computing and analyzing the Nash equilibria of the game, we determine the actions of both the attacker and the defender. The analysis reveals the existence of subsets of links that are more critical than the others. We characterize these critical subsets of links and compare them for the different network value models. The comparison shows that critical subsets depend both on the value model and on the connectivity of the network.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
USN Admiral James Stavridis. Channeling David Sarnoff (September 2006), http://www.aco.nato.int/saceur/channeling-david-sarnoff.aspx
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (March 2004)
Briscoe, B., Odlyzko, A., Tilly, B.: Metcalfe’s Law is Wrong. IEEE Spectrum, 26–31 (July 2006)
Marketing Conversation. Reeds Law States that Social Networks Scale Exponentially (August 2007), http://marketingconversation.com/2007/08/28/reeds-law/
Marketing Conversation. A Short discussion on Metcalfe’s Law for Social Networks (May 2008), http://marketingconversation.com/2007/08/28/reeds-law/
Freeman, L.: Centrality in Social Networks Conceptual Clarification. Social Networks 1(3), 215–239 (1979)
Gilder, G.: Metcale’s Law And Legacy (November 1995), http://www.seas.upenn.edu/~gaj1/metgg.html
Gueye, A.: A Game Theoretical Approach to Communication Security. PhD dissertation, University of California, Berkeley, Electrical Engineering and Computer Sciences (March 2011)
Gueye, A., Marbukh, V., Walrand, J.C.: Towards a Quantification of Communication Network Vulnerability to Attacks: A Game Theoretic Approach. Technical report, National Institute of Standards and Technology (December 2011), http://www.nist.gov/itl/math/cctg/assane.cfm
Gueye, A., Walrand, J.C., Anantharam, V.: Design of Network Topology in an Adversarial Environment. In: Alpcan, T., Buttyán, L., Baras, J.S. (eds.) GameSec 2010. LNCS, vol. 6442, pp. 1–20. Springer, Heidelberg (2010)
Manshaei, M.H., Zhu, Q., Alpcan, T., Basar, T., Hubaux, J.-P.: Game Theory Meets Network Security and Privacy. Technical report, EPFL, Lausanne (2010)
Medhi, D.: Network Reliability and Fault-Tolerance. John Wiley & Sons, Inc. (2007)
Odlyzko, A., Tilly, B.: A refutation of Metcalfe’s Law and a better estimate for the value of networks and network interconnections
Cisco Press. Spanning Tree Protocol: Introduction (August 2006), http://www.cisco.com/en/US/tech/tk389/tk621/tsd_technology_support_protocol_home.html
Cisco Press. Understanding and Configuring Spanning Tree Protocol (STP) on Catalyst Switches (August 2006), http://www.cisco.com/en/US/tech/tk389/tk621/technologies_configuration_example09186a008009467c.shtml
Reed, D.P.: That Sneaky Exponential: Beyond Metcalfe’s Law to the Power of Community Building (Spring 1999), http://www.reed.com/dpr/locus/gfn/reedslaw.html
Reed, D.P.: Weapon of Math Destruction (February 2003), http://www.immagic.com/eLibrary/ARCHIVES/GENERAL/GENREF/C030200D.pdf
Roy, S., Ellis, C., Shiva, S., Dasgupta, D., Shandilya, V., Wu, Q.: A Survey of Game Theory as Applied to Network Security. In: Hawaii International Conference on System Sciences, pp. 1–10 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Gueye, A., Marbukh, V., Walrand, J.C. (2012). Towards a Metric for Communication Network Vulnerability to Attacks: A Game Theoretic Approach. In: Krishnamurthy, V., Zhao, Q., Huang, M., Wen, Y. (eds) Game Theory for Networks. GameNets 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35582-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-35582-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35581-3
Online ISBN: 978-3-642-35582-0
eBook Packages: Computer ScienceComputer Science (R0)