Simulation Input Data Modeling

Similar documents
Simulation Modeling and Analysis

BESTFIT, DISTRIBUTION FITTING SOFTWARE BY PALISADE CORPORATION

Modeling and Simulation (An Introduction)

Section 6.2: Generating Discrete Random Variates

ISO INTERNATIONAL STANDARD. Random variate generation methods. Méthodes de génération de nombres pseudo-aléatoires. First edition

Probability and Statistics for Final Year Engineering Students

StatsMate. User Guide

Package UnivRNG. R topics documented: January 10, Type Package

Simulation with Arena

SSJ User s Guide. Package randvar Generating Non-Uniform Random Numbers

Constructing Statistical Tolerance Limits for Non-Normal Data. Presented by Dr. Neil W. Polhemus

SigmaXL Feature List Summary, What s New in Versions 6.0, 6.1 & 6.2, Installation Notes, System Requirements and Getting Help

Lecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool

Package simed. November 27, 2017

Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks

CREATING SIMULATED DATASETS Edition by G. David Garson and Statistical Associates Publishing Page 1

Computational Methods. Randomness and Monte Carlo Methods

Introduction : Identifying Key Features of Linear and Exponential Graphs

APPENDIX K MONTE CARLO SIMULATION

3.5. Rational Functions: Graphs, Applications, and Models. 3.5 Rational Functions: Graphs, Applications, and Models 3.6 Variation

You ve already read basics of simulation now I will be taking up method of simulation, that is Random Number Generation

PIANOS requirements specifications

What We ll Do... Random

Parametric. Practices. Patrick Cunningham. CAE Associates Inc. and ANSYS Inc. Proprietary 2012 CAE Associates Inc. and ANSYS Inc. All rights reserved.

Learning Objectives. Continuous Random Variables & The Normal Probability Distribution. Continuous Random Variable

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

TELCOM 2130 Queueing Theory. David Tipper Associate Professor Graduate Telecommunications and Networking Program. University of Pittsburgh

Computational Physics Adaptive, Multi-Dimensional, & Monte Carlo Integration Feb 21, 2019

Confidence Level Red Amber Green

Simulation. Outline. Common Mistakes in Simulation (3 of 4) Common Mistakes in Simulation (2 of 4) Performance Modeling Lecture #8

Fathom Dynamic Data TM Version 2 Specifications

Probability Models.S4 Simulating Random Variables

Section 2.3: Monte Carlo Simulation

rtrng: Advanced Parallel Random Number Generation in R

UNIT 4: QUEUEING MODELS

Unit: Quadratic Functions

19 Random Number Distributions

CPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)

WEB traffic characterization and performance analysis

Monitoring, Analysis and Modeling of HTTP and HTTPS Requests in a Campus LAN Shriparen Sriskandarajah and Nalin Ranasinghe.

Package visualize. April 28, 2017

An Excel Add-In for Capturing Simulation Statistics

Chapter 6: Simulation Using Spread-Sheets (Excel)

Maths Year 11 Mock Revision list

COMPUTER NETWORK PERFORMANCE. Gaia Maselli Room: 319

COMPUTER NETWORKS PERFORMANCE. Gaia Maselli

GBA 334 Module 6 Lecture Notes Networks and Queues. These notes will cover network models and queuing theory.

The Normal Distribution

Mathematics Curriculum

A LIBRARY OF REUSABLE MODEL COMPONENTS FOR VISUAL SIMULATION OF THE NCSTRL SYSTEM. Osman Balci Cengiz Ulusaraç Poorav Shah Edward A.

Analysis of WLAN Traffic in the Wild

INTERNET TRAFFIC MEASUREMENT (PART II) Gaia Maselli

Distributions of Continuous Data

Student Version 8 AVERILL M. LAW & ASSOCIATES

EP2200 Queueing theory and teletraffic systems

Computer Generation of Statistical Distributions

MLR Institute of Technology

Chapter 2: Understanding Data Distributions with Tables and Graphs

DiscoverSim Version 2.1 Workbook

Biostatistics & SAS programming. Kevin Zhang

Performance of UMTS Radio Link Control

Graphs and transformations 4G

Savio Salesian College. Mathematics Department

EP2200 Queueing theory and teletraffic systems

Math Tech IIII, Sep 14

Minnesota Academic Standards for Mathematics 2007 Grade 7

Introduction to Queueing Theory for Computer Scientists

Excel 2010 Quick-Start

Grade Descriptors for Maths Years Grade 8 Solve and calculate the value of complex indices including surds

