1 / 11

Counter Braids A Novel Counter Architecture for Per-Flow Measurement (sigmetrics 2008) ‏

Counter Braids A Novel Counter Architecture for Per-Flow Measurement (sigmetrics 2008) ‏. Yi Lu Andrea Montanari Balaji Prabhakar Sarang Dharmapurikar Abdul Kabbani. Measurement in high capacity. A large number of counters.

demi
Télécharger la présentation

Counter Braids A Novel Counter Architecture for Per-Flow Measurement (sigmetrics 2008) ‏

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Counter Braids A Novel Counter Architecture for Per-Flow Measurement (sigmetrics 2008)‏ Yi Lu Andrea Montanari Balaji Prabhakar Sarang Dharmapurikar Abdul Kabbani

  2. Measurement in high capacity • A large number of counters. • A large number of flow to counter association rules are also required. • Need to combine counters in a efficient and a decodable manner.

  3. Counter Braids • Combine counters to build a braid like structure. • Optimum since maximum asymptotic compression rate is achieved. • A low complexity decoder with zero errors.

  4. Example

  5. Execution • Run algorithm in epochs (e.g. of 5 mins). • Packets are counted (not bytes). • Graph is updated dynamically. • At the end of the epoch decoding algorithm is run the to find out the count for each flow.

  6. Solution • Counters arranged in one of more levels. • A small number of hash functions to map flows to level 1 counters. • More hash functions to map between each two layers.

  7. Update algorithm

  8. Message passing decoder

  9. Example

  10. Multiple layers

  11. Optimum solution • 2 layers are usually sufficient. • 3 hash functions is optimum for two layers. • Layer 1 depth should be 5 to 8 bits layer two should be larger. • Status bits are helpful.

More Related