1 Why is the Internet traffic bursty in short time scales? Constantine Dovrolis Hao Jiang College of Computing Georgia Institute of Technology.

Slides:



Advertisements
Similar presentations
Internet Measurement Conference 2003 Source-Level IP Packet Bursts: Causes and Effects Hao Jiang Constantinos Dovrolis (hjiang,
Advertisements

Connection-level Analysis and Modeling of Network Traffic understanding the cause of bursts control and improve performance detect changes of network state.
Bandwidth Estimation Workshop 2003 Evaluating pathrate and pathload with realistic cross-traffic Ravi Prasad Manish Jain Constantinos Dovrolis (ravi, jain,
Flowlet Switching Srikanth Kandula Shan Sinha & Dina Katabi.
Network and Service Assurance Laboratory Analysis of self-similar Traffic Using Multiplexer & Demultiplexer Loaded with Heterogeneous ON/OFF Sources Huai.
Ahmed Mansy, Mostafa Ammar (Georgia Tech) Bill Ver Steeg (Cisco)
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput Manish Jain Constantinos Dovrolis SIGCOMM 2002 Presented.
Fair queueing and congestion control Jim Roberts (France Telecom) Joint work with Jordan Augé Workshop on Congestion Control Hamilton Institute, Sept 2005.
An Empirical Study of Real Audio Traffic A. Mena and J. Heidemann USC/Information Sciences Institute In Proceedings of IEEE Infocom Tel-Aviv, Israel March.
CapProbe: A Simple and Accurate Capacity Estimation Technique Kapoor et al., SIGCOMM ‘04.
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
CMPT 855Module Network Traffic Self-Similarity Carey Williamson Department of Computer Science University of Saskatchewan.
1 Modeling and Emulation of Internet Paths Pramod Sanaga, Jonathon Duerig, Robert Ricci, Jay Lepreau University of Utah.
Dynamic Internet Congestion with Bursts Stefan Schmid Roger Wattenhofer Distributed Computing Group, ETH Zurich 13th International Conference On High Performance.
On the Self-Similar Nature of Ethernet Traffic - Leland, et. Al Presented by Sumitra Ganesh.
Modeling TCP Throughput Jeng Lung WebTP Meeting 11/1/99.
1 Is the Round-trip Time Correlated with the Number of Packets in Flight? Saad Biaz, Auburn University Nitin H. Vaidya, University of Illinois at Urbana-Champaign.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
Sizing Router Buffers Nick McKeown Guido Appenzeller & Isaac Keslassy SNRC Review May 27 th, 2004.
Available bandwidth measurement as simple as running wget D. Antoniades, M. Athanatos, A. Papadogiannakis, P. Markatos Institute of Computer Science (ICS),
A Nonstationary Poisson View of Internet Traffic T. Karagiannis, M. Molle, M. Faloutsos University of California, Riverside A. Broido University of California,
Modeling TCP in Small-Buffer Networks
Self-Similarity in Network Traffic Kevin Henkener 5/29/2002.
1 End-to-End Detection of Shared Bottlenecks Sridhar Machiraju and Weidong Cui Sahara Winter Retreat 2003.
Variance of Aggregated Web Traffic Robert Morris MIT Laboratory for Computer Science IEEE INFOCOM 2000’
Origins of Long Range Dependence Myths and Legends Aleksandar Kuzmanovic 01/08/2001.
Estimating Congestion in TCP Traffic Stephan Bohacek and Boris Rozovskii University of Southern California Objective: Develop stochastic model of TCP Necessary.
Self-Similar through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level Walter Willinger, Murad S. Taqqu, Robert Sherman,
Junxian Huang 1 Feng Qian 2 Yihua Guo 1 Yuanyuan Zhou 1 Qiang Xu 1 Z. Morley Mao 1 Subhabrata Sen 2 Oliver Spatscheck 2 1 University of Michigan 2 AT&T.
End-to-End Estimation of Available Bandwidth Variation Range Constantine Dovrolis Joint work with Manish Jain & Ravi Prasad College of Computing Georgia.
Self-Similarity of Network Traffic Presented by Wei Lu Supervised by Niclas Meier 05/
1 Chapters 9 Self-SimilarTraffic. Chapter 9 – Self-Similar Traffic 2 Introduction- Motivation Validity of the queuing models we have studied depends on.
References for M/G/1 Input Process
Open Issues in Buffer Sizing Amogh Dhamdhere Constantine Dovrolis College of Computing Georgia Tech.
Alok Shriram and Jasleen Kaur Presented by Moonyoung Chung Empirical Evaluation of Techniques for Measuring Available Bandwidth.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Measurement and Modeling of Packet Loss in the Internet Maya Yajnik.
Hung X. Nguyen and Matthew Roughan The University of Adelaide, Australia SAIL: Statistically Accurate Internet Loss Measurements.
1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
CS551: End-to-End Packet Dynamics Paxon’99 Christos Papadopoulos (
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
Opportunistic Traffic Scheduling Over Multiple Network Path Coskun Cetinkaya and Edward Knightly.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Bandwidth Estimation Workshop 2003 Evaluating pathrate and pathload with realistic cross-traffic Ravi Prasad Manish Jain Constantinos Dovrolis (ravi, jain,
Self-generated Self-similar Traffic Péter Hága Péter Pollner Gábor Simon István Csabai Gábor Vattay.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
Burst Metric In packet-based networks Initial Considerations for IPPM burst metric Tuesday, March 21, 2006.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
Computer Networking Lecture 18 – More TCP & Congestion Control.
1 SIGCOMM ’ 03 Low-Rate TCP-Targeted Denial of Service Attacks A. Kuzmanovic and E. W. Knightly Rice University Reviewed by Haoyu Song 9/25/2003.
Analysis of RED Goal: impact of RED on loss and delay of bursty (TCP) and less bursty or smooth (UDP) traffic RED eliminates loss bias against bursty traffic.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Performance Limitations of ADSL Users: A Case Study Matti Siekkinen, University of Oslo Denis Collange, France Télécom R&D Guillaume Urvoy-Keller, Ernst.
Notices of the AMS, September Internet traffic Standard Poisson models don’t capture long-range correlations. Poisson Measured “bursty” on all time.
1 Stochastic Ordering for Internet Congestion Control Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, and Lisong Xu PFLDnet 2007 February 7, 2007.
Queue Dynamics with Window Flow Control
Open Issues in Router Buffer Sizing
Lecture 19 – TCP Performance
Amogh Dhamdhere, Hao Jiang and Constantinos Dovrolis
Notices of the AMS, September 1998
Presented by Chun Zhang 2/14/2003
pathChirp Efficient Available Bandwidth Estimation
CPSC 641: Network Traffic Self-Similarity
pathChirp Efficient Available Bandwidth Estimation
Presentation transcript:

1 Why is the Internet traffic bursty in short time scales? Constantine Dovrolis Hao Jiang College of Computing Georgia Institute of Technology

2 The many faces of traffic burstiness ŸFACT: Internet traffic is bursty in very wide range of time scales (microseconds to hours) Ÿ“Burstiness” can be related to different statistical aspects of the traffic process: ŸVariance of marginal distribution in certain time scale ŸE.g., Gamma renewal process is burstier than Poisson process (with same average rate) ŸStrong correlations in interarrivals or counts ŸE.g., packet-trains or ON-OFF user behavior ŸScaling behavior in a range of time scales ŸE.g., IID process: variance decreases with time scale T -1 ŸE.g., Self-similar process: variance decreases with T -2(1-H), H: Hurst parameter (0.5<H<1)

3 Burstiness in large/medium time scales ŸWell understood cause-effect relationship in large scales (> seconds) ŸLeland et al. (TNet’94): asymptotically self-similar scaling and LRD behavior, assuming stationarity ŸMajor causes: ŸWillinger et al. (Sigcomm’95): heavy-tailed ON-OFF behavior in packet interarrivals ŸCrovella/Bestavros (TNet’99): heavy-tailed ON-OFF behavior in Web transfers ŸRather well understood behavior also in medium scales (in the order of seconds): ŸFigueiredo et al. (CompNets’02): pseudo-self similar behavior in a range of medium time scales ŸFrom a single RTT to tens/hundreds of RTTs ŸCause: strong correlations due to TCP congestion control and timeouts

4 Burstiness in short (sub-RTT) time scales ŸSeveral (rather contradictory) proposed traffic models: ŸMultifractal & non-Gaussian model (Riedi et al. TransIT‘99, Feldmann et al. Sigcomm’98.) ŸMonofractal & Gaussian (Zhang et al. Infocom’03) ŸCluster process with Gamma interarrivals (Hohn et al.TransSP’03) ŸNonstationary Poisson (Karagiannis et al. Infocom’04) ŸMore importantly, however, the open question is: What causes short-scale (sub-RTT) burstiness? ŸTCP ACK compression (Feldmann et al. Sigcomm ’99) Ÿ“Dense” (i.e., highly variable) interarrivals (Zhang et al. Infocom ’02) ŸOur objectives: ŸIdentify major cause(s) for sub-RTT burstiness of aggregate Internet traffic ŸRelate flow characteristics (capacity, RTT, window size, flow size) with resulting burstiness ŸExplain why some of the previous measurements resulted in contradictory models

5 Main questions ŸWhat is the major cause for sub-RTT burstiness in aggregate Internet traffic? ŸIndividual flows or of aggregate traffic? ŸIf individual TCP flows cause sub-RTT burstiness, which component of the TCP protocol is to blame? ŸCongestion control? Self-clocking? ACK compression? ŸWhich TCP flows are mostly responsible for short scale burstiness? ŸLarge? Dense? High-capacity? ŸIs there a practical way to reduce short scale burstiness? ŸTraffic shaping? Change in TCP? ŸWhat is the effect of traffic multiplexing (aggregation) on short scale burstiness? ŸDoes aggregation produce “Poisson-like” traffic? ŸWhat is the impact of short scale burstiness on queueing performance? ŸConventional wisdom: “LRD behavior dominates queueing performance”

6 Overview ŸWavelet-based MRA and burstiness definition ŸSub-RTT ON-OFF behavior due to TCP self- clocking ŸCase study: the burstiness of an OC-48 trace ŸSmoothing effect of TCP pacing

7 Multi-Resolution Analysis (MRA) Analyze variability of traffic process in successive time scales T j = 2 j T 0 :

8 Wavelet-based MRA (Abry-Veitch) Traffic process in time scale T j = 2 j T 0 : where X j k is amount of traffic in Energy of X j (for Haar wavelet): Energy of Poisson process of rate λ: E j = λT 0 (constant) Energy of periodic process in scale T j : E j = 0 (a periodicity causes energy drop) Energy plot: logE j vs j, j=0,1,2,…

9 An unusual definition of traffic burstiness ŸA traffic process X j is bursty at scale j if the energy of X j is higher than the energy of Poisson process with same average rate ŸExample: energy plot of an OC-48 Abilene trace

10 Overview ŸWavelet-based MRA and a burstiness definition ŸSub-RTT ON-OFF behavior due to TCP self-clocking ŸCase study: the burstiness of an OC-48 trace ŸSmoothing effect of TCP pacing

11 TCP self-clocking ŸCan a single TCP flow create bursty traffic in sub-RTT scales, and if so, under which condition? ŸMain TCP parameters: ŸW: send-window size (segs)T: round-trip time ŸL:MSS C: path capacity ŸCT: bandwidth-delay product ŸIdeal TCP sending behavior within a single RTT: ŸDriven by self-clocking and delayed-ACKs ŸBasic operation: each (new) received ACK triggers the back-to- back transmission of at least two new segments ŸInterarrivals of back-to-back segments after bottleneck: L/C ŸInterarrivals of generated ACKs at receiver: 2*L/C ŸWithout ACK compression, ACKs will arrive at sender with same interarrival

12 ŸAlmost all interarrivals of data segments are equal to L/C ŸThe only interarrivals that are larger than L/C are between successive windows

13 Self-clocking model without cross traffic: case 1 WL < CT, one level ON/OFF

14 Self-clocking model without cross traffic: case 2 WL >= CT, periodic interarrivals

15 ŸVantage point: about 50% of interarrivals at L/C p due to delayed ACKs ŸWindow is split in clusters of bursts, due to interfering cross traffic

16 Self-clocking with cross traffic ŸWithin each RTT, send-window is segmented into a number of bursts, with each burst being two or more packets sent back- to-back ŸBasically, a two-level ON-OFF process ŸWindow duration: Δ, K bursts, burst length: B i

17 Energy plot for TCP self-clocking with cross traffic

18 Summary so far.. ŸIf TCP’s send-window is less than the flow’s bandwidth-delay product (W < CT), TCP generates bursty traffic in sub-RTT scales ŸWithout cross traffic, one-level ON-OFF process ŸWith cross traffic, two-level ON-OFF process ŸOtherwise, if W > CT, traffic is almost periodic ŸCan we verify the previous observations based on the analysis of a real Internet trace?

19 Overview ŸWavelet-based MRA and a burstiness definition ŸSub-RTT ON-OFF behavior due to TCP self-clocking ŸCase study: the burstiness of an OC-48 trace ŸSmoothing effect of TCP pacing

20 Case study: burstiness of OC-48 trace ŸGoal: identify minimal set of flows that are responsible for short scale burstiness in aggregate traffic ŸAlso, relate flow characteristics (RTT, capacity, flow size, window size) with the resulting energy plot of the aggregate traffic ŸDefinitions: ŸMice: flow size < 15KB ŸBurstiness ratio = CT/W Subset GByte Flows all TCP T T, C elephant mice Large ratio Small ratio

21 ŸTraffic is bursty across (almost) all time scales ŸEnergy plots of original traffic and TCP subset are the same ŸNon-TCP traffic does not affect burstiness of aggregate

22 Distribution of per-flow RTTs Estimation technique: Jiang-Dovrolis, ACM CCR’02

23 ŸDistribution of per-flow capacities ŸEstimation technique: see Jiang-Dovrolis PAM’04

24 The dip in the 12-th scale reflects a periodicity around 200ms ŸWeighted average RTT of TCP traffic

25 ŸLarge flows determine the shape of the aggregate energy plot ŸSmall flows are also bursty, but they do not affect the energy plot of the aggregate traffic

26 Distribution of BDP/W ratio for large flows ŸRatio is quite larger than 1.0 for most of the large flows ŸAs little as 5% traffic has ratio close to 1.0

27 ŸBulk flows with large BDP/W ratio create sub-RTT burstiness ŸBulk flows with small BDP/W ratio are smooth in sub-RTT scales

28 Summary so far.. ŸAnalysis of real aggregate Internet traffic confirms that short scale burstiness is due to the following kind of traffic: 1.Individual TCP flows 2.Large size (bulk transfers) 3.Large BDP relative to the average window size ŸAlso, the extent of the short scale burstiness is related to the (effective) RTT of the TCP traffic ŸIdentified in the energy plot as a dip at that time scale

29 Overview ŸWavelet-based MRA and a burstiness definition ŸSub-RTT ON-OFF behavior due to TCP self-clocking ŸCase study: the burstiness of an OC-48 trace ŸSmoothing effect of TCP pacing

30 Smoothing effect of TCP pacing ŸFundamental issue with TCP self-clocking: ŸMay send a window as a burst or a cluster of bursts ŸPacket transmissions are not “spread” during RTT ŸPacing is an alternative to self-clocking: ŸTransmit packets periodically during RTT ŸDriven by OS timer at sender ŸIdeal pacing ŸArbitrarily small granularity ŸBut timer overhead is too high ŸPractical pacing ŸTimer granularity T c is typically 1ms or 10ms ŸSend m packets every nT c time units

31 ŸIdeal pacing of individual TCP flows makes traffic smoother than Poisson in sub-RTT scales

32 ŸThe 1ms timer is effective in reducing short scale burstiness ŸThe 10ms timer may be unable to eliminate short scale burstiness

33 Conclusions ŸWhat is the major cause for short scale burstiness in aggregate Internet traffic? ŸON-OFF packet transmission pattern in large TCP flows ŸIf individual TCP flows cause most of the burstiness, which component of the TCP protocol is to blame? ŸSelf-clocking ŸWhich TCP flows are mostly responsible for short scale burstiness? ŸLarge TCP flows with bandwidth-delay product > average flow’s window ŸIs there a practical way to reduce short scale burstiness? ŸYes, pacing at the sender instead of self-clocking ŸWhat is the effect of traffic multiplexing (aggregation) on short scale burstiness? ŸAggregation reduces the CoV of the marginal distribution, but it does not remove the correlations in the packet interarrivals (i.e., the traffic does not converge to Poisson process) ŸWhat is the impact of short scale burstiness on queueing performance? ŸSub-RTT burstiness is important in moderate load conditions, but also in high-load conditions when the bottleneck buffer is small

34 Thanks

35 more slides

36 ŸBackground and related work ŸWavelet-based multi-resolution analysis ŸSub-RTT ON/OFF behavior due to TCP self-clocking ŸEffects of aggregation ŸCase study: the burstiness of an OC-48 trace ŸSmoothing effect of TCP pacing ŸQueueing performance

37 Effect of aggregation Aggregate if X and Y independent ŸFlows that do not have significant energy relative to the aggregate do not have a major impact on the burstiness of the aggregate

38 ŸEnergy plot of aggregate maintains the shape as that of a single constituent, independent of N ŸCorrelation does not die out with degree of aggregation although statistical multiplexing gain exists

39 ŸPoint process theorem: the aggregation of N independent point processes converges to Poisson process as N increase ŸContradiction ? ŸTheorem assumes the rate of each constituent flow becomes smaller as N increases, i.e., the rate of aggregate is constant independent of N

40 ŸBackground and related work ŸWavelet-based multi-resolution analysis ŸSub-RTT ON/OFF behavior due to TCP self-clocking ŸEffects of aggregation ŸCase study: the burstiness of an OC-48 trace ŸSmoothing effect of TCP pacing ŸQueueing performance

41 Queueing performance ŸLarge buffer vs. small buffer ŸHeavy-load condition vs. moderate-load condition ŸSetup ŸRandomly sample input OC-48 trace to achieve desired utilization

42 95-th percentile of queue size (Buffer=10MB) ŸSub-RTT burstiness matters in moderate loading conditions ŸIn heavy-load conditions, LRD is more important

43 Loss rate vs. buffer size (utilization=0.95) ŸLoss rate with pacing is significantly lower for small buffer size

44 Loss rate vs. offered load (Buffer=50KB) ŸSub-RTT burstiness matters even in heavy-load conditions for underbuffered link

45 ŸTCP flow: C p = C = 100Mbps,L=1500B, 4.5sec, 1000pkts ŸAbout 80% of interarrivals are within a factor of two from L/C

46 ŸMost interarrivals at L/C p and at (2L/C - L/C p )

47 ŸTCP flow: L=1500B, 37sec, 4200pkts ŸC p = 100Mbps, C = 1.3Mbps (notice two interarrival modes)

48

49 ŸTCP flow: L=1500B, 25sec, 5400pkts ŸC p =100Mbps (note 50% of interarrivals at L/C p )