Leveraging Zipf's law for traffic offloading

  • Authors:

  • Nadi Sarrar;Steve Uhlig;Anja Feldmann;Rob Sherwood;Xin Huang

  • Affiliations:

  • TU Berlin / T-Labs, Berlin, Germany;TU Berlin / T-Labs, Berlin, Germany;TU Berlin / T-Labs, Berlin, Germany;Big Switch Networks, Palo Alto, CA, USA;Deutsche Telekom Inc. R&D Lab, Los Altos, CA, USA

  • Venue:
  • ACM SIGCOMM Computer Communication Review
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Internet traffic has Zipf-like properties at multiple aggregation levels. These properties suggest the possibility of offloading most of the traffic from a complex controller (e.g., a software router) to a simple forwarder (e.g., a commodity switch), by letting the forwarder handle a very limited set of flows; the heavy hitters. As the volume of traffic from a set of flows is highly dynamic, maintaining a reliable set of heavy hitters over time is challenging. This is especially true when we face a volume limit in the non-offloaded traffic in combination with a constraint in the size of the heavy hitter set or its rate of change. We propose a set selection strategy that takes advantage of the properties of heavy hitters at different time scales. Based on real Internet traffic traces, we show that our strategy is able to offload most of the traffic while limiting the rate of change of the heavy hitter set, suggesting the feasibility of alternative router designs.