1 Content-Aware Device Benchmarking Methodology/Terminology (draft-ietf-bmwg-ca-bench-meth-01) BMWG Meeting IETF-83 Paris March 2012 Mike Hamilton

Slides:



Advertisements
Similar presentations
Basic BGP Data Plane Convergence Benchmarking -Rajiv Papneja - Mohan Nanduri -Bhavani Parise - Eric Brendel -Susan Hares - Jay Karthik.
Advertisements

1 Content-Aware Device Benchmarking Methodology/Terminology (draft-hamilton-bmwg-ca-bench-meth-06) (draft-hamilton-bmwg-ca-bench-term-00) BMWG Meeting.
1. What number does the following array represent?
1 Benchmarking Methodology WG (bmwg) 84th IETF Thursday, August 2, 2012 (1730 Vancouver Local Time, GMT-7:00) Chairs: –Al Morton If.
ClassBench: A Packet Classification Benchmark
Markov Chain Algorithm in Perl Yu-Chung Chau CS 265.
MyBeats Michael Smith. Integration Plans Entry Criteria Integration and Testing Error Documentation and Resolution Exit Criteria.
Long-term Archive Service Requirements draft-ietf-ltans-reqs-00.txt.
1 Lab Session-III CSIT-120 Fall 2000 Revising Previous session Data input and output While loop Exercise Limits and Bounds Session III-B (starts on slide.
Revolutionizing the Field of Grey-box Attack Surface Testing with Evolutionary Fuzzing Department of Computer Science & Engineering College of Engineering.
1 Benchmarking Methodology WG (bmwg) 80th IETF Tuesday, March 29, 2011, CDT (Central Europe Daylight Time, GMT+2:00) Chairs: –Al Morton
1 Proposal for BENCHMARKING SIP NETWORKING DEVICES draft-poretsky-sip-bench-term-01.txt draft-poretsky-sip-bench-meth-00.txt Co-authors are Scott Poretsky.
CSE 143 Lecture 11 Maps Grammars slides created by Alyssa Harding
More Algorithm Design CSIS 1595: Fundamentals of Programming and Problem Solving 1.
0 eCPIC User Training: Dependency Mapper These training materials are owned by the Federal Government. They can be used or modified only by FESCOM member.
1 Content-Aware Device Benchmarking Methodology/Terminology (draft-ietf-bmwg-ca-bench-meth-00) BMWG Meeting IETF-82 Taipei November 2011 Mike Hamilton.
Operating Systems Session 1. Contact details TA: Alexander(Sasha) Apartsin ◦ ◦ Office hours: TA: Sasha Alperovich.
Start Typical student project Advanced student project Level of final response.
Robbie CSCI2100A Data Structures Tutorial
Hiroyasu Kimura, Yoshifumi Atarashi, and Hidemitsu Higuchi
1 Project 5: Printing Address Labels. 2 Assignment Write a Windows forms program to display and print a set of address labels. Input from a csv file.
IETF 69 SIPPING WG Meeting Mohammad Vakil Microsoft An Extension to Session Initiation Protocol (SIP) Events for Pausing and Resuming.
1 Content-Aware Device Benchmarking Methodology (draft-hamilton-bmwg-ca-bench-meth-04) BMWG Meeting Maastricht July 2010 Mike Hamilton
Abierman-netconf-mar07 1 NETCONF WG 68 th IETF Prague, CZ March 19, 2007.
26Jul BGP Data-Plane Benchmarking Applicable to Modern Routers Rajiv Papneja Ilya Varlashkin Bhavani Parise Dean Lee Sue Hares.
By: Robert Apeldorn.  Generate statistical random texts that can be read well  Allow for the output texts to be created quickly regardless the size.
July 28, 2010IETF 78 – Maastricht, Netherlands1 IP Multicast Performance Monitoring: update on IPPM experience Vero Zheng Alberto Tempia Bonda.
May 16, 2005Chair, IEEE May 16, 2005Chair, IEEE Next Steps & Action Items from March 2005 Plenary Status Review - - May 2005 Interim.
Magic NPR Muse 2004 Regional Peer Group Herb Bromenshenkel RPh.
Multiplication with Arrays and Boxes – A Visual Model.
CS1101: Programming Methodology Preparing for Practical Exam (PE)
Programming Fundamentals I Java Programming Spring 2009 Instructor: Xuan Tung Hoang TA: Tran Minh Trung Lab 03.
1 Lecture 5 Post-Graduate Students Advanced Programming (Introduction to MATLAB) Code: ENG 505 Dr. Basheer M. Nasef Computers & Systems Dept.
By: Jordan Hofstaedter. Make random outputs from inputs that actually make sense. If we let the computer produce random letters in English, chances are.
CPSC 871 John D. McGregor Module 8 Session 3 Assignment.
Computer Programming for Biologists Class 4 Nov 14 th, 2014 Karsten Hokamp
Markov Chain Algorithm in Perl Michael Conway CS 265 May 4, 2011.
Reading comprehension exercise using PowerPoint. Question Slides 1.Start a new PowerPoint presentation with 4 slides on it. 2.On Slides 2, insert the.
RTP Usage for CLUE draft-lennox-clue-rtp-usage-02 Clue WG, IETF 83, 27 March 2012 Jonathan Lennox Allyn Romanow
1 Content-Aware Device Benchmarking Methodology (draft-hamilton-bmwg-ca-bench-meth-05) BMWG Meeting IETF-79 Beijing November 2010 Mike Hamilton
Functions Commands Programming Steps Examples Printing Homework Hints.
DPACC Metadata Update Discussion Lingli Deng 2016/05/05.
Class05 How to get data from a form MIS 3501, Fall 2015 Brad N Greenwood, PhD MBA Department of MIS Fox School of Business Temple University 9/8/2015.
Wednesday NI Vision Sessions
Draft-fm-bess-service-chaining-01 Prague, July 2015 Rex Fernando Stuart Mackie Dhananjaya Rao Bruno Rijsman Maria Napierala.
CSS Colors, JavaScript Variables, Conditionals and Basic Methods
Authors: Scott Poretsky, Quarry Technologies Brent Imhoff, LightCore
Benchmarking Framework
Voucher and Voucher Revocation Profiles for Bootstrapping Protocols draft-kwatsen-netconf-voucher-00 NETCONF WG IETF 97 (Seoul)
PRG 410 Competitive Success-- snaptutorial.com
PRG 410 Education for Service-- snaptutorial.com
PRG 410 Teaching Effectively-- snaptutorial.com
IEEE IETF Liaison Report
Standards Break Out Session
Design and Implementation*
Distributed Data Collection
Markov-Chain Algorithm In Perl
IEEE IETF Liaison Report
Bug Report Part 3.
Mixed Up Multiplication Challenge
Mixed Numbers – Adding – Four in a Row
Mixed Numbers – Adding & Subtracting – Spot the Mistake
Directed Numbers – Multiplying & Dividing – Gridz
Mixed Numbers – Dividing – Spot the Mistake
Mixed Numbers – Subtracting – Spot the Mistake
Directed Numbers – Adding – Pyramids
Surds – Adding & Subtracting – Pyramids
Mixed Numbers – Multiplying & Dividing – Spot the Mistake
Mixed Numbers – Adding – Spot the Mistake
Presentation transcript:

1 Content-Aware Device Benchmarking Methodology/Terminology (draft-ietf-bmwg-ca-bench-meth-01) BMWG Meeting IETF-83 Paris March 2012 Mike Hamilton BreakingPoint Systems

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

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 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 ( ) { # read each line of input foreach (split) { $_); ($w1, $w2) = ($w2, $_);# multiple assignment } $NONWORD); # add tail $w1 = $w2 = $NONWORD; for ($i = 0; $i < $MAXGEN; $i++) { $suf = $statetab{$w1}{$w2};# array reference $r is number of elems exit if (($t = $suf->[$r]) eq $NONWORD); print "$t "; ($w1, $w2) = ($w2, $t);# advance chain }

Markov HTML IETF #74 - NETCONF WG session 8

Markov IETF #74 - NETCONF WG session 9

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