Size-based scheduling: A recipe for DDOS?

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationCCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security
Pages729-731
Number of pages3
DOIs
StatePublished - Dec 16 2010
Externally publishedYes
Event17th ACM Conference on Computer and Communications Security, CCS'10 - Chicago, IL, United States
Duration: Oct 4 2010Oct 8 2010

Publication series

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

Other

Other17th ACM Conference on Computer and Communications Security, CCS'10
CountryUnited States
CityChicago, IL
Period10/4/1010/8/10

Keywords

  • Denial of service
  • LAS
  • SRPT
  • TCP

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Size-based scheduling: A recipe for DDOS?'. Together they form a unique fingerprint.

  • Cite this

    Serwadda, A., Phoha, V. V., & Rai, I. A. (2010). Size-based scheduling: A recipe for DDOS? In CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security (pp. 729-731). (Proceedings of the ACM Conference on Computer and Communications Security). https://doi.org/10.1145/1866307.1866412