Network Topology Effects on the Detectability of Crossfire Attacks
- 29 January 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 13 (7) , 1682-1695
Abstract
New strains of distributed denial-of-service (DDoS) attacks have exhibited potential to disconnect communication networks, even cutting off entire countries from the Internet. The “crossfire” is a new, indirect DDoS link-flooding attack, which masks itself as natural congestion, making it very hard to counter. Several studies have proposed online attack detection schemes, whose efficiency has been shown to vary in different network topologies. However, the topology/detection relation has been studied qualitatively, without formal proof or quantification metric. This paper is motivated by the fact that network topology changes are generally expensive and slow. Therefore, network designers should be provided with means of evaluating the effects of topology modifications to the attack detection efficiency. This paper fills this gap by contributing a formal proof for the topology-detection efficiency relation, as well as a novel off-line metric that quantifies it. Full attack prototypes are implemented and evaluated in real-Internet topologies, validating the analytical findings. It is shown that the novel metric expresses the topology-detection relation efficiently, while existing and widely used metrics do not constitute good choices for this task.Keywords
Funding Information
- European Union Project CIPSEC: Enhancing Critical Infrastructure Protection with an Innovative Security Framework (EU700378)
This publication has 34 references indexed in Scilit:
- Detecting Distributed Denial of Service Attacks: Methods, Tools and Future DirectionsThe Computer Journal, 2013
- Internet and the Erlang formulaACM SIGCOMM Computer Communication Review, 2012
- Cytoscape: A Community-Based Framework for Network Modeling2009
- The Coremelt Attack2009
- Understanding network concepts in modulesBMC Systems Biology, 2007
- BPG routing policies in ISP networksIEEE Network, 2005
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- Topology of Evolving Networks: Local Events and UniversalityPhysical Review Letters, 2000
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- Significance Testing of the Spearman Rank Correlation CoefficientJournal of the American Statistical Association, 1972