When mice devour the elephants

A DDoS attack against size-based scheduling schemes in the internet

Abdul Serwadda, Vir Phoha

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Abstract Size-based scheduling (SBS) has been shown to offer significant performance improvement in Web servers and routers. However, most of the performance benefits offered by SBS rely on the premise that the scheduler will interact with a "well behaved" heavy tailed job size distribution. In this paper we design an attack that degrades the performance of an SBS scheduler by subjecting it to a job size distribution which violates the core traffic properties from which SBS derives its strengths. Through theoretical work and a wide range of experiments, we demonstrate the lethality of the attack against routers that use SBS. Additionally, we cite evidence that indicates why the tools and practical manoeuvres required to carry out the attack on a live network are within the reach of adversaries. As flavors of SBS begin to grace the Internet, the paper provides a timely cautionary note on the challenges that SBS could face if widely deployed without specialized defense mechanisms.

Original languageEnglish (US)
Article number901
Pages (from-to)31-43
Number of pages13
JournalComputers and Security
Volume53
DOIs
StatePublished - Jun 12 2015

Fingerprint

scheduling
Scheduling
Internet
Routers
performance
defense mechanism
Flavors
Servers
traffic
experiment
evidence
Experiments

Keywords

  • Denial of service (DoS) attacks
  • Network security
  • ns2
  • Scheduling
  • Simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Law

Cite this

When mice devour the elephants : A DDoS attack against size-based scheduling schemes in the internet. / Serwadda, Abdul; Phoha, Vir.

In: Computers and Security, Vol. 53, 901, 12.06.2015, p. 31-43.

Research output: Contribution to journalArticle

@article{f3d310bf672b4a608a15c8c08554aeea,
title = "When mice devour the elephants: A DDoS attack against size-based scheduling schemes in the internet",
abstract = "Abstract Size-based scheduling (SBS) has been shown to offer significant performance improvement in Web servers and routers. However, most of the performance benefits offered by SBS rely on the premise that the scheduler will interact with a {"}well behaved{"} heavy tailed job size distribution. In this paper we design an attack that degrades the performance of an SBS scheduler by subjecting it to a job size distribution which violates the core traffic properties from which SBS derives its strengths. Through theoretical work and a wide range of experiments, we demonstrate the lethality of the attack against routers that use SBS. Additionally, we cite evidence that indicates why the tools and practical manoeuvres required to carry out the attack on a live network are within the reach of adversaries. As flavors of SBS begin to grace the Internet, the paper provides a timely cautionary note on the challenges that SBS could face if widely deployed without specialized defense mechanisms.",
keywords = "Denial of service (DoS) attacks, Network security, ns2, Scheduling, Simulation",
author = "Abdul Serwadda and Vir Phoha",
year = "2015",
month = "6",
day = "12",
doi = "10.1016/j.cose.2015.04.014",
language = "English (US)",
volume = "53",
pages = "31--43",
journal = "Computers and Security",
issn = "0167-4048",
publisher = "Elsevier",

}

TY - JOUR

T1 - When mice devour the elephants

T2 - A DDoS attack against size-based scheduling schemes in the internet

AU - Serwadda, Abdul

AU - Phoha, Vir

PY - 2015/6/12

Y1 - 2015/6/12

N2 - Abstract Size-based scheduling (SBS) has been shown to offer significant performance improvement in Web servers and routers. However, most of the performance benefits offered by SBS rely on the premise that the scheduler will interact with a "well behaved" heavy tailed job size distribution. In this paper we design an attack that degrades the performance of an SBS scheduler by subjecting it to a job size distribution which violates the core traffic properties from which SBS derives its strengths. Through theoretical work and a wide range of experiments, we demonstrate the lethality of the attack against routers that use SBS. Additionally, we cite evidence that indicates why the tools and practical manoeuvres required to carry out the attack on a live network are within the reach of adversaries. As flavors of SBS begin to grace the Internet, the paper provides a timely cautionary note on the challenges that SBS could face if widely deployed without specialized defense mechanisms.

AB - Abstract Size-based scheduling (SBS) has been shown to offer significant performance improvement in Web servers and routers. However, most of the performance benefits offered by SBS rely on the premise that the scheduler will interact with a "well behaved" heavy tailed job size distribution. In this paper we design an attack that degrades the performance of an SBS scheduler by subjecting it to a job size distribution which violates the core traffic properties from which SBS derives its strengths. Through theoretical work and a wide range of experiments, we demonstrate the lethality of the attack against routers that use SBS. Additionally, we cite evidence that indicates why the tools and practical manoeuvres required to carry out the attack on a live network are within the reach of adversaries. As flavors of SBS begin to grace the Internet, the paper provides a timely cautionary note on the challenges that SBS could face if widely deployed without specialized defense mechanisms.

KW - Denial of service (DoS) attacks

KW - Network security

KW - ns2

KW - Scheduling

KW - Simulation

UR - http://www.scopus.com/inward/record.url?scp=84930942092&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84930942092&partnerID=8YFLogxK

U2 - 10.1016/j.cose.2015.04.014

DO - 10.1016/j.cose.2015.04.014

M3 - Article

VL - 53

SP - 31

EP - 43

JO - Computers and Security

JF - Computers and Security

SN - 0167-4048

M1 - 901

ER -