{'fraction_non_alphanumeric': 0.01734820322180917, 'fraction_numerical': 0.0, 'mean_word_length': 5.075187969924812, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A game theory based rate limiting scheme against Distributed Denial-of-Service attacks

Distributed Denial-of-Service (DDoS) attacks are a critical threat to the Internet. This paper introduces a novel DDoS defense scheme that supports automated online attack characterizations and accurate attack packet discarding based on game theory. The key idea is to formulate the bandwidth computing as a noncooperative game. And then a high volume of simulations is done to compute the Nash equilibria of the game. DDoS attacks and which kinds of attacking strategies are more dangerous or more likely to be enforced by the attacker are given in the simulations. Our method may substantially improve people's understanding about the nature of the DDoS threat and the defense system's resilience against this threat.