Abstract
In this paper, we consider security aspects of network routing in a game-theoretic framework where an attacker is empowered with an ability for intrusion into edges of the network; on the other hand, the goal of designer is to choose routing paths.
We interpret the secure routing problem as a two player zero sum game. The attacker can choose one or more edges for intrusion, while the designer has to choose paths between source-destination pairs for a given set of pairs. We give polynomial-time algorithms for finding mixed Nash equilibria if 1) the attacker is limited to a one-edge attack (for arbitrary number of source-destination pairs), 2) the designer has two source-destination pairs while the attacker is either limited to c edges, for given c, or the attacker incurs a cost for each edge attacked. Previous work gave an algorithm for one source-destination pair and multiple edge attacks.
This is a preview of subscription content, log in via an institution to check access.
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
Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56, 5:1–5:37 (2009)
Aumann, Y., Rabani, Y.: An O(logk) Approximate Min-Cut Max-Flow Theorem Approximation Algorithm. SIAM J. Comput. 27(1), 291–301 (1998)
Bell, M.G.H.: The measurement of reliability in stochastic transport networks. In: Proceedings of 2001 IEEE Intelligent Transportation Systems (2001)
Bohacek, S., Hespanha, J., Lee, J., Lim, C., Obraczka, K.: Game theoretic stochastic routing for fault tolerance and security in communication networks. IEEE/ACM Trans. on Parallel and Distributed Systems (2007)
Bohacek, S., Hespanha, J.P., Obraczka, K.: Saddle policies for secure routing in communication networks. In: Proc. of the 41st Conf. on Decision and Contr., pp. 1416–1421 (2002)
Bohacek, S., Hespanha, J.P., Obraczka, K., Lee, J., Lim, C.: Enhancing security via stochastic routing. In: Proceedings of the 11th IEEE International Conference on Computer Communications and Networks (2002)
Chen, J., Chan, S.-H.G., Li, V.O.K.: Multipath routing for video delivery over bandwidth-limited networks. IEEE Journal on Selected Areas in Communications 22(10), 1920–1932 (2004)
Chen, L., Leneutre, J.: On multipath routing in multihop wireless networks: security, performance, and their tradeoff. EURASIP J. Wirel. Commun. Netw. 2009, 6:1–6:13 (2009)
Elwalid, A., Jin, C., Low, S., Widjaja, I.: Mate: Mpls adaptive traffic engineering (2001)
Gueye, A., Walrand, J.C.: Security in networks: A game-theoretic approach. In: 47th IEEE Conference on Decision and Control, CDC 2008, pp. 829–834 (2008)
Hu, T.C.: Multi-commodity network flows. Operations Research 11, 344–360 (1963)
Lee, S.J., Gerla, M.: Split multipath routing with maximally disjoint paths in ad hoc networks (2001)
Klein, P., Rao, S., Agrawal, A., Ravi, R.: An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica 15(2), 187–202 (1995)
Lee, P.P.C., Misra, V., Rubenstein, D.: Distributed algorithms for secure multipath routing. In: Proceedings of IEEE INFOCOM (2005)
Leighton, F., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 787–832 (1999)
Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2), 215–245 (1995)
Lou, W., Liu, W., Zhang, Y., Fang, Y.: Spread: Improving network security by multipath routing in mobile ad hoc networks. Wireless Networks 15, 279–294 (2009)
Mavronicolas, M., Papadopoulou, V., Philippou, A., Spirakis, P.: A Graph-Theoretic Network Security Game. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 969–978. Springer, Heidelberg (2005)
Mavronicolas, M., Papadopoulou, V., Philippou, A., Spirakis, P.: A network game with attackers and a defender. Algorithmica 51, 315–341 (2008)
Mirrokni, V.S., Thottan, M., Uzunalioglu, H., Paul, S.: A simple polynomial time framework for reduced-path decomposition in multi-path routing. In: Proceedings of IEEE INFOCOM, pp. 183–194 (2004)
Papadimitratos, P., Haas, Z.J.: Secure message transmission in mobile ad hoc networks. Ad Hoc Networks Journal 1(1), 193–209 (2003)
Parissidis, G., Lenders, V., May, M., Plattner, B.: Multi-path routing protocols in wireless mobile ad hoc networks: A quantitative comparison
Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)
Spafford, E.H.: Crisis and aftermath. Commun. ACM 32, 678–687 (1989)
Washburn, A., Wood, K.: Two-Person Zero-Sum Games for Network Interdiction. Operations Research 43(2), 243–251 (1995)
Lye, K.W., Wing, J.M.: Game strategies in network security (2002)
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
Calinescu, G., Kapoor, S., Quinn, M., Shin, J. (2012). Adversary Games in Secure/Reliable Network Routing. In: Jain, R., Kannan, R. (eds) Game Theory for Networks. GameNets 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30373-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-30373-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30372-2
Online ISBN: 978-3-642-30373-9
eBook Packages: Computer ScienceComputer Science (R0)