Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017, Article ID 4651395, 13 pages
https://doi.org/10.1155/2017/4651395
Research Article

Scalable Node-Centric Route Mutation for Defense of Large-Scale Software-Defined Networks

1School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China
2CSIRO, Sydney, NSW 2122, Australia
3Global Big Data Technologies Centre, University of Technology Sydney, Ultimo, NSW 2007, Australia

Correspondence should be addressed to Yang Zhou; nc.ude.tpub@gnayuohz

Received 15 September 2017; Accepted 27 November 2017; Published 25 December 2017

Academic Editor: Qing Yang

Copyright © 2017 Yang Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. Shu, M. Krunz, and S. Liu, “Secure data collection in wireless sensor networks using randomized dispersive routes,” IEEE Transactions on Mobile Computing, vol. 9, no. 7, pp. 941–954, 2010. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Jafarian, E. Al-Shaer, and Q. Duan, “Formal approach for route agility against persistent attackers,” in Computer Security—ESORICS 2013, vol. 8134 of Lecture Notes in Computer Science, pp. 237–254, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  3. S. J. Moore and M. C. Sinclair, “Design of routing tables for a survivable military communications network using genetic algorithms,” in Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, pp. 1788–1795, USA, July 1999. View at Publisher · View at Google Scholar · View at Scopus
  4. J. Claessens, V. Dem, D. De Cock, B. Preneel, and J. Vandewalle, “On the security of todays online electronic banking systems,” Computers & Security, vol. 21, no. 3, pp. 253–265, 2002. View at Google Scholar
  5. M. R. Garey and D. S. Johnson, A Guide to The Theory of Np-Completeness, WH Freemann, New York, NY, USA, 1979.
  6. Q. Duan, E. Al-Shaer, and H. Jafarian, “Efficient Random Route Mutation considering flow and network constraints,” in Proceedings of the IEEE Conference on Communications and Network Security (CNS '13), pp. 260–268, IEEE, National Harbor, Md, USA, October 2013. View at Publisher · View at Google Scholar
  7. L. de Moura and N. Bjørner, “Satisfiability modulo theories: an appetizer,” in Formal Methods: Foundations and Applications, vol. 5902 of Lecture Notes in Computer Science, pp. 23–36, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  8. J. M. Jaffe, “Algorithms for finding paths with multiple constraints,” Networks, vol. 14, no. 1, pp. 95–116, 1984. View at Publisher · View at Google Scholar · View at Scopus
  9. R. Hassin, “Approximation schemes for the restricted shortest path problem,” Mathematics of Operations Research, vol. 17, no. 1, pp. 36–42, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  10. T. Korkmaz and M. Krunz, “Multi-constrained optimal path selection,” in Proceedings of the IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society, pp. 834–843, Anchorage, Alaska, USA. View at Publisher · View at Google Scholar
  11. R. G. Garroppo, S. Giordano, and L. Tavanti, “A survey on multi-constrained optimal path computation: Exact and approximate algorithms,” Computer Networks, vol. 54, no. 17, pp. 3081–3107, 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Paulos, P. Pal, R. Schantz, and B. Benyo, “Moving target defense (MTD) in an adaptive execution environment,” in Proceedings of the the Eighth Annual Cyber Security and Information Intelligence Research Workshop, Oak Ridge, Tenn, USA, January 2013. View at Publisher · View at Google Scholar
  13. E. Al-Shaer, Q. Duan, and J. H. Jafarian, “Random host mutation for moving target defense,” in Security and Privacy in Communication Networks, A. D. Keromytis and R. Di Pietro, Eds., vol. 106 of Lecture Notes of the Institute for Computer Sciences, pp. 310–327, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. J. H. Jafarian, E. Al-Shaer, and Q. Duan, “Openflow random host mutation: transparent moving target defense using software defined networking,” in Proceedings of the 1st Workshop on Hot Topics in Software Defined Networks (HotSDN '12), pp. 127–132, ACM, Helsinki, Finland, August 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. J. H. Jafarian, E. Al-Shaer, and Q. Duan, “An effective address mutation approach for disrupting reconnaissance attacks,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 12, pp. 2562–2577, 2015. View at Publisher · View at Google Scholar
  16. S. C. Brailsford, C. N. Potts, and B. M. Smith, “Constraint satisfaction problems: algorithms and applications,” European Journal of Operational Research, vol. 119, no. 3, pp. 557–581, 1999. View at Publisher · View at Google Scholar · View at Scopus
  17. C. Frei, B. Fallings, and M. Hamdi, “Resource allocation in communication networks using abstraction and constraint satisfaction,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 2, pp. 304–320, 2005. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Dunlop, S. Groat, W. Urbanski, R. Marchany, and J. Tront, “MT6D: a moving target IPv6 defense,” in Proceedings of the Military Communications Conference (MILCOM '11), pp. 1321–1326, IEEE, Baltimore, Md, USA, November 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. R. Moore, S. Groat, R. Marchany, and J. Tront, “Using transport layer multihoming to enhance network layer moving target defenses,” in Proceedings of the 8th Annual Cyber Security and Information Intelligence Research Workshop: Federal Cyber Security R and D Program Thrusts, CSIIRW 2013, USA, January 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. M. Albanese, A. De Benedictis, S. Jajodia, and K. Sun, “A moving target defense mechanism for MANETs based on identity virtualization,” in Proceedings of the 1st IEEE International Conference on Communications and Network Security, CNS 2013, pp. 278–286, USA, October 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. P. Kampanakis, H. Perros, and T. Beyene, “SDN-based solutions for Moving Target Defense network protection,” in Proceedings of the 15th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM '14), pp. 1–6, Sydney, Australia, June 2014. View at Publisher · View at Google Scholar · View at Scopus
  22. S. Achleitner, T. La Porta, P. McDaniel, S. Sugrim, S. V. Krishnamurthy, and R. Chadha, “Cyber deception: Virtual networks to defend insider reconnaissance,” in Proceedings of the 8th ACM CCS International Workshop on Managing Insider Security Threats, MIST 2016, pp. 57–68, Austria. View at Publisher · View at Google Scholar · View at Scopus
  23. Z. Zhao, D. Gong, B. Lu, F. Liu, and C. Zhang, “SDN-based double hopping communication against sniffer attack,” Mathematical Problems in Engineering, vol. 2016, Article ID 8927169, 13 pages, 2016. View at Publisher · View at Google Scholar · View at Scopus
  24. S. Bohawek, J. P. Hespanha, J. Lee, C. Lim, and K. 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, 2007. View at Publisher · View at Google Scholar · View at Scopus
  25. Z. Wang, J. Wu, G. Cheng, and Y. Jiang, “Mutine: a mutable virtual network embedding with game-theoretic stochastic routing,” in Proceedings of the IEEE Global Communications Conference (GLOBECOM), pp. 1–6, San Diego, Calif, USA, December 2015. View at Publisher · View at Google Scholar
  26. M. Zalewski, Silence on the wire: a field guide to passive reconnaissance and indirect attacks, Starch Press, 2005. View at Publisher · View at Google Scholar
  27. T. Urban, Cacti 0.8 beginner’s guide, Packt Publishing Ltd, 2011.
  28. J. Moy, “OSPF Version 2,” 1997.
  29. R. E. Tarjan, “Depth-first search and linear graph algorithms,” SIAM Journal on Computing, vol. 1, no. 2, pp. 146–160, 1972. View at Publisher · View at Google Scholar · View at MathSciNet
  30. D. Zhang and G. Lu, “Evaluation of similarity measurement for image retrieval,” in Proceedings of the 2003 International Conference on Neural Networks and Signal Processing, ICNNSP'03, pp. 928–931, China, December 2003. View at Publisher · View at Google Scholar · View at Scopus
  31. Y. Rubner, C. Tomasi, and L. J. Guibas, “Earth mover's distance as a metric for image retrieval,” International Journal of Computer Vision, vol. 40, no. 2, pp. 99–121, 2000. View at Publisher · View at Google Scholar · View at Scopus
  32. J. E. Mitchell, “Branch-and-cut algorithms for combinatorial optimization problems,” in Handbook of Applied Optimization, pp. 65–77, 2002. View at Google Scholar
  33. I. Maros, Computational techniques of the simplex method, vol. 61, Springer Science & Business Media, 2012.
  34. N. Megiddo, On the Complexity of Linear Programming, IBM Thomas J. Watson Research Division, 1986.
  35. I. Adler and N. Megiddo, “A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension,” Journal of the ACM, vol. 32, no. 4, pp. 871–895, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. W. L. Winston, M. Venkataramanan, and J. B. Goldberg, Introduction to Mathematical Programming, vol. 1, Thomson/Brooks/Cole Duxbury, Pacific Grove, Calif, USA, 2003.
  37. A. A. Hagberg, D. A. Schult, and P. J. Swart, “Exploring network structure, dynamics, and function using NetworkX,” in Proceedings of the 7th Python in Science Conference (SciPy 2008), pp. 11–15, Pasadena, Calif, USA, 2008.
  38. S. Skiena, “Dijkstra’s algorithm,” in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, Addison-Wesley, Reading, Mass, USA, 1990. View at Google Scholar · View at MathSciNet