This Article 
 Bibliographic References 
 Add to: 
Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks
September 2007 (vol. 18 no. 9)
pp. 1227-1240
We introduce the Game-Theoretic Stochastic Routing (GTSR) framework, a proactive alternative to today's reactive approaches to route repair. GTSR minimizes the impact of link and router failure by (1) computing multiple paths between source and destination and (2) selecting among these paths randomly to forward packets. Besides improving fault-tolerance, the fact that GTSR makes packets take random paths from source to destination also improves security. In particular, it makes connection eavesdropping attacks maximally difficult as the attacker would have to listen on all possible routes. The approaches developed are suitable for network layer routing as well as for application layer overlay routing and multi-path transport protocols such as SCTP.Through simulations, we validate our theoretical results and show how the resulting routing algorithms perform in terms of the security/fault-tolerance/delay/throughput trade-off. We also show that a beneficial side-effect of these algorithms is an increase in throughput, as they make use of multiple paths.

[1] S. Bengio, G. Brassard, Y. Desmedt, C. Goutier, and J. Quisquater, “Secure Implementation of Identification Systems,” J. Cryptology, vol. 4, pp. 175-183, 1991.
[2] D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, and R. Morris, “Resilient Overlay Networks,” Proc. 18th ACM Symp. Operating Systems Principles (SOSP '01), 2001.
[3] L. Ong and J. Yoakum, An Introduction to the Stream Control Transmission Protocol (SCTP), RFC 3286, 2002.
[4] R. Blazek, H. Kim, B. Rozovskii, and A. Tartakovsky, “A Novel Approach to Detection of “Denial-of-Service” Attacks via Adaptive Sequential and Batch-Sequential Change Point Detection Methods,” Proc. Systems, Man, and Cybernetics Information Assurance and Security Workshop, June 2000.
[5] W. Xu and J. Rexford, “MIRO: Multi-Path Interdomain Routing,” Proc. ACM SIGCOMM '06, Sept. 2006.
[6] S. Bohacek, J.P. Hespanha, K. Obraczka, J. Lee, and C. Lim, “Enhancing Security via Stochastic Routing,” Proc. 11th IEEE Int'l Conf. Computer Comm. and Networks, May 2002.
[7] A. Emmett, “VPNs,” Am. Networks, May 1998.
[8] S. Kent, Security Architecture for the Internet Protocol, RFC 2401, 1998.
[9] P.F. Syverson, M.G. Reed, and D.M. Goldschlag, “Onion Routing Access Configurations,” Proc. DARPA Information Survivability Conf. and Exposition (DISCEX '00), vol. I, pp. 34-40, Jan. 2000.
[10] S. Kent, C. Lynn, J. Mikkelson, and K. Seo, “Secure Border Gateway Protocol (s-BGP)—Real World Performance and Deployment Issues,” Proc. Network and Distributed System Security Symp. (NDSS '00), 2000.
[11] M.K. Reiter and A.D. Rubin, “Crowds: Anonymity for Web Transactions,” ACM Trans. Information and System Security, vol. 1, pp. 66-92, 1998.
[12] C. Hopps, Analysis of an Equal-Cost Multi-Path Algorithm, RFC 2992, Nov. 2000.
[13] C. Villamizar, “OSPF Optimized Multipath (OSPF-OMP),” Internet Draft (draft-ietf-ospf-omp-03), Internet Eng. Task Force, June 1999.
[14] E. Altman, T. Boulogne, R. El-Azouzi, T. Jiménez, and L. Wynter, “A Survey on Networking Games in Telecommunications,” Computers and Operations Research, vol. 33, no. 2, pp. 286-311, 2006.
[15] A. Economides and J.A. Silvester, “Multi-Objective Routing in Integrated Services Networks: A Game Theory Approach,” Proc. IEEE INFOCOM, 1991.
[16] K. Yamaoka and Y. Sakai, “A Packet Routing Based on Game Theory,” Trans. Inst. of Electronics, Information, and Comm. Eng., B-I, pp. 73-79, 1996.
[17] R. Kannan, S. Sarangi, and S.S. Iyengar, “Sensor-Centric Energy-Constrained Reliable Query Routing for Wireless Sensor Networks,” J. Parallel and Distributed Computing, vol. 64, no. 7, pp. 839-852, 2004.
[18] A. Orda, R. Rom, and N. Shimkin, “Competitive Routing in Multiuser Communication Networks,” IEEE/ACM Trans. Networking, vol. 1, no. 5, pp. 510-521, 1993.
[19] E. Koutsoupias and C. Papadimitriou, “Worst-Case Equilibria,” Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science, pp.404-413, 1999.
[20] T. Roughgarden and E. Tardos, “How Bad Is Selfish Routing,” J.ACM, vol. 49, no. 2, pp. 236-259, 2002.
[21] R. La and V. Anantharam, “Optimal Routing Control: Repeated Game Approach,” IEEE Trans. Automatic Control, Mar. 2002.
[22] L. Qiu, Y.R. Yang, Y. Zhang, and S. Shenker, “On Selfish Routing in Internet-Like Environments,” Proc. ACM SIGCOMM '03, pp.151-162, 2003.
[23] J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, “A BGP-Based Mechanism for Lowest-Cost Routing,” Proc. 21st Ann. Symp. Principles of Distributed Computing (PODC '02), pp. 173-182, 2002.
[24] M. Afergan, “Using Repeated Games to Design Incentive-Based Routing Systems,” Proc. IEEE INFOCOM, 2006.
[25] A. Blanc, Y.-K. Liu, and A. Vahdal, “Designing Incentives for Peer-to-Peer Routing,” Proc. IEEE INFOCOM, 2005.
[26] T. Başar and G.J. Olsder, Dynamic Noncooperative Game Theory. Academic Press, 1995.
[27] D.P. Bertsekas, Network Optimization: Continuous and Discrete Models. Athena Scientific, 1998.
[28] A.V. Goldberg and R.E. Tarjan, “A New Approach to the Maximum-Flow Problem,” J. ACM, vol. 35, pp. 921-940, 1988.
[29] D.P. Bertsekas, “An Auction Algorithm for the Max-Flow Problem,” J. Optimization Theory and Applications, vol. 87, pp. 69-101, 1995.
[30] D.B. Johnson, D.A. Maltz, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks,” Ad Hoc Networking, C.E. Perkins, ed., pp. 139-172, Addison-Wesley, 2001.
[31] R. Perlman, “Network Layer Protocols with Byzantine Robustness,” PhD dissertation, Massachusetts Inst. of Tech nology, 1988.
[32] “The VINT Project, a Collaboration between UC Berkeley, LBL, USC/ISI, and Xerox PARC,” The ns Manual (formerly ns Notes and Documentation), Oct. 2000.
[33] D. Thaler and C. Hopps, Multipath Issues in Unicast and Multicast Next-Hop Selection, RFC 2991, Nov. 2000.
[34] S. Bohacek, J.P. Hespanha, J. Lee, C. Lim, and K. Obraczka, “TCP-PR: TCP for Persistent Packet Reordering,” Proc. IEEE 23rd Int'l Conf. Distributed Computing Systems, pp. 222-231, May 2003.
[35] E. Blanton and M. Allman, “On Making TCP More Robust to Packet Reordering,” ACM Computer Comm. Rev., vol. 32, 2002.
[36] C. Lim, S. Bohacek, J.P. Hespanha, and K. Obraczka, “Hierarchical Max-Flow Routing,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '05), Nov. 2005.
[37] S.D. Patek and D.P. Bertsekas, “Stochastic Shortest Path Games,” SIAM J. Control and Optimization, vol. 37, no. 3, pp. 804-824, 1999.
[38] R.A. Horn and C.R. Johnson, Matrix Analysis. Cambridge Univ. Press, 1993.

Index Terms:
Multi-path Routing, Stochastic Routing, Game Theory, Network Security, Fault Tolerance
Stephan Bohacek, Joao Hespanha, Junsoo Lee, Chansook Lim, Katia Obraczka, "Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 9, pp. 1227-1240, Sept. 2007, doi:10.1109/TPDS.2007.1000
Usage of this product signifies your acceptance of the Terms of Use.