YEONG-SUNG LINTsang, P.-HP.-HTsangKuo, C.-B.C.-B.Kuo2020-02-112020-02-112008https://scholars.lib.ntu.edu.tw/handle/123456789/457548As networks become more popular, network attack events are occurring more frequently, especially Distributed Denial-of-Service (DDoS) attacks. To counter such attacks and achieve the objective of "continuity of service", it is essential that networks be well designed with spare resource allocation capacity so that acceptable Quality-of-Service (QoS) levels can be maintained. In this paper, we address the problem of defending against intelligent DDoS attacks by using routing assignments and resource allocation strategies under QoS constraints. The problem is analyzed as a mixed, nonlinear, integer programming optimization problem with a max-min format. The solution approach is based on the Lagrangean Relaxation and subgradient method, which solves this complicated problem effectively. The efficiency and effectiveness of the proposed heuristic are evaluated by computational experiments.Distributed Denial-of-Service (DDoS); Lagrangean Relaxation; Network Attack and Defense; Optimization Problem; Resource Allocation; Survivability[SDGs]SDG16Distributed denial of service; Lagrangean Relaxation; Network attack; Optimization problems; Survivability; Computer crime; Cybernetics; Information science; Information systems; Integer programming; Management information systems; Resource allocation; Systems analysis; Quality of serviceconference paper2-s2.0-84869479268https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869479268&partnerID=40&md5=05b1348af0c6767090b27e28ef0ae9d2