This document discusses detecting heavy hitter flows at the network edge. It defines heavy hitter flows as those that contribute the most to network traffic volume. Detecting these flows provides visibility into network congestion, enables proper provisioning and capacity planning, and allows for accurate accounting and billing. The document describes using a Count-Min Sketch data structure to efficiently detect heavy hitter flows at the network edge in a localized, fast manner with low bandwidth consumption. This allows real-time policy adherence and anomaly detection at individual edge switches in the network.