FINDING · DETECTION

Optimal RAD by a QoS-cautious wealthy Chinese censor (profile T1, F/ρ₀ = 5×10^6) forces 10.8% of routes onto non-valley-free (NVF) paths and 1.2% onto less-preferred routes, while still leaving 16.3% of routes traversing decoy ASes—zero routes become unreachable at this budget. The NVF and less-preferred-route fractions rise and then fall as decoy budget increases, as further RAD routing gains diminish past a crossover point.

From 2016-nasr-gameGame of Decoys: Optimal Decoy Routing Through Game Theory · §6.4 / Figure 1 · 2016 · Computer and Communications Security

Implications

Tags

censors
cn
techniques
bgp-hijack
defenses
decoy-routing

Extracted by claude-sonnet-4-6 — review before relying.