On t On the F he Feas easibilit ibility o y of Re Rerouting-bas based D d DDoS D S Defens nses
Mu Muoi Tran, Min Suk Kang, Hsu-Chun Hsiao, Wei-Hsuan Chiang, Shu-Po Tung, Yu-Su Wang May 2019 | San Francisco, CA
On t On the F he Feas easibilit ibility o y of Re - - PowerPoint PPT Presentation
On t On the F he Feas easibilit ibility o y of Re Rerouting-bas based D d DDoS D S Defens nses Mu Muoi Tran , Min Suk Kang, Hsu-Chun Hsiao, Wei-Hsuan Chiang, Shu-Po Tung, Yu-Su Wang May 2019 | San Francisco, CA Transit-link DDoS
Mu Muoi Tran, Min Suk Kang, Hsu-Chun Hsiao, Wei-Hsuan Chiang, Shu-Po Tung, Yu-Su Wang May 2019 | San Francisco, CA
2 Coremelt attack (ESORICS ‘09) Crossfire attack (S&P ‘13)
(distributed denial of service)
Traditional: volumetric attack traffic targeting end servers Non-traditional: volumetric attack traffic targeting transit links
AS AS AS AS
t r a n s i t l i n k Real incidents: Academic studies:
2013 2015
AS AS AS
AS AS
Indistinguishable low-rate traffic Victims are indirectly affected
3 Destination Source
AS AS
AS
Coremelt attack (Studer et al.) Crossfire attack (Kang et al.) 2009 2013 2016 2014 4 2018
Routing Around Congestion
(Smith et al. S&P’18)
“Readily deployable solution"
SPIFFY (Kang et al.) CoDef defense (Lee et al.) LinkScope (Xue et al.)
Partial solutions
RADAR (Zheng et al.) NetHide (Meier et al.) STRIDE (Hsiao et al.) SIBRA (Basescu et al.)
Not available in the current Internet
5
{D}
Border Gateway Protocol (BGP)
AS D AS Z AS X AS C AS Y { Z, D} { Y, Z, D} { X, Y, Z, D}
Traffic path
BGP propagation Traffic forwarding Source Destination
No control over traffic path by design Loop-free AS-path
6
AS D AS Z AS W AS X AS C AS Y
Goal: reroute to avoid AS W
{D, W, D}
x
Loop detected!
Critical source Detour path
BGP poisoning message
Original path Victim destination
7
AS D AS Z AS W AS X AS C AS Y {D, W, D}
Critical source Detour path
BGP poisoning message
Original path Victim destination
Switch to detour path
AS collaboration is not needed!
8
Future directions for transit-link DDoS defenses Practical challenge of mitigating adaptive detour-learning attack
9
Adaptive detour-learning attack against rerouting solutions
10
Goals: (1) To detect rerouting in real-time (2) To learn new detour path accurately (3) To congest new detour path (see the paper) Capabilities:
Victim destination
11
AS D AS Z AS W AS X AS C AS Y
Critical source Original path
AS I
traceroute
Adaptive adversary
Victim destination
12
AS D AS Z AS W AS X AS C AS Y
Critical source Detour path
AS I
traceroute
Rerouting is detected!
Adaptive adversary
13
AS D AS Y AS G AS C AS X AS E AS J AS I AS H
(3) congest detour path (see the paper)
Challenge: Which is more accurate route measurement
Victim destination Critical source
Solution: Prioritize measurement from bot closer to traffic source
Detour path
closer AS (e.g., shorter AS-path)
14
AS D AS Y AS G AS C AS X AS E AS J AS I AS H
(3) congest detour path (see the paper)
Challenge: Which is more accurate route measurement
Victim destination Critical source
Solution: Prioritize measurement from bot closer to traffic source
Detour path
closer AS (e.g., shorter AS-path)
Future directions for transit-link DDoS defenses Adaptive detour-learning attack against rerouting solutions
15
Practical challenge of mitigating adaptive detour-learning attack
AS I AS J
16
Exclusively used for critical flows
Poison all peers of ASes on detour path!
AS D AS Z AS W AS X AS C AS Y
Critical source Victim destination
Detour path must be isolated!
Detour learned!
How to isolate?
0.8
2 3 4
0.2 0.4 0.6 0.8 1
17
CDF 100 1000 10000 Number of ASes that should be poisoned
Thousands ASes should be poisoned But why? Tier-1 or large Tier-2
(more in the paper)
0.2 0.4 0.6 1
0.8
2 3 40.2 0.4 0.6 0.8 1
18
CDF
100 1000 10000
Number of ASes that should be poisoned
255 2034
Specification up to 2034 Implementation up to 255 Configuration up to 30-50
0.2 0.4 0.6 1
Specification Implementation
19
Number of
BGP messages
99.99%
1 10 100 1000 30
slowly decrease in frequency 50x drop in frequency
255 Number of ASes seen in a BGP message
19
20
Number of
BGP messages
99.99%
1 10 100 1000 30
slowly decrease in frequency 50x drop in frequency
255 Number of ASes seen in a BGP message
20
Practical challenge of mitigating adaptive detour-learning attack Adaptive detour-learning attack against rerouting solutions
21
Future directions for transit-link DDoS defenses
22
Clean-slate Internet architecture Hacking BGP e.g., STRIDE, SIBRA e.g., Routing Around Congestion
?
e.g., explicit BGP rerouting for critical flows under emergency
✕ Too costly to deploy ✕ Does not work
23
24
25
26
27
Specification Implementation Configuration
üTransit-link DDoS attacks still remain an open problem
üBalance destination-controlled routing and deployability
üHacking BGP for rerouting is a flawed idea üAnalysis with specification only can be dangerous
28