Pingin' II : Now we're Analyzin' Aaron Schulman - PowerPoint PPT Presentation

Sep 16, 2023 •448 likes •568 views

Pingin' II : Now we're Analyzin' Aaron Schulman Youndo Lee Ramakrishna Padmanabhan Neil Spring University of Maryland Problem How do we reduce pings from (to) many vantage points to a responsiveness state? UP DOWN

Pingin' II : Now we're Analyzin' Aaron Schulman Youndo Lee Ramakrishna Padmanabhan Neil Spring University of Maryland
Problem How do we reduce pings from (to) many vantage points to a responsiveness state? UP DOWN HOSED
Loss rate in a window is too noisy
New way to determine res. link state 1. Find anchor points [all vantage points agree UP or DOWN] 2. Grow out from the anchor point (Lex & Yacc) 3. HOSED is whatever remains
Anchor points 120 10 vantage points 100 80 RTT (ms) 60 40 20 0 0 2 4 6 8 10 time (hour)
1.0 0.9 0.8 0.7 0.6 CDF 0.5 0.4 Red - Verizon Fios Blue - Verizon DSL 0.3 Green - Comcast Cable 0.2 0.1 0.0 1 minute� 3 5 10 25 1 hour 3 5 7 9 1 day 2 3 4 5 6 Hosed duration
11 19 Dec 2011 10 9 8 7 Destinations 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 Time

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Over ervie iew w of Private e Ser ervice ice in NC, NC, Analyzin ing g Per Perform

Over ervie iew w of Private e Ser ervice ice in NC, NC, Analyzin ing g Per Perform rmance nce via AOC Da C Data, & Fi Financi cial al Impacts s on N.C. C. Landl dlords ds Present ented ed For the e Comm mmitt ittee

392 views • 20 slides

Correc recti tive ve Action n Requests uests (CARs) s) Major r nonconform conformity:

Instr structi uction on for Writing ng and Analyzin zing Correc recti tive ve Action n Requests uests (CARs) s) Major r nonconform conformity: ity: A major jor nonc onconfo nform rmit ity is one ne or more ore of: f: a. a.

501 views • 24 slides

Compiling Techniques Samson Abramsky samson@dcs 1 2 Why study compilers? Coursework To

See http://www.cs.princeton.edu/faculty/appel/modern for full details of those terms and Computer Science 3 conditions with respect to limitations on their use and dissemination. Compiling Techniques Samson Abramsky samson@dcs 1 2 Why study

376 views • 21 slides

Declarative Disambiguation of Deep Priority Conflicts Eduardo Souza, Timothee Haudebourg, Michael

Declarative Disambiguation of Deep Priority Conflicts Eduardo Souza, Timothee Haudebourg, Michael Steindorfer, Eelco Visser WG2.11 Kyoto June 4, 2018 Python Expression Syntax star_expr: '*' expr expr: xor_expr ('|' xor_expr)* xor_expr:

982 views • 42 slides

(3) Properties of Context-Free

(3) Properties of Context-Free Languages (3) kazim@fouladi.ir

533 views • 26 slides

Symbol Tables ASU Textbook Chapter 7.6, 6.5 and 6.3 Tsan-sheng Hsu tshsu@iis.sinica.edu.tw

Symbol Tables ASU Textbook Chapter 7.6, 6.5 and 6.3 Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Definitions Symbol table: A data structure used by a compiler to keep track of semantics of variables. Data

459 views • 26 slides

= 6 13 14 15 16 17 18 19 20 1 / 12 Expected Value Definition: The expected value of a

Hashing Todays announcements: PA2 out, due Nov 1, 23:59 MT2 Nov 7, 19:00-21:00 WOOD 2 Todays Plan 0 1 Hashing 2 3 Universal hash functions 4 5 6 12345 7 8 9 10 11 12 = 6 13 14 15 16 17 18 19 20 1 / 12

492 views • 12 slides

Principles of Compiler Design - The Brainf*ck Compiler - Clifford Wolf - www.clifford.at

Principles of Compiler Design - The Brainf*ck Compiler - Clifford Wolf - www.clifford.at http://www.clifford.at/papers/2004/compiler/ Clifford Wolf, December 22, 2004 http://www.clifford.at/papers/2004/compiler/ p. 1/56 Introduction

847 views • 56 slides

Uncovering Hidden Loop Level Parallelism in Sequential Applications Hongtao Zhong, Mojtaba

Uncovering Hidden Loop Level Parallelism in Sequential Applications Hongtao Zhong, Mojtaba Mehrara, Steve Lieberman, Scott Mahlke Advanced Computer Architecture Lab. University of Michigan University of Michigan 1 Electrical Engineering and

685 views • 56 slides

#Influence in an attention economy Influence Noun invisible or insensible action exerted by

