Analysis of traffic correlation attacks on router queues

  • Authors:
  • Yan Cai;Patrick P. C. Lee;Weibo Gong;Don Towsley

  • Affiliations:
  • Department of Electrical Engineering, University of Massachusetts, Amherst, USA;Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong;Department of Electrical Engineering, University of Massachusetts, Amherst, USA;Department of Computer Science, University of Massachusetts, Amherst, USA

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traffic burstiness is known to be undesirable for a router as it increases the router's queue length and hence the queueing delays of data flows. This poses a security problem in which an attacker intentionally introduces traffic burstiness into routers. We consider a correlation attack, whose fundamental characteristic is to correlate multiple attack flows to generate synchronized small attack bursts, in an attempt to aggregate the bursts into a large burst at a target router. In this paper, we develop an analytical, fluid-based framework that models how the correlation attack disrupts router queues and how it can be mitigated. Using Poisson Counter Stochastic Differential Equations (PCSDEs), our framework captures the dynamics of a router queue for special cases and gives the closed-form average router queue length as a function of the inter-flow correlation. To mitigate the correlation attack, we apply our analytical framework to model different pacing schemes including Markov ON-OFF pacing and rate limiting, which are respectively designed to break down the inter-flow correlation and suppress the peak rates of bursts. We verify that our fluid models conform to packet-level ns2 simulation results.