heavykeeper-rs

Top-K Heavykeeper algorithm for Top-K elephant flows

This 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

Example

See ip_files.rs for an example of how to use the library to count the top-k IP flows in a file.

A sample usage is as follows:

    // create a new TopK

    let mut topk = TopK::new(k, width, depth, decay);

    // add some items
    topk.add(item);

    // check the counts
    for node in topk.list() {
        println!("{} {}", String::from_utf8_lossy(&node.item), node.count);
    }

Other Implementations

Jigsaw-Sketch: a fast and accurate algorithm for finding top-k elephant flows in high-speed networks Boyu ZHANG, He HUANG, Yu-E SUN, Yang DU & Dan WANG

Running

An example driver program which can be used as a word count program can be found at main.rs.

Usage:

cargo build --release
target/release/heavykeeper -k 10 -w 8192 -d 2 -y 0.95 -f data/war_and_peace.txt

Building the example

cargo build --examples --release
target/release/examples/ip_files

License

This project is dual licensed under the Apache/MIT license.