Size-based scheduling: a recipe for DDOS?

  • Authors:
  • Abdul Serwadda;Vir V. Phoha;Idris A. Rai

  • Affiliations:
  • Louisiana Tech University, Ruston, LA, USA;Louisiana Tech University, Ruston, LA, USA;Makerere University, Kampala, Uganda

  • Venue:
  • Proceedings of the 17th ACM conference on Computer and communications security
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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 size-based schedulings 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.