Advertisement

Removing Undesirable Flows by Edge Deletion

  • Gleb Polevoy
  • Stojan Trajanovski
  • Paola Grosso
  • Cees de Laat
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11346)

Abstract

Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within \(2 \sqrt{ 2\left| E \right| }\) and \(2 \sqrt{2 (\left| E \right| + \left| \text {undesirable flows} \right| )}\), respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming.

Notes

Acknowledgments

This research is funded by the Dutch Science Foundation project SARNET (grant no: CYBSEC.14.003/618.001.016)

References

  1. 1.
    Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discret. Math. 12(3), 289–297 (1999)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bondy, J., Murty, U.: Graph Theory with Applications. Elsevier Science Publishing Co., Inc., New York (1976)CrossRefGoogle Scholar
  3. 3.
    Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 345–353. Society for Industrial and Applied Mathematics, Philadelphia (2000)Google Scholar
  4. 4.
    Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)zbMATHGoogle Scholar
  5. 5.
    Cygan, M., et al.: Parameterized Algorithms, 1st edn. Springer Publishing Company, Incorporated, Cham (2015).  https://doi.org/10.1007/978-3-319-21275-3CrossRefzbMATHGoogle Scholar
  6. 6.
    Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness I: basic results. SIAM J. Comput. 24(4), 873–921 (1995).  https://doi.org/10.1137/S0097539792228228MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)zbMATHGoogle Scholar
  8. 8.
    Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 671–680, October 2009Google Scholar
  10. 10.
    Khuller, S., Thurimella, R.: Approximation algorithms for graph augmentation. J. Algorithms 14(2), 214–225 (1993)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Koning, R., de Graaff, B., de Laat, C., Meijer, R., Grosso, P.: Interactive analysis of SDN-driven defence against distributed denial of service attacks. In: 2016 IEEE NetSoft Conference and Workshops (NetSoft), pp. 483–488, June 2016Google Scholar
  12. 12.
    Miettinen, P.: On the positive-negative partial set cover problem. Inf. Process. Lett. 108(4), 219–221 (2008)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Mirkovic, J., Dietrich, S., Dittrich, D., Reiher, P.: Internet Denial of Service: Attack and Defense Mechanisms (Radia Perlman Computer Networking and Security). Prentice Hall PTR, Upper Saddle River (2004)Google Scholar
  14. 14.
    Mirkovic, J., Reiher, P.: A taxonomy of DDoS attack and DDoS defense mechanisms. SIGCOMM Comput. Commun. Rev. 34(2), 39–53 (2004)CrossRefGoogle Scholar
  15. 15.
    Peleg, D.: Approximation algorithms for the label-covermax and red-blue set cover problems. J. Discret. Algorithms 5(1), 55–64 (2007)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001).  https://doi.org/10.1007/978-3-662-04565-7CrossRefzbMATHGoogle Scholar
  17. 17.
    Watanabe, T., Ae, T., Nakamura, A.: On the removal of forbidden graphs by edge-deletion or by edge-contraction. Discret. Appl. Math. 3(2), 151–153 (1981)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 253–264. ACM, New York (1978)Google Scholar
  19. 19.
    Zargar, S.T., Joshi, J., Tipper, D.: A survey of defense mechanisms against distributed denial of service (DDoS) flooding attacks. IEEE Commun. Surv. Tutor. 15(4), 2046–2069 (2013, Fourth)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Gleb Polevoy
    • 1
  • Stojan Trajanovski
    • 1
    • 2
  • Paola Grosso
    • 1
  • Cees de Laat
    • 1
  1. 1.University of AmsterdamAmsterdamThe Netherlands
  2. 2.Philips ResearchEindhovenThe Netherlands

Personalised recommendations