Copyright © 2005 Department of Computer Science CPSC 641 Winter 20111 Self-Similar Network Traffic The original paper on network traffic self-similarity.

Slides:



Advertisements
Similar presentations
Doc.: IEEE /1216r1 Submission November 2009 BroadcomSlide 1 Internet Traffic Modeling Date: Authors: NameAffiliationsAddressPhone .
Advertisements

Copyright © 2005 Department of Computer Science CPSC 641 Winter Self-Similarity in WAN Traffic A subsequent paper established the presence of network.
An Analytical Model for Network Flow Analysis Ernesto Gomez, Yasha Karant, Keith Schubert Institute for Applied Supercomputing Department of Computer Science.
ABSTRACT We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result.
Network and Service Assurance Laboratory Analysis of self-similar Traffic Using Multiplexer & Demultiplexer Loaded with Heterogeneous ON/OFF Sources Huai.
2014 Examples of Traffic. Video Video Traffic (High Definition) –30 frames per second –Frame format: 1920x1080 pixels –24 bits per pixel  Required rate:
2  Something “feels the same” regardless of scale 4 What is that???
1 LAN Traffic Measurements Carey Williamson Department of Computer Science University of Calgary.
1 Self-Similar Wide Area Network Traffic Carey Williamson University of Calgary.
1 Self-Similar Ethernet LAN Traffic Carey Williamson University of Calgary.
CMPT 855Module Network Traffic Self-Similarity Carey Williamson Department of Computer Science University of Saskatchewan.
On the Self-Similar Nature of Ethernet Traffic - Leland, et. Al Presented by Sumitra Ganesh.
Copyright © 2005 Department of Computer Science CPSC 641 Winter WAN Traffic Measurements There have been several studies of wide area network traffic.
October 14, 2002MASCOTS Workload Characterization in Web Caching Hierarchies Guangwei Bai Carey Williamson Department of Computer Science University.
Copyright © 2005 Department of Computer Science CPSC 641 Winter Data Analysis and Presentation There are many “tricks of the trade” used in data.
Small scale analysis of data traffic models B. D’Auria - Eurandom joint work with S. Resnick - Cornell University.
無線區域網路中自我相似交通流量之 成因與效能評估 The origin and performance impact of self- similar traffic for wireless local area networks 報 告 者：林 文 祺 指導教授：柯 開 維 博士.
A Nonstationary Poisson View of Internet Traffic T. Karagiannis, M. Molle, M. Faloutsos University of California, Riverside A. Broido University of California,
Self-Similarity in Network Traffic Kevin Henkener 5/29/2002.
1 Interesting Links
Variance of Aggregated Web Traffic Robert Morris MIT Laboratory for Computer Science IEEE INFOCOM 2000’
Copyright © 2005 Department of Computer Science CPSC 641 Winter Network Traffic Measurement A focus of networking research for 20+ years Collect.
CSE 561 – Traffic Models David Wetherall Spring 2000.
THE TITLE OF YOUR PAPER Your Name Communication Networks Laboratory School of Engineering Science Simon Fraser University.
Copyright © 2005 Department of Computer Science CPSC 641 Winter LAN Traffic Measurements Some of the first network traffic measurement papers were.
Self-Similar through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level Walter Willinger, Murad S. Taqqu, Robert Sherman,
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Statistical inference.
CS 6401 Network Traffic Characteristics Outline Motivation Self-similarity Ethernet traffic WAN traffic Web traffic.
1 WAN Measurements Carey Williamson Department of Computer Science University of Calgary.
Internet Traffic Modeling Poisson Model vs. Self-Similar Model By Srividhya Chandrasekaran Dept of CS University of Houston.
Self-Similar Traffic COMP5416 Advanced Network Technologies.
Self-Similarity of Network Traffic Presented by Wei Lu Supervised by Niclas Meier 05/
1 Network Simulation and Testing Polly Huang EE NTU
1 Chapters 9 Self-SimilarTraffic. Chapter 9 – Self-Similar Traffic 2 Introduction- Motivation Validity of the queuing models we have studied depends on.
SELF-SIMILAR INTERNET TRAFFIC AND IMPLICATIONS FOR WIRELESS NETWORK PERFORMANCE IN SUDAN Presented By HUDA M. A. EL HAG University Of Khartoum – Faculty.
References for M/G/1 Input Process
1 FARIMA(p,d,q) Model and Application n FARIMA Models -- fractional autoregressive integrated moving average n Generating FARIMA Processes n Traffic Modeling.
ECEN4533 Data Communications Lecture #2125 February 2013 Dr. George Scheets n Read 11.4 n Problems: Chapter 11.2, 4, & 5 n Quiz #2, 25 March (Live) < 1.
Hung X. Nguyen and Matthew Roughan The University of Adelaide, Australia SAIL: Statistically Accurate Internet Loss Measurements.
COMPSAC'14 - N. Larrieu /07/ How to generate realistic network traffic? Antoine VARET and Nicolas LARRIEU COMPSAC – Vasteras – July the 23.
Link Dimensioning for Fractional Brownian Input Chen Jiongze PhD student, Electronic Engineering Department, City University of Hong Kong Supported by.
1 Self Similar Traffic. 2 Self Similarity The idea is that something looks the same when viewed from different degrees of “magnification” or different.
Conceptual Differences Between Cube Analyst and Cube Analyst Drive Austen C. Duffy, Ph.D. Computational Mathematician, Citilabs.
A Nonstationary Poisson View of Internet Traffic Thomas Karagiannis joint work with Mart Molle, Michalis Faloutsos, Andre Broido.
Burst Metric In packet-based networks Initial Considerations for IPPM burst metric Tuesday, March 21, 2006.
1 Self Similar Video Traffic Carey Williamson Department of Computer Science University of Calgary.
Investigating the Prefix-level Characteristics A Case Study in an IPv6 Network Department of Computer Science and Information Engineering, National Cheng.
DOWNLINK SCHEDULING IN CDMA NETWORKS GUIDE : Mrs. S.Malarvizhi Group : A5 G.R Brijesh ( ) Deepu K. Pillai ( ) Regi Thomas George ( )
Notices of the AMS, September Internet traffic Standard Poisson models don’t capture long-range correlations. Poisson Measured “bursty” on all time.
1 Interesting Links. On the Self-Similar Nature of Ethernet Traffic Will E. Leland, Walter Willinger and Daniel V. Wilson BELLCORE Murad S. Taqqu BU Analysis.
40th IAEE International Conference
An Analytical Model for Network Flow Analysis
Internet Traffic Modeling
Interesting Links.
Minimal Envelopes.
CPSC 641: Network Measurement
CPSC 641: LAN Measurement Carey Williamson
Notices of the AMS, September 1998
Self-similar Distributions
CPSC 641: WAN Measurement Carey Williamson
Mark E. Crovella and Azer Bestavros Computer Science Dept,
Thesis Proposal Title Student Name Registration No. Supervisor Name
مدل سازی ترافیک شبکه استاد راهنما: دکتر کیارش میزانیان
Presented by Chun Zhang 2/14/2003
Title of Your Paper Names of Co-Authors
Carey Williamson Department of Computer Science University of Calgary
Carey Williamson Department of Computer Science University of Calgary
CPSC 641: Network Measurement
CPSC 641: Network Traffic Self-Similarity
Discrimination accuracy across conditions.
Presentation transcript:

