Multipoint Alternate Marking method for passive and hybrid performance monitoring

Similar documents
Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

CS September 2018

Constructive Geometric Constraint Solving

12. Traffic engineering

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Present state Next state Q + M N

1 Introduction to Modulo 7 Arithmetic

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

EE1000 Project 4 Digital Volt Meter

COMP108 Algorithmic Foundations

CS 241 Analysis of Algorithms

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

QUESTIONS BEGIN HERE!

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

Seven-Segment Display Driver

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

Planar Upward Drawings

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Decimals DECIMALS.

d e c b a d c b a d e c b a a c a d c c e b

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Weighted Graphs. Weighted graphs may be either directed or undirected.

QUESTIONS BEGIN HERE!

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

Last time: introduced our first computational model the DFA.

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Garnir Polynomial and their Properties

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

EXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

Designing A Concrete Arch Bridge

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

Computational Biology, Phylogenetic Trees. Consensus methods

Problem solving by search

Register Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?

Construction 11: Book I, Proposition 42

Polygons POLYGONS.

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

CMSC 451: Lecture 2 Graph Basics Thursday, Aug 31, 2017

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

CS 103 BFS Alorithm. Mark Redekopp

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

12 - M G P L Z - M9BW. Port type. Bore size ø12, ø16 20/25/32/40/50/ MPa 10 C to 60 C (With no condensation) 50 to 400 mm/s +1.

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

0.1. Exercise 1: the distances between four points in a graph

Expert System. Knowledge-Based Systems. Page 1. Development of KB Systems. Knowledge base. Expert system = Structured computer program

Aquauno Video 6 Plus Page 1

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

Numbering Boundary Nodes

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

a b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b)

(a) v 1. v a. v i. v s. (b)

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

OpenMx Matrices and Operators

Section 3: Antiderivatives of Formulas

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?

Instructions for Section 1

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm]

Tangram Fractions Overview: Students will analyze standard and nonstandard

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Single Correct Type. cos z + k, then the value of k equals. dx = 2 dz. (a) 1 (b) 0 (c)1 (d) 2 (code-v2t3paq10) l (c) ( l ) x.

Round 7: Graphs (part I)

Organization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs

The Theory of Small Reflections

CS 461, Lecture 17. Today s Outline. Example Run

In which direction do compass needles always align? Why?

CEDAR ISLAND / KEATON BEACH TAYLOR COUNTY, FLORIDA POST-HURRICANE HERMINE EXAMINATION SURVEY FY16 4-FOOT PROJECT

Strongly connected components. Finding strongly-connected components

Transcription:

Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro Sisto (Politnio i Torino)

Motivtions Th Altrnt Mrkin mtho, s prsnt in rt-it-ippm-lt-mrk, sms to pplil only to point-to-point lows, ut this is not tru! Now th i is to nrliz n xpn this mthooloy to msur ny kin o unist lows: th thniqu hr sri is ll Multipoint Altrnt Mrkin. Thr r som pplitions o th ltrnt mrkin mtho whr thr r lot o monitor lows n nos...: or n msurmnt points n n monitor lows, th orr o mnitu o th pkt ountrs or h tim intrvl is n*n*2. Multipoint Altrnt Mrkin mks th prormn monitorin mor lxil

Flow lssiition (1/2) An IP monitor low is intii y ll th pkts hvin st o ommon hrtristis: pkt sltion ruls, tht oprt on th so ll «Intiition Fils» (IFs) o th pkt hr. IP sour, IP stintion, Trnsport Protool, Sour Port, Dstintion Port n DiSrv il To rt th lows to monitor with ltrnt mrkin, w n uil sltion ruls with sust o IFs intii y st o vlus, rn o vlus, it msks n so on. Multipoint Altrnt Mrkin nls th prormn monitorin o multipoint lows slt y intiition ils without ny onstrint multipl mrkin points n multipl xit points n onsir or th sm monitor low. vn th ntir ntwork proution tri n onsir s sinl monitor low.

Flow lssiition (2/2) Point to Multipoint: 1 100 20 1 Multipoint to Point: 170 220 220 Multipoint to Multipoint: 20 1 170 160 60 Point to Point: 40 10 Pont to Point sinl pth:

How Multipoint Altrnt Mrkin oprts Th Monitorin Ntwork must uilt rom th mor omplx Proution Ntwork: Th nos o th rph, rprsntin monitor low, r th msurmnt points n th links r onntions twn msurmnt points. Th numrs o pkts r rrr only to mrkin prio o th monitor low. Input msurmnt point h Output msurmnt point Intrmit msurmnt point i j

Ntwork Pkt Loss (1 low, 1 prio) Pkt Loss Proprty (unist pkts): «In pkt ntwork, th numr o lost pkts is th numr o input pkts minus th numr o output pkts». Monitor Ntwork Pkt Loss with n input nos n m output nos (multipoint low): PL = Σi=1,n IPi - Σj=1,m OPj PL: Ntwork Pkt Loss (numr o lost pkts) IPi: Numr o pkts low throuh th i-th Input no in this prio OPj: Numr o pkts low throuh th j-th Output no in this prio PL = [330-(40+10+++30)] = 0 40 Input msurmnt point Output msurmnt point 330 100 10 h i Intrmit msurmnt point 330 Numr o pkts o low in prio NB: It works i thr is no loop in th ntwork j 30

Clustrs How w n loliz th losss: th monitorin ntwork n split in th smllst suntworks, mintinin th pkt loss proprty or h suntwork. Ths suntworks r ll Clustrs. In our monitorin ntwork xmpl w hv 4 lustrs: Input msurmnt point 330 Clustr1 100 j 30 100 Clustr2 i Clustr3 40 10 Output msurmnt point Clustr4 h W hv lustrs with mor thn 2 nos n two-nos lustrs: In th two-nos lustrs th loss is on th link (Clustr 4). In mor-thn-2-nos lustrs th loss is on th lustr ut w nnot know in whih link (Clustr 1, 2, 3).

Ntwork Mn Dly on-wy (1 low, 1 prio) Mn ly n jittr msurmnts n lso nrliz to th s o multipoint lows. It is possil to omput th mn on-wy ly o pkts in lustr or in th ntir monitor ntwork. Th mn ly n msur s th irn twn th wiht vrs o th vr timstmps o th sts o output n input nos in synhroniz ntwork. Σi=1,m (OATi * OPi) Σj=1,n (IATj * IPj) ADow = --------------------------- - --------------------------- Σi=1,m OPi Σj=1,n IPj ADow: Monitor Ntwork Avr Dly on-wy OATi: Avr Timstmp o th i-th Output no IATj: Avr Timstmp o th j-th Input no OPi: Numr o pkts low throuh th i-th Output no IPj: Numr o pkts low throuh th j-th Input no

Summry n Nxt Stps This oumnt s nw point o viw to th ltrnt mrkin mtho: A Controllr n lirt Prormn Msurmnts. It n strt with th ntir Ntwork; In s o nssity, th iltrin ritri oul spii mor in orr to prorm Clustr or point-to-point low til nlysis. S lso rt-mizrhi-ippm-multiplx-ltrnt-mrkin or mrkin mthos strnths n wknsss Nxt Vrsion: Mor tils on Clustr lorithm will. Mor tils on Dly Msurmnt or th Multipoint Monitorin. Inputs n Commnts lwys wlom