Link Dimensioning for Fractional Brownian Input Chen Jiongze PhD student, Electronic Engineering Department, City University of Hong Kong Supported by.

Slides:



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

An Analytical Model for Network Flow Analysis Ernesto Gomez, Yasha Karant, Keith Schubert Institute for Applied Supercomputing Department of Computer Science.
Network Design and Optimization Queueing Theory Overview Dr. Greg Bernstein Grotto Networking
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???
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
Chen Chu South China University of Technology. 1. Self-Similar process and Multi-fractal process There are 3 different definitions for self-similar process.
A New Approach for Accurate Modelling of Medium Access Control (MAC) Protocols Presenter: Moshe Zukerman ARC Centre for Ultra Broadband Information Networks.
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.
1 17. Long Term Trends and Hurst Phenomena From ancient times the Nile river region has been known for its peculiar long-term behavior: long periods of.
October 14, 2002MASCOTS Workload Characterization in Web Caching Hierarchies Guangwei Bai Carey Williamson Department of Computer Science University.
Björn Landfeldt School of Information Technologies Investigating a theoretical model Bjorn Landfeldt University of Sydney.
A gentle introduction to fluid and diffusion limits for queues Presented by: Varun Gupta April 12, 2006.
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.
THE TITLE OF YOUR PAPER Your Name Communication Networks Laboratory School of Engineering Science Simon Fraser University.
Evaluating System Performance in Gigabit Networks King Fahd University of Petroleum and Minerals (KFUPM) INFORMATION AND COMPUTER SCIENCE DEPARTMENT Dr.
1 The Designs and Analysis of a Scalable Optical Packet Switching Architecture Speaker: Chia-Wei Tuan Adviser: Prof. Ho-Ting Wu 3/4/2009.
Carnegie Mellon Adaptive Mapping of Linear DSP Algorithms to Fixed-Point Arithmetic Lawrence J. Chang Inpyo Hong Yevgen Voronenko Markus Püschel Department.
Connection Admission Control Schemes for Self-Similar Traffic Yanping Wang Carey Williamson University of Saskatchewan.
Self-Similar through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level Walter Willinger, Murad S. Taqqu, Robert Sherman,
Internet Traffic Modeling Poisson Model vs. Self-Similar Model By Srividhya Chandrasekaran Dept of CS University of Houston.
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.
Panel Topic: After Long Range Dependency (LRD) discoveries, what are the lessons learned so far to provide QoS for Internet advanced applications David.
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
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case Abhay K. Parekh, Member, IEEE, and Robert.
Traffic Modelling and Related Queueing Problems Presenter: Moshe Zukerman ARC Centre for Ultra Broadband Information Networks EEE Dept., The University.
Optimizing Multi-Layered Networks Towards a Transparently Optical Internet Presenter: Moshe Zukerman Electronic Engineering Dept., City University of Hong.
Estimation of the Probability of Congestion using Monte Carlo method in OPS Networks Anna Urra, Jose L Marzo, Mateu Sbert, Eusebi Calle Institute of Informatics.
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.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
COMPSAC'14 - N. Larrieu /07/ How to generate realistic network traffic? Antoine VARET and Nicolas LARRIEU COMPSAC – Vasteras – July the 23.
Pravin Rajamoney CSE-581 Network Technology
Interacting Network Elements: Chaos and Congestion Propagation Gábor Vattay Department of Physics of Complex Systems Eötvös University, Budapest, Hungary.
Detecting the Long-Range Dependence in the Internet Traffic with Packet Trains Péter Hága, Gábor Vattay Department Of Physics of Complex Systems Eötvös.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Simulation & Confidence Intervals COMP5416 Advanced Network Technologies.
Self-generated Self-similar Traffic Péter Hága Péter Pollner Gábor Simon István Csabai Gábor Vattay.
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
IMA Summer Program on Wireless Communications VoIP over a wired link Phil Fleming Network Advanced Technology Group Motorola, Inc.
Performance Evaluation of Long Range Dependent Queues Performance Evaluation of Long Range Dependent Queues Chen Jiongze Supervisor: Moshe ZukermanCo-Supervisor:
Risk Analysis Workshop April 14, 2004 HT, LRD and MF in teletraffic1 Heavy tails, long memory and multifractals in teletraffic modelling István Maricza.
Péter Hága Eötvös Loránd University, Hungary European Conference on Complex Systems 2008 Jerusalem, Israel.
Notices of the AMS, September Internet traffic Standard Poisson models don’t capture long-range correlations. Poisson Measured “bursty” on all time.
PERFORMANCE ANALYSIS OF CIRCUIT SWITCHED NETWORKS WANG Meiqian ( ) Supervisor: Dr. WONG, Eric W M Co-supervisor: Prof. ZUKERMAN, Moshe Jul. 4, 2013.
Applications of Stochastic Processes in Asset Price Modeling Preetam D’Souza.
Analytical Model for Connectivity in Vehicular Ad Hoc Networks Published in IEEE TVT vol. 57, no. 6, November 2008 Authors: Saleh Yousefi, Eitan Altman,
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.
OPERATING SYSTEMS CS 3502 Fall 2017
An Analytical Model for Network Flow Analysis
學生:杜筱菡 指導教授:柯開維 教授 日期:2017/6/22
Internet Traffic Modeling
Interesting Links.
Minimal Envelopes.
Notices of the AMS, September 1998
مدل سازی ترافیک شبکه استاد راهنما: دکتر کیارش میزانیان
Presented by Chun Zhang 2/14/2003
Title of Your Paper Names of Co-Authors
Schedulability Conditions for Scheduling Algorithms
CPSC 641: Network Traffic Self-Similarity
Presentation transcript:

Link Dimensioning for Fractional Brownian Input Chen Jiongze PhD student, Electronic Engineering Department, City University of Hong Kong Supported by Grant [CityU ] Moshe Zukerman Electronic Engineering Department,, City University of Hong Kong Ron G. Addie Department of Mathematics and Computing, University of Southern Queensland, Australia

Outline: Background A New Analytical Result of an FBM Queue Simulation Link Dimensioning Discussion & Conclusion

Outline: Background A New Analytical Result of an FBM Queue Simulation Link Dimensioning Discussion & Conclusion

Fractional Brownian Motion (fBm) process of parameter H, M t H are as follows: Gaussian process N(0,t 2H ) Covariance function: For H > ½ the process exhibits long range dependence … traffic Queue

… traffic Queue Long Range Dependence Gaussian By Central limit theorem Its statistics match those of real traffic (for example, auto-covariance function) - Gaussian process & LRD A small number of parameters - Hurst parameter (H), variance Amenable to analysis Is fBm a good model? YES

Outline: Background A New Analytical Result of an FBM Queue Simulation Link Dimensioning Discussion & Conclusion

A New Analytical Result of an fBm Queue … traffic Queue Queuing Model fBm traffic Hurst parameter (H) variance (σ 1 2 ) drift / mean rate of traffic (λ) Single server Queue with ∞ buffers service rate (τ) steady state queue size (Q) mean net input (μ = λ - τ)

Analytical results of (fBm) Queue No exact results for P(Q>x) for H ≠ 0.5 Existing asymptotes : By Norros [9] [9] I. Norros, “A storage model with self-similar input,” Queueing Syst., vol. 16, no. 3-4, pp. 387–396, Sep

Analytical results of (fBm) Queue Existing asymptotes (cont.): By Husler and Piterbarg [14] [14] J. H¨usler and V. Piterbarg, “Extremes of a certain class of Gaussian processes,” Stochastic Processes and their Applications, vol. 83, no. 2, pp. 257 – 271, Oct

Approximation of [14] is more accurate for large x but with no way provided to calculate Our approximation: Analytical results of (fBm) Queue