#Influence in an attention economy Influence Noun invisible or insensible action exerted by one thing or person on another, especially by people in power Verb to modify, affect, or sway (Macquarie Dictionary, 6 th edition, 2013) The

362 views • 21 slides

Abstract A good design is critical for success with agile development. That does not mean a big up

TOWARDS AN EVOLUTIONARY DESIGN Abstract A good design is critical for success with agile development. That does not mean a big up front design. The design has to be evolutionary. However, the design you evolve must be extensible and

412 views • 23 slides

* n

* n !"#!

290 views • 3 slides

2 3

274 views • 3 slides

Overview of Scanner Invariant Representations: Moyer et al. 2020, Magn. Reson. Med. Daniel Moyer ,

Overview of Scanner Invariant Representations: Moyer et al. 2020, Magn. Reson. Med. Daniel Moyer , Greg ver Steeg, Paul M Thompson MIDL 2020 USC ISI / MIT CSAIL The Scanner Problem Multi-site analyses have varying site signals. Site signals

294 views • 6 slides

Satisfiability Modulo Theories and Z3 Nikolaj Bjrner Microsoft Research ReRISE Winter School,

Satisfiability Modulo Theories and Z3 Nikolaj Bjrner Microsoft Research ReRISE Winter School, Linz, Austria February 3, 2014 SMT : Basic Architecture Theory SAT SMT Solvers Equality + UF Arithmetic Case Analysis Bit-vectors Nikolaj is

681 views • 55 slides

Using SMT solvers for binary analysis and exploitation A primer on SMT, SMT solvers, Z3 & angr

Using SMT solvers for binary analysis and exploitation A primer on SMT, SMT solvers, Z3 & angr Carl Svensson August 29, 2018 Nixucon 2018 About me Carl Svensson, 27 MSc in Computer Science, KTH Head of Security, KRY/LIVI

638 views • 49 slides

Better SMT Proofs for Easier Reconstruction AITP 2019, Obergurgl Austria Haniel Barbosa,

Better SMT Proofs for Easier Reconstruction AITP 2019, Obergurgl Austria Haniel Barbosa, Jasmin Christian Blanchette, Mathias Fleury, Pascal Fontaine, Hans-Jrg Schurr April 10, 2019 An Adventure N An Adventure N A An

619 views • 37 slides

Section 4: Maps between groups Matthew Macauley Department of Mathematical Sciences Clemson

Section 4: Maps between groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Section 4: Maps between groups Math 4120, Modern

899 views • 51 slides

Another family of Steiner triple systems without almost parallel classes Daniel Horsley (Monash

Another family of Steiner triple systems without almost parallel classes Daniel Horsley (Monash University) Joint work with Darryn Bryant (University of Queensland) Steiner triple systems Steiner triple systems Steiner triple systems Steiner

1.16k views • 86 slides

Learning Discrete and Continuous Factors of Data via Alternating Disentanglement Yeonwoo Jeong,

Learning Discrete and Continuous Factors of Data via Alternating Disentanglement Yeonwoo Jeong, Hyun Oh Song Seoul National University ICML19 1 Motivation Shape? square Postion x? 0.3 Our goal is to disentangle the underlying

999 views • 87 slides

Discrete parafermions and quantum-group symmetries Yacine Ikhlef LPTHE (CNRS/Paris-6) joint

Discrete parafermions and quantum-group symmetries Yacine Ikhlef LPTHE (CNRS/Paris-6) joint work with R. Weston (Edinburgh), M. Wheeler (Melbourne), P. Zinn-Justin (LPTHE). Florence, 13/05/2015 Outline 1. Introduction 2. The

320 views • 27 slides

Reusing Constraint Proofs in Program Analysis Andrea Aquino , Francesco A. Bianchi ,

Reusing Constraint Proofs in Program Analysis Andrea Aquino , Francesco A. Bianchi , Meixian Chen , Giovanni Denaro + , Mauro Pezz ,+ Universit della Svizzera italiana (USI), + University of Milano-Bicocca, Switzerland

882 views • 44 slides

EM & Hidden Markov Models CMSC 691 UMBC Recap from last time Expectation Maximization

EM & Hidden Markov Models CMSC 691 UMBC Recap from last time Expectation Maximization (EM) 0. Assume some value for your parameters Two step, iterative algorithm 1. E-step: count under uncertainty, assuming these parameters 2. M-step:

1.72k views • 111 slides

An Introduction to Z3 Huixing Fang National Trusted Embedded Software Engineering Technology

An Introduction to Z3 Huixing Fang National Trusted Embedded Software Engineering Technology Research Center April 12, 2017 . . . . . .. . . . . . . .. . . . . . . .. . . . . . . .. . . .. . . . . . Outline SMT 1 Z3 2 . .

617 views • 32 slides