Download presentation
Presentation is loading. Please wait.
Published byRosanna Reed Modified over 9 years ago
1
1 Content-Aware Device Benchmarking Methodology/Terminology (draft-ietf-bmwg-ca-bench-meth-01) BMWG Meeting IETF-83 Paris March 2012 Mike Hamilton mhamilton@breakingpoint.com BreakingPoint Systems
2
2 Previous TODO List(Taipei) Further define the traffic mix (progress) Finalize Markov algorithm(progress) Incorporate ISIC as malformed traffic(done)
3
3 Malformed Traffic Algorithm
4
4
5
5 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
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
7 Markov-Pseudo Code (Brian Kernighan/Rob Pike) $MAXGEN = 10000; $NONWORD = "\n"; $w1 = $w2 = $NONWORD; # initial state open FILE, "<", "corpus.txt"; while ( ) { # 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
Markov HTML IETF #74 - NETCONF WG session 8
9
Markov Email IETF #74 - NETCONF WG session 9
10
10 Next Steps Work left to do Further define the traffic mix specification Finalize algorithm for application traffic generation
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.