An Efficient Algorithm for Measuring Medium-To Large-Sized Flows in Network Traffic

Free registration required

Executive Summary

It has been well recognized that identifying very large flows (i.e., elephants) in a network traffic stream is important for a variety of network applications ranging from traffic engineering to anomaly detection. However, the authors found that many of these applications have an increasing need to monitor not only the few largest flows (say top 20), but also all of the medium-sized flows (say top 20,000). Unfortunately, existing techniques for identifying elephant flows at high link speeds are not suitable and cannot be trivially extended for identifying the medium-sized flows.

  • Format: PDF
  • Size: 241.3 KB