Copyright © 2005 Department of Computer Science CPSC 641 Winter Self-Similar Network Traffic The original paper on network traffic self-similarity appeared at the 1993 ACM SIGCOMM Conference Authors: Will Leland, Murad Taqqu, Walter Willinger, and Daniel Wilson (Leland et al. 1993) Studied Ethernet LAN traffic Extended version appeared in IEEE/ACM Transactions on Networking, Vol. 2, No. 1, February 1994 One of the landmark papers of the 1990’s Highly regarded, influential, one of the most cited papers in the networking literature

Copyright © 2005 Department of Computer Science CPSC 641 Winter Main Contributions Identified presence of self-similarity property in aggregate Ethernet traffic Defined methodology for testing for the presence of self-similarity –autocorrelation function –variance-time plot –R/S statistic –periodogram (power spectrum) Proposed explanations/models for SS

Copyright © 2005 Department of Computer Science CPSC 641 Winter Measurement Study Detailed measurement study of very lengthy Ethernet packet traces, with high resolution timer, and lots of storage space One of the traces presented in their paper is a 27.5 hour trace Over 20 million packets

Copyright © 2005 Department of Computer Science CPSC 641 Winter Data Analysis Detailed statistical analysis: –aggregation, autocorrelation, R/S analysis, variance- time plot, periodograms, Whittle’s estimator, maximum likelihood... Very rigourous: confidence intervals, sophisticated statistical tests, sound methodology,... A wonderful paper to read (over and over)

Copyright © 2005 Department of Computer Science CPSC 641 Winter Main Results Aggregate Ethernet LAN traffic is self-similar Burstiness across many time scales Hurst parameter 0.7 < H < 0.9 H is larger when network utilization is higher (e.g., 0.9 when U = 15%) Self-similarity present on all LANs tested

Copyright © 2005 Department of Computer Science CPSC 641 Winter Conclusions Self-similarity is present in aggregate Ethernet LAN traffic Traffic does not aggregate well at all Law of large numbers may not hold! Poisson models (or Markovian models of any sort) do not capture reality at all Important to consider self-similar traffic

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.