Our approximation VS asymptote of [14]: Advantages: a distribution accurate for full range of u/x provides ways to derive c Disadvantages: Less accurate for large x (negligible) Analytical results of (fBm) Queue [14] J. H¨usler and V. Piterbarg, “Extremes of a certain class of Gaussian processes,” Stochastic Processes and their Applications, vol. 83, no. 2, pp. 257 – 271, Oct

Outline: Background A New Analytical Result of an FBM Queue Simulation Link Dimensioning Discussion & Conclusion

Simulation Basic algorithm (Lindley’s equation):

n012… U n (Mb)1.234– … m(t) (Mb)-0.5 … Q n (Mb)0max(0, – 0.5) =0.734 max (0, – – 0.5) =0 … 1 ms Length of U n = 2 22 for different Δt, it is time- consuming to generate U n for different time unit)

An efficient approach Instead of generating a new sequence of numbers, we change the “units” of work (y-axis).

1ms -> Δt ms variance of the fBn sequence (U n ): V Rescale the Y-asix

An efficient approach Instead of generating a new sequence of numbers, we change the “units” of work (y-axis). 1 unit = S instead of 1 where Rescale m and P(Q>x) m = μΔt/S units, so P(Q>x) is changed to P(Q>x/S) Only need one fBn sequence

Simulation Results Validate simulation

Simulation Results

Outline: Background A New Analytical Result of an FBM Queue Simulation Link Dimensioning Discussion & Conclusion

Link Dimensioning We can drive dimensioning formula by Incomplete Gamma function: Gamma function:

Finally Link Dimensioning where C is the capacity, so.

Link Dimensioning

Outline: Background Analytical results of a fractional Brownian motion (fBm) Queue Existing approximations Our approximation Simulation An efficient approach to simulation fBm queue Results Link Dimensioning Discussion & Conclusion

Discussion fBm model is not universally appropriate to Internet traffic negative arrivals ( μ = λ – τ) Further work re-interpret fBm model to alleviate such problem A wider range of parameters

Conclusion In this presentation, we considered a queue fed by fBm input derived new results for queueing performance and link dimensioning described an efficient approach for simulation presented agreement between the analytical and the simulation results comparison between our formula and existing asymptotes numerical results for link dimensioning for a range of examples

References:

Q & A

Background Self-similar (Long Range Dependency) “Aggregating streams of traffic typically intensifies the self similarity (“burstiness”) instead of smoothing it.”[1] Very different from conventional telephone traffic model (for example, Poisson or Poisson-related models) Using Hurst parameter (H) as a measure of “burstiness” [1] W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, “On the self-similar nature of ethernet traffic (extended version),” IEEE/ACM Trans. Networking, vol. 2, no. 1, pp. 1–15, Feb

Background Self-similar (Long Range Dependence) “Aggregating streams of traffic typically intensifies the self similarity (“burstyiness”) instead of smoothing it.”[1] Very different from conventional telephone traffic model (for example, Poisson or Poisson-related models) Using Hurst parameter (H) as a measure of “burstiness” Gaussian (normal) distribution When umber of source increases [1] W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, “On the self-similar nature of ethernet traffic (extended version),” IEEE/ACM Trans. Networking, vol. 2, no. 1, pp. 1–15, Feb [6] M. Zukerman, T. D. Neame, and R. G. Addie, “Internet traffic modeling and future technology implications,” in Proc. IEEE INFOCOM 2003,vol. 1, Apr. 2003, pp. 587–596. process of Real trafficGaussian process [2] Central limit theorem Especially for core and metropolitan Internet links, etc.

Analytical results of (fBm) Queue A single server queue fed by an fBm input process with - Hurst parameter (H) - variance (σ 1 2 ) - drift / mean rate of traffic (λ) - service rate (τ) - mean net input (μ = λ - τ) - steady state queue size (Q) Complementary distribution of Q, denoted as P(Q>x), for H = 0.5: [16] [16] J. M. Harrison, Brownian motion and stochastic flow systems. New York: John Wiley and Sons, 1985.