Crate heavykeeper 

HeavyKeeper is for finding Top-K elephant flows with high precision and low memory footprint

This implementation is based on the paper HeavyKeeper: An Accurate Algorithm for Finding Top-k Elephant Flows by Junzhi Gong, Tong Yang, Haowei Zhang, and Hao Li, Peking University; Steve Uhlig, Queen Mary, University of London; Shigang Chen, University of Florida; Lorna Uden, Staffordshire University; Xiaoming Li, Peking University

Structs

BucketedNode

BucketedTopK

CuckooNode

CuckooTopK

HeavyKeeper variant where each bucket has a probabilistic-decay “lobby” cell plus depth non-decaying “heavy” slots. New items land in the lobby of their primary bucket and are promoted to a heavy slot once they outweigh the resident lobby fingerprint. Heavy items live in one of two candidate buckets (cuckoo-style); on collision the lower-count occupant is evicted and re-homed in its other candidate bucket via a bounded kick chain.

TopK

TopKNode

Enums

BucketedBuilderError

BucketedMergeError

CuckooBuilderError

CuckooMergeError