Size-based scheduling: A recipe for DDOS?

Abdul Serwadda; Vir V. Phoha; Idris A. Rai

doi:10.1145/1866307.1866412

Size-based scheduling: A recipe for DDOS?

Abdul Serwadda, Vir V. Phoha, Idris A. Rai

Research output: Chapter in Book/Entry/Poem › Conference contribution

5 Scopus citations

Abstract

Internet traffic measurements have shown that the majority of the Internet's flows are short, while a small percentage of the largest flows are responsible for most of the bytes. To exploit this property for performance improvement in routers and Web servers, several studies have proposed sizebased scheduling to offer preferential treatment to the shortest flows. In this work, we present analytical and simulation results which confirm that size-based scheduling will ease the task of launching DDOS attacks on the Internet.

Original language	English (US)
Title of host publication	CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security
Pages	729-731
Number of pages	3
DOIs	https://doi.org/10.1145/1866307.1866412
State	Published - 2010
Externally published	Yes
Event	17th ACM Conference on Computer and Communications Security, CCS'10 - Chicago, IL, United States Duration: Oct 4 2010 → Oct 8 2010

Publication series

Name	Proceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)	1543-7221

Other

Other	17th ACM Conference on Computer and Communications Security, CCS'10
Country/Territory	United States
City	Chicago, IL
Period	10/4/10 → 10/8/10

Keywords

Denial of service
LAS
SRPT
TCP

ASJC Scopus subject areas

Software
Computer Networks and Communications

Access to Document

10.1145/1866307.1866412

Cite this

Serwadda, A, Phoha, VV & Rai, IA 2010, Size-based scheduling: A recipe for DDOS? in CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security. Proceedings of the ACM Conference on Computer and Communications Security, pp. 729-731, 17th ACM Conference on Computer and Communications Security, CCS'10, Chicago, IL, United States, 10/4/10. https://doi.org/10.1145/1866307.1866412

@inproceedings{bf4f47972516426099cc08ffa95d105c,

title = "Size-based scheduling: A recipe for DDOS?",

abstract = "Internet traffic measurements have shown that the majority of the Internet's flows are short, while a small percentage of the largest flows are responsible for most of the bytes. To exploit this property for performance improvement in routers and Web servers, several studies have proposed sizebased scheduling to offer preferential treatment to the shortest flows. In this work, we present analytical and simulation results which confirm that size-based scheduling will ease the task of launching DDOS attacks on the Internet.",

keywords = "Denial of service, LAS, SRPT, TCP",

author = "Abdul Serwadda and Phoha, {Vir V.} and Rai, {Idris A.}",

year = "2010",

doi = "10.1145/1866307.1866412",

language = "English (US)",

isbn = "9781450302449",

series = "Proceedings of the ACM Conference on Computer and Communications Security",

pages = "729--731",

booktitle = "CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security",

note = "17th ACM Conference on Computer and Communications Security, CCS'10 ; Conference date: 04-10-2010 Through 08-10-2010",

}

TY - GEN

T1 - Size-based scheduling

T2 - 17th ACM Conference on Computer and Communications Security, CCS'10

AU - Serwadda, Abdul

AU - Phoha, Vir V.

AU - Rai, Idris A.

PY - 2010

Y1 - 2010

N2 - Internet traffic measurements have shown that the majority of the Internet's flows are short, while a small percentage of the largest flows are responsible for most of the bytes. To exploit this property for performance improvement in routers and Web servers, several studies have proposed sizebased scheduling to offer preferential treatment to the shortest flows. In this work, we present analytical and simulation results which confirm that size-based scheduling will ease the task of launching DDOS attacks on the Internet.

AB - Internet traffic measurements have shown that the majority of the Internet's flows are short, while a small percentage of the largest flows are responsible for most of the bytes. To exploit this property for performance improvement in routers and Web servers, several studies have proposed sizebased scheduling to offer preferential treatment to the shortest flows. In this work, we present analytical and simulation results which confirm that size-based scheduling will ease the task of launching DDOS attacks on the Internet.

KW - Denial of service

KW - LAS

KW - SRPT

KW - TCP

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

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

U2 - 10.1145/1866307.1866412

DO - 10.1145/1866307.1866412

M3 - Conference contribution

AN - SCOPUS:78650006397

SN - 9781450302449

T3 - Proceedings of the ACM Conference on Computer and Communications Security

SP - 729

EP - 731

BT - CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security

Y2 - 4 October 2010 through 8 October 2010

ER -

Size-based scheduling: A recipe for DDOS?

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this