KS4 3 Year scheme of Work Year 10 Higher

Laplace Transform of a Lognormal Random Variable

Characterizing Web Response Time

SIMULATION FUNDAMENTALS

Histogram-Based Density Discovery in Establishing Road Connectivity

Modeling Internet Backbone Traffic at the Flow Level

Overview. Frequency Distributions. Chapter 2 Summarizing & Graphing Data. Descriptive Statistics. Inferential Statistics. Frequency Distribution

R Introduction 1. J.M. Ponciano. August 17, Objects in Splus language include, and. x<-list(ncolors=2,colors=c("red","blue"))

Numerical approach estimate

Outline. No Free Lunch Theorems SMTWTP. Outline DM812 METAHEURISTICS

Introduction to scientific programming in R

AQA Specification Alignment GCSE 2015 / 2016 Exams

This formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go

A Study of the Performance Tradeoffs of a Tape Archive

Scope and Sequence for the New Jersey Core Curriculum Content Standards

Scheduling Algorithms to Minimize Session Delays

Perspectives on Network Calculus No Free Lunch but Still Good Value

Performance Evaluation of Scheduling Mechanisms for Broadband Networks

SAS (Statistical Analysis Software/System)

Chapter 2: Frequency Distributions

QstatLab: software for statistical process control and robust engineering

9-1 GCSE Maths. GCSE Mathematics has a Foundation tier (Grades 1 5) and a Higher tier (Grades 4 9).

Year 9 Maths Overview

INTRODUCTION. Contact us for more detailed information or a demonstration of Pedestrian Dynamics.

Summarizing and mining inverse distributions on data streams via dynamic inverse sampling

Characterizing Internet Load as a Non-regular Multiplex of TCP Streams

Downloaded from

Heathcote School and Science College Assessment Descriptors [Grades 1-9]

Scientific Computing: An Introductory Survey

Year 11 Key Performance Indicators Maths (Number)

Why is Statistics important in Bioinformatics?

Transcription:

Introduction to Modeling and Simulation Simulation Input Data Modeling OSMAN BALCI Professor Department of Computer Science Virginia Polytechnic Institute and State University (Virginia Tech) Blacksburg, VA 24061, USA https://manta.cs.vt.edu/balci Copyright Osman Balci

Review of Probability & Statistics What is a Random Variable? A random variable is a mathematical function that maps outcomes of random experiments to numbers. It can be thought of as the numeric result of operating a non-deterministic mechanism or performing a non-deterministic experiment to generate a random result. For example, a random variable can be used to describe the process of rolling a fair dice and the possible outcomes { 1, 2, 3, 4, 5, 6 }. Another random variable might describe the possible outcomes of picking a random person and measuring his or her height. See http://en.wikipedia.org/wiki/random_variable for more information.

Review of Probability & Statistics What is a Probability Distribution? Every random variable gives rise to a probability distribution. If X is a random variable, the corresponding probability distribution assigns to the interval [a, b] the probability Pr [a X b], i.e. the probability that the variable X will take a value in the interval [a, b]. The probability distribution of the random variable X can be uniquely described by its cumulative distribution function F(x), which is defined as F(x) = Pr [X <= x] where x is a particular value (variate) of the random variable X. See http://en.wikipedia.org/wiki/probability_distribution for more information.

Review of Probability & Statistics Click here to see a comprehensive list of probability distributions. Category Non-negative Continuous Bounded Continuous Unbounded Continuous Discrete Probability Distribution Exponential Gamma Inverse Gaussian Inverted Weibull Log-Laplace Log-Logistic Lognormal Pareto Pearson Type V Pearson Type VI Random Walk Weibull Beta Johnson SB Triangular Uniform Extreme Value Type A Extreme Value Type B Johnson SU Laplace Logistic Normal Binomial Discrete Uniform Geometric Negative Binomial Poisson

Exponential Probability Distribution See http://en.wikipedia.org/wiki/exponential_probability_distribution for more information.

Gamma Probability Distribution See http://en.wikipedia.org/wiki/gamma_distribution for more information.

Beta Probability Distribution See http://en.wikipedia.org/wiki/beta_distribution for more information.

Normal Probability Distribution See http://en.wikipedia.org/wiki/normal_distribution for more information.

Poisson Probability Distribution See http://en.wikipedia.org/wiki/poisson_distribution for more information.

