Towards a denial-of-service resilient design of complex IPsec overlays

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Brinkmeier, Michael ^a   Rossberg, Michael ^a   Schaefer, Guenter ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Availability; Denial of service; IPsec; Modeling; Virtual private networks

Indexed keywords

DENIAL OF SERVICE ATTACKS; DENIAL-OF-SERVICE; DOS ATTACKS; FORMAL MODEL; IPSEC; MODELING; PLANNING PROCESS; REMOTE ENVIRONMENT; RESILIENT DESIGN; VIRTUAL PRIVATE NETWORKS;

COMPUTER ARCHITECTURE; COMPUTER CRIME; GATEWAYS (COMPUTER NETWORKS);

TELECOMMUNICATION NETWORKS;

EID: 70449493255     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5199533     Document Type: Conference Paper

References (17)

1. V. Bollapragada, M. Khalid, and S. Wainner, IPSec VPN Design. Cisco Press, 2005.
2. Cisco Systems, Inc., "Dynamic Multipoint VPN (DMVPN)," 2006.
3. Cisco Systems, Inc., "Cisco Group Encrypted Transport VPN," 2007.
4. R. Ramanujan, M. Kaddoura, J. Wu, C. Sanders, and K. Millikin, "VPNshield: protecting VPN services from denial-of-service (DoS) attacks," in DARPA Information Survivability Conference and Exposition, 2003. Proceedings, vol. 2, 2003, pp. 138-139.
5. M. Menth, S. Kopf, J. Charzinski, and K. Schrodi, "Resilient Network Admission Control," Computer Networks, 2008.
6. Y. Xu and R. Guerin, "A Double Horizon Defense Design for Robust Regulation of Malicious Traffic," in Securecomm, 2006, pp. 1-11.
7. M. Waldvogel and T. Köck, "Light-weight End-to-End QoS as DoS Prevention," in 32nd IEEE Conference on Local Computer Networks, 2007. LCN 2007., 2007, pp. 246-248.
8. J. Kong, M. Mirza, J. Shu, C. Yoedhana, M. Gerla, and S. Lu, "Random flow network modeling and simulations for DDoS attack mitigation," in IEEE International Conference on Communications, 2003, pp. 487-491.
9. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows. Prentice Hall, 1993.
10. L. R. Ford and D. R. Fulkerson, "Maximal flow through a network," Canadian Journal of Mathematics, vol. 8, pp. 399-404, 1956.
11. J.-C. Picard and M. Queyranne, "On The Structure of All Minimum Cuts in a Network and Applications," Mathematical Programming Strudy, vol. 13, pp. 8-16, 1980.
12. R. Diestel, Graphentheorie (Graph Theory). Berlin, Heidelberg, New York: Springer, 2000, 2. Auflage.
13. M. R. Henzinger, S. Rao, and H. N. Gabow, "Computing Vertex Connectivity: New Bounds from Old Techniques," in FOCS, 1996, pp. 462-471.
14. R. E. Tarjan, "Depth-First Search and Linear Graph Algorithms." SIAM J. Comput., vol. 1, no. 2, pp. 146-160, 1972.
15. E. G. Amoroso, Fundamentals of Computer Security Technology. Prentice-Hall, Inc., 1994.
16. S. Even, A. Itai, and A. Shamir, "On the Complexity of Timetable and Multicommodity Flow Problems," SIAM J. Comput., vol. 5, no. 4, pp. 691-703, 1976.
17. L. Fleischer, "Approximating Fractional Multicommodity Flow Independent of the Number of Commodities," SIAM J. Discrete Math., vol. 13, no. 4, pp. 505-520, 2000.