1 / 10

Content-Aware Device Benchmarking Methodology/Terminology

This document discusses the methodology and terminology for benchmarking content-aware devices. It includes steps for defining the traffic mix and incorporates an algorithm for generating malformed traffic. Resolution of questions regarding traffic composition and defining protocols within the mix is also covered.

degarmo
Download Presentation

Content-Aware Device Benchmarking Methodology/Terminology

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. BMWG Meeting IETF-83 Paris March 2012 Mike Hamilton mhamilton@breakingpoint.com BreakingPoint Systems Content-Aware Device Benchmarking Methodology/Terminology(draft-ietf-bmwg-ca-bench-meth-01)

  2. Previous TODO List(Taipei) • Further define the traffic mix (progress) • Finalize Markov algorithm(progress) • Incorporate ISIC as malformed traffic(done)

  3. Malformed Traffic Algorithm

  4. Malformed Traffic Algorithm

  5. Malformed Traffic Algorithm while(more_packets){ if(random() <= total_malformed_percent){ for each (header){ if(random() <= bad_header_precent){ header_value = random() & header_length } } send_packet(); } else{next;} }

  6. List Resolved Questions • Traffic Composition • How to define a single protocol within the mix • Algorithmically • Malformed traffic • How to define • Open-source TCP/IP/UDP(sic) • Comments from (before) IETF 82

  7. Markov-Pseudo Code(Brian Kernighan/Rob Pike) $MAXGEN = 10000; $NONWORD = "\n"; $w1 = $w2 = $NONWORD; # initial state open FILE, "<", "corpus.txt"; while (<FILE>) { # read each line of input foreach (split) { push(@{$statetab{$w1}{$w2}}, $_); ($w1, $w2) = ($w2, $_); # multiple assignment } } push(@{$statetab{$w1}{$w2}}, $NONWORD); # add tail $w1 = $w2 = $NONWORD; for ($i = 0; $i < $MAXGEN; $i++) { $suf = $statetab{$w1}{$w2}; # array reference $r = int(rand @$suf); # @$suf is number of elems exit if (($t = $suf->[$r]) eq $NONWORD); print "$t "; ($w1, $w2) = ($w2, $t); # advance chain }

  8. IETF #74 - NETCONF WG session Markov HTML

  9. IETF #74 - NETCONF WG session Markov Email

  10. Next Steps • Work left to do • Further define the traffic mix specification • Finalize algorithm for application traffic generation

More Related