improving accuracy in end to end packet loss measurement
play

Improving Accuracy in End-to-end Packet Loss Measurement * Joel - PowerPoint PPT Presentation

Improving Accuracy in End-to-end Packet Loss Measurement * Joel Sommers, Paul Barford, Nick Duffield, Amos Ron University of Wisconsin-Madison * AT&T Labs-Research Background Understanding its basic characteristics is important


  1. Improving Accuracy in End-to-end Packet Loss Measurement * Joel Sommers, Paul Barford, Nick Duffield, Amos Ron University of Wisconsin-Madison * AT&T Labs-Research

  2. Background • Understanding its basic characteristics is important • Transport protocol design, throughput modeling, overlay monitoring and optimization • Standard ways to measure packet loss • Passive (SNMP , tcpdump) • Active (ping, Poisson modulated probes) 2

  3. Loss characteristics of interest mean loss episode loss episode frequency duration: (fraction of time queue is congested): ((b-a) + (d-c)) / T ((b-a) + (d-c)) / 2 buffer capacity NB: Packets are still transmitted during congestion periods Q queue length a b c d T time 3

  4. Focus of our study • How well does traditional Poisson sampling work? • What are its limitations? What can be done better? • Design new sampling process • Theory and heuristics • Controlled laboratory evaluation • Compare with Poisson sampling 4

  5. How well does traditional Poisson sampling work? 0.10 • Evaluate frequency and duration 0.08 queue length (seconds) 0.06 estimates 0.04 0.02 CBR • Controlled laboratory setting 0.00 30 32 34 36 38 40 time (seconds) 0.10 • Three kinds of cross traffic 0.08 queue length (seconds) 0.06 0.04 • Probe rates and packet sizes as 0.02 Infinite TCP 0.00 [ZPDS01] 10 12 14 16 18 20 time (seconds) 0.10 • Experiment duration (15 min) 0.08 queue length (seconds) 0.06 should allow frequency estimates 0.04 to be close to true frequency 0.02 Web-like, self-similar 0.00 34 36 38 40 42 44 time (seconds) 5

  6. Evaluation of traditional Poisson sampling • CBR frequency duration (sec) • Frequency estimate off by 40% Duration estimate off by 85% true 0.0093 0.136 values • Infinite TCP Poisson 0.0014 0.000 (10 Hz) • Very poor frequency estimates Duration estimates are 0 Poisson 0.0012 0.022 (20 Hz) • Web-like (table to right) 6

  7. Lessons and hypotheses • Poisson sampling is relatively ineffective for estimating congestion frequency and duration ➡ use multi-packet probes • Single packet probes often do not experience loss episodes ➡ use loss and delay correlation heuristics ➡ create sampling process to improve duration estimates 7

  8. Multi-packet probes 0.1010 0.1000 0.0990 cross traffic packet ● cross traffic loss • Single packet miss 0.0980 probe probe loss 11.10 11.12 11.14 11.16 11.18 11.20 congestion episodes 0.1010 0.1000 • Probes with a few 0.0990 packets are more likely to cross traffic packet ● see congestion episodes cross traffic loss 0.0980 probe probe loss 15.20 15.22 15.24 15.26 15.28 15.30 • Too many probes distort 0.1010 measurements 0.1000 0.0990 cross traffic packet ● cross traffic loss 0.0980 probe probe loss 14.80 14.82 14.84 14.86 14.88 14.90 8 time (seconds)

  9. Probe process model • At the sender • Send two multi-packet (3) probes in succession, initiated with probability r at discrete time slot i • Individual probe gives instantaneous measure of congestion • Probe pairs used to determine congestion dynamics • At the receiver • Record time slots as congested (1) or uncongested (0), using actual packet loss and one-way delay heuristics • y i records congestion as two-digit binary number • Yi denotes true congestion along the path 9

  10. Key assumptions • Assume probes don’t lie ... usually • If there is truly congestion ( Y i ), the probes see the effect • If y i is incorrect, assume it is a false negative ( y i = 00) • y i equals Y i with probability p k , which is independent of i and depends only on the number k of 1-digits in Y i • For basic algorithm, assume • p {01,10} = p {11} for consistent estimation of duration • p {01,10} = p {11} = 1 for consistent and unbiased frequency estimation 10

  11. One-way delay and congestion heuristics • Improve single probe measurement of congestion • Probes within τ seconds of true loss ⇒ congestion • Probes with OWD ≥ (1- α ) OWDmax ⇒ congestion • Observations from sensitivity experiments • Relationship between larger parameter value and more congestion inferred • Tradeoff between probe rate and parameter settings 11

  12. New probe model example y i 00 1111 0000 00 0111 00 00 time → time → Red line denotes Green areas α OWD denote τ loss threshold proximity heuristic heuristic 12

  13. Estimating congestion frequency � ˆ F = z i /M i • z i is a random variable whose value is the first digit of y i • M is the total number of probe pairs • Estimator is unbiased, and under mild conditions, consistent 13

  14. Estimating congestion duration (1) • Assume we have knowledge of the path at all possible time slots in our discretization • For k =1,2,..., there were exactly j k congestion episodes of length k • Congestion occurred over total of A time slots, A = ∑ kj k • Total number of congestion episodes is B = ∑ j k • Average duration D of a congestion episode is therefore D := A/B 14

  15. Estimating congestion duration (2) Note that there are B time slots i for which Y i = 01, and also B time slots i for which Y i = 10 Note also that there are exactly A+B time slots i for which Y i ≠ 00 Define R:=#{i:y i ∈ {01,10,11}} and S:=#{i:y i ∈ {01,10}} We arrive at E ( R ) / E ( S ) = p 2 ( A − B ) + 2 p 1 B E ( R ) / E ( S ) = p 2 ( A − B ) + 2 p 1 B 2 p 1 B 2 p 1 B Assuming p {01,10} = p {11} , the estimator for the mean congestion duration is therefore D := 2 × R ˆ S − 1 15

  16. Validation of output • Monitor results in real-time to check whether assumptions have been violated and to increase confidence in results • Probability of y i = 01 is assumed to be same as y i = 10 — monitor these rates of occurrence • p {01,10} = p {11} for consistent estimation of duration • p {01,10} = p {11} = 1 for consistent and unbiased frequency estimation 16

  17. Laboratory results summary • Implemented new sampling model in a tool called badabing • Experiments in a controlled testbed using a range of probe rates and range of thresholds for inferring congestion • Estimates are often within 25% of actual congestion frequency and duration values; many within 10% • A significant improvement over traditional Poisson sampling for both frequency and duration estimation 17

  18. badabing evaluation (CBR, single episode type) loss frequency loss duration r true badabing true badabing 0.1 0.0069 0.0016 0.068 0.054 0.3 0.0069 0.0065 0.068 0.073 0.5 0.0069 0.0060 0.068 0.051 0.7 0.0069 0.0070 0.068 0.051 0.9 0.0069 0.0078 0.068 0.053 18

  19. badabing evaluation (web-like, self-similar traffic) loss frequency loss duration r true badabing true badabing 0.1 0.0044 0.0017 0.060 0.071 0.3 0.0011 0.0011 0.113 0.143 0.5 0.0114 0.0117 0.079 0.074 0.7 0.0043 0.0039 0.071 0.076 0.9 0.0031 0.0038 0.073 0.062 19

  20. Comparing badabing with Poisson probes • With same probe stream rate for Poisson and badabing • Constant bit rate cross traffic • Both frequency and duration estimates are within 7% for badabing; Frequency estimate off by 40% and duration estimate off by 85% for Poisson • Web-like cross traffic • Badabing correctly estimates frequency and duration estimate is within 25%; Each estimate derived from Poisson-modulated probes is at least 80% off 20

  21. Summary • Simple Poisson sampling is relatively ineffective for measuring congestion frequency and duration • Badabing provides more accurate estimation of congestion frequency and duration • Estimator performance depends only on total number of probes sent, not on sending rate • Simple validation methods for measurement output • Accuracy improvements (and basic assumptions) validated in a laboratory testbed 21

  22. the end http://wail.cs.wisc.edu/

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


More recommend