Speaker: Yu-Fu Huang Advisor: Dr. Kai-Wei Ke Date : 2014, Mar. 17 A page-oriented WWW traffic model for wireless system simulations.

Slides:



Advertisements
Similar presentations
Introduction to Queuing Theory
Advertisements

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
Exponential and Poisson Chapter 5 Material. 2 Poisson Distribution [Discrete] Poisson distribution describes many random processes quite well and is mathematically.
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Groups models Modeling and Dimensioning of Mobile Networks: from GSM to LTE.
Network Design and Optimization Queueing Theory Overview Dr. Greg Bernstein Grotto Networking
Probability, Statistics, and Traffic Theories
On the Self-Similar Nature of Ethernet Traffic - Leland, et. Al Presented by Sumitra Ganesh.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Queueing Theory: Part I
A Nonstationary Poisson View of Internet Traffic T. Karagiannis, M. Molle, M. Faloutsos University of California, Riverside A. Broido University of California,
1 Overview of Queueing Systems Michalis Faloutsos Archana Yordanos The web.
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
Origins of Long Range Dependence Myths and Legends Aleksandar Kuzmanovic 01/08/2001.
2001/11/29Chin-Kai Wu, CS, NTHU1 Characteristics of Network Delay and Delay Jitter and its Effect on Voice over IP Li Zheng, Liren Zhang, Dong Xu Communications,
Rensselaer Polytechnic Institute © Shivkumar Kalvanaraman & © Biplab Sikdar1 ECSE-4730: Computer Communication Networks (CCN) Network Layer Performance.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
A Traffic Characterization of Popular On-Line Games Wu-Chang Feng, Francis Chang, Wu- Chi Feng, and Jonathan Walpole IEEE/ACM Trans. Networking, Jun
Lecture 4 Mathematical and Statistical Models in Simulation.
Internet Queuing Delay Introduction How many packets in the queue? How long a packet takes to go through?

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/
Applications of Poisson Process
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
Queueing Theory I. Summary Little’s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems  M/M/1  M/M/m  M/M/1/K  …
A bit on Queueing Theory: M/M/1, M/G/1, GI/G/1 Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. (As of Dec 1: Swinburne.
The Poisson Process. A stochastic process { N ( t ), t ≥ 0} is said to be a counting process if N ( t ) represents the total number of “events” that occur.
Exponential and Chi-Square Random Variables
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
Winter 2006EE384x1 Review of Probability Theory Review Session 1 EE384X.
1 Exponential distribution: main limitation So far, we have considered Birth and death process and its direct application To single server queues With.
Traffic Modeling.
Exploiting Clustering Techniques for Web Session Inference A.Bianco, G. Mardente, M. Mellia, M.Munafò, L. Muscariello (Politecnico di Torino)
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
Entities and Objects The major components in a model are entities, entity types are implemented as Java classes The active entities have a life of their.
1 Queueing Theory Frank Y. S. Lin Information Management Dept. National Taiwan University
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
TexPoint fonts used in EMF.
CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Computer Networking Queueing (A Summary from Appendix A) Dr Sandra I. Woolley.
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.
정하경 MMLAB Fundamentals of Internet Measurement: a Tutorial Nevil Brownlee, Chris Lossley, “Fundamentals of Internet Measurement: a Tutorial,” CMG journal.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
Risk Analysis Workshop April 14, 2004 HT, LRD and MF in teletraffic1 Heavy tails, long memory and multifractals in teletraffic modelling István Maricza.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
COMT 4291 Queuing Analysis COMT Call/Packet Arrival Arrival Rate, Inter-arrival Time, 1/ Arrival Rate measures the number of customer arrivals.
Queueing Fundamentals for Network Design Application ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Analytical Model for Connectivity in Vehicular Ad Hoc Networks Published in IEEE TVT vol. 57, no. 6, November 2008 Authors: Saleh Yousefi, Eitan Altman,
Weldisson Ferreira Ruas José Marcos C. Brito
Al-Imam Mohammad Ibn Saud University
Pertemuan ke-7 s/d ke-10 (minggu ke-4 dan ke-5)
學生:杜筱菡 指導教授:柯開維 教授 日期:2017/6/22
Internet Queuing Delay Introduction
Demo on Queuing Concepts
CPSC 531: System Modeling and Simulation
Internet Queuing Delay Introduction
Variability 8/24/04 Paul A. Jensen
Huang Kai Qi Zhengwei Liu Bo Shanghai Jiao Tong University.
Queueing Theory 2008.
Queueing Theory Frank Y. S. Lin Information Management Dept.
Queueing Problem The performance of network systems rely on different delays. Propagation/processing/transmission/queueing delays Which delay is affected.
Presentation transcript:

Speaker: Yu-Fu Huang Advisor: Dr. Kai-Wei Ke Date : 2014, Mar. 17 A page-oriented WWW traffic model for wireless system simulations

Outline Traffic models from Poisson to Self-Similar WWW Traffic structure Web traffic characterization Simulation and results Conclusion Reference

The interest towards traffic model Traffic models are needed as input in network simulation. A good traffic model may lead to a better understanding of the characteristics of the network traffic itself.

Stochastic Counting Process Poisson process ⊆ Renewal process Independent increment Memoryless property Inter-arrival time pdf: Exponential Renewal process Independent increment Inter-arrival time pdf: Arbitrary X1X2X3 X4 X5X6 X7 T=X1+X2+X3+X4+… X1,X2,X3… are i.i.d Poisson process: - Any point in the time axis meets Memoryless property. Renewal process: - Only point exactly at exiting one period and entering a new period meets Memoryless property. t

Variance of sample mean approaches to zero as n approaches to infinite.

Traffic models from Poisson to Self-Similar Self-Similar process Long Range Dependency Infinite Variance

Heavy-tailed probability distribution

Outline Traffic models from Poisson to Self-Similar WWW Traffic structure Web traffic characterization Simulation and results Conclusion Reference

WWW Traffic structure Two approaches to data traffic modelling: Behaviorist or black-box approach: Modelled w/o taking into account the causes that lead to them Structure approach: Model design is based on the internal structure of traffic generating system

Outline Traffic models from Poisson to Self-Similar WWW Traffic structure Web traffic characterization Simulation and results Conclusion Reference

Pages per session

Time between pages

Page size

Heavy-tailed probability distribution

Packet size

Packet inter-arrival time Page Packet PIT

Outline Traffic models from Poisson to Self-Similar WWW Traffic structure Web traffic characterization Simulation and results Conclusion Reference

Test conditions 4MB Queue 2000s of average session interarrival time Constant service rate of 2 KBps 82.75s of average session interarrival time (I) (II) Test condition (I): With proposed model adapted to corporate environment  Server utilization rate: 68% With ETSI model adapted to corporate environment  Server utilization rate: 3% Test condition (II): With proposed model adapted to corporate environment  Server utilization rate: 68% With ETSI model adapted to corporate environment but increasing average session interarrival time from 2000s to 82.75s  Get server utilization rate: 68% Adjusted Utilization ESTI model

ESTI Model

Test condition (I)Test condition (II)

Conclusions (I) Traffic models summary: Independent interarrival time: Exponential Session or packet interarrival Cumulative independent interarrival time: Gamma or Erlang distribution Page interarrival Data size: Self-similar distribution Page size

Conclusions (II) ESTI model underestimates packet losses and delay in a queue due to the low load offered by the ESTI model. The proposed model generates a traffic load similar to the measured one and much more burstiness than the ESTI one.

Reference [2] Staehle D., Leibnitz K., and Tran-Gia P., “Source Traffic Modeling of Wireless Application” Institut für Informatik, Würzburg Universität, Technical Report No. 261, June [1] Reyes-Lecuona A., González-Parada E., and Díaz-Estrella A., “A page-oriented WWW traffic model for wireless system simulations” Proceedings of the 16th International Teletraffic Congress (ITC16), Edinburgh, United Kindom, pp , June [3] Michela Becchi, “From Poisson Process to Self-Similarity: a Survey of Network Traffic Models”