Simulation of Random Phenomenon What is a random phenomenon? Arrivals of vehicles to a traffic intersection Arrivals of passengers to an airport Arrivals of jobs to a computer system Repair times of a machine Cashier service times Number of e-mail packets received per unit time Flight time of an airplane between two cities Time between computer system failures Response time for an e-commerce system How do we characterize / model random phenomenon? Using Simulation Input Data Modeling How do we represent the random phenomenon in our simulation model? Using Random Variate Generation

Simulation Input Data Modeling Trace-Driven Simulation: Requires no modeling. Input data traced from the real operation of the system are used directly. Self-Driven Simulation: Probabilistic modeling of simulation input Collect data on an input variable Fit the collected data to a probability distribution and estimate its parameters (probabilistic modeling) (To do this, use a software product such as ExpertFit.) Sample from the fitted probability distribution using Random Variate Generation to drive the simulation model.

Example Random Phenomenon: Arrivals of vehicles to a lane Random Variable of Interest: Play the Video Inter-arrival times of vehicles to a lane Data Collection and Modeling: 1. Record the arrival times of vehicles to a lane (in seconds): 0, 12, 20, 21, 23, 34, 42, 50, 51, 55, 60, 62, 76, 82, 90, 101, 12 8 1 2 11 8 8 1 4 5 2 14 6 8 11 2. Compute the inter-arrival times: 12, 8, 1, 2, 11, 8, 8, 1, 4, 5, 2, 14, 6, 8, 11, 3. Fit the inter-arrival times to a probability distribution and estimate its parameters, e.g., Exponential with mean = 8 4. Use the Exponential (8) Random Variate Generation to simulate the random phenomenon of vehicle arrivals

Input Data Modeling Approaches Case 1: Data can be collected a. Collected data fit to one of the known probability distributions. Use the Random Variate Generation (RVG) algorithm for that probability distribution. b. Collected data do not fit to one of the known probability distributions. i. If more than 100 independent observations are available, then use the empirical approach for modeling the data. Use a table lookup algorithm for the collected data. ii. If less than 100 independent observations are available, then use the uniform, triangular or beta approach. Case 2: Data cannot be collected a. Use the uniform, triangular or beta approach for input data modeling in the absence of data.

Input Data Modeling in the Absence of Data: Uniform Weighted Average a b weight estimate estimate X Weighted Average Subject Matter Expert (SME) w 1 w 2 w 3 a 1 a 2 a 3 b 1 b 2 b 3 Ask each SME to estimate a and b Weight each SME since one SME can be more knowledgeable than another. w 4 a 4 b 4

Input Data Modeling in the Absence of Data: Uniform Step 1: Identify the random variable of interest, X. Step 2: Identify N Subject Matter Experts (SMEs) with expertise and experience in the problem domain. Step 3: Assign relative criticality weights (weight is a fractional value between 0 and 1; All SME weights must sum to 1) to the SMEs, w j, j=1,2, N Step 4: Ask each SME to subjectively estimate the lowest value, a, for X. a j, j=1,2,,n Step 5: Ask each SME to subjectively estimate the highest value, b, for X. b j, j=1,2,,n Step 6: Use a Uniform probability distribution for X over a and b, where a and b are weighted averages computed as a = a j w j for j = 1,2,,N b = b j w j for j = 1,2,,N

Input Data Modeling in the Absence of Data: Triangular Use a RVG algorithm for the Triangular Probability Distribution Weighted Averages a m b X SME weight estimate estimate estimate w 1 a 1 m 1 b 1 w 2 a 2 m 2 b 2 w 3 a 3 m 3 b 3 w 4 a 4 m 4 b 4

Input Data Modeling in the Absence of Data: Beta a b Step 1: Use the approach for the Uniform distribution to estimate lowest and highest values, a and b. Step 2: Ask each SME to estimate the shape parameters a and b to suggest a distribution of values over the range a to b. Note that a = 1 and b = 1 create a Uniform distribution. Step 3: Use a RVG algorithm for the Beta probability distribution with SME weighted averages for a and b.

Simulation of Random Phenomenon The Probability Distribution identified as the best fit to the collected data becomes the Probabilistic Model of the random phenomenon. The random phenomenon is simulated in the simulation model by using an algorithm, called Random Variate Generator (RVG). Later, we will learn how to develop an RVG to generate random values so as to form the fitted probability distribution with the estimated parameters. Collected Data on the Random Phenomenon Represents Probability Distribution Fitted to the Collected Data Represents Random Values generated by RVG in the simulation model Represents Represents Represents Random Phenomenon