Network Simulation Chapter 6: Output Data Analysis
|
|
- Steven O’Connor’
- 5 years ago
- Views:
Transcription
1 Network Simulation Chapter 6: Output Data Analysis Prof. Dr. Jürgen Jasperneite 1 Contents Introduction Types of simulation output Transient detection When to terminate a simulation 2 Prof. Dr. J ürgen Jasperneite 1
2 Goal of this chapter This chapter looks at two main problems: When is it ok to use measurements made in a simulation program? How to detect that enough measurements have been collected to satisfy accuracy requirements? For both problems, we will Look at the reasons why they arise at all Investigate some automatic procedures to solve them 3 Introduction In many simulation studies a great deal of time and money is spent on model development and programming It is not just a exercise in computer programming! A very common mode of operation is to make a single run of somewhat arbitrary length and then to treat the results as the true model characteristics. 4 Prof. Dr. J ürgen Jasperneite 2
3 Introduction Basic most serious disadvantage of simulation: With a stochastic simulation, don t get exact answers from run. Two different runs of the same model > different numerical results. 5 Random Input: Random numbers Random variates Simulation model/code Random Output: Performance measures Interpreting simulation output: statistical analysis of output data Contents Introduction Types of simulation output Transient detection When to terminate a simulation 6:Output Data Analysis 6 Prof. Dr. J ürgen Jasperneite 3
4 Classification of Simulation studies with respect to Output Analysis System simulated steady-state Analysis Nonterminating transient-state Analysis terminating 7 Types of Simulations with Regard to Output Analysis Terminating: Parameters to be estimated are defined relative to specific initial and stopping conditions that are part of the model There is a natural and realistic way to model both the initial and stopping conditions Output performance measures generally depends on both the initial and stopping conditions Example Bank opens each day at 0900 and closes at Initial condition: no customer Terminating event: departure of last customer 8 Prof. Dr. J ürgen Jasperneite 4
5 Types of Simulations with Regard to Output Analysis Non-terminating: There is no natural and realistic event that terminates the model Interested in long-run behavior characteristic of normal operation the steady-state behaviour is of interest Theoretically, does not depend on initial conditions Practically, must ensure that run is long enough so that initialcondition effects have dissipated. Example Any continuously running system e.g. Computer centre, traffic system,... Difficulties with non-terminating simulations: Initial bias How long to run the simulation 9 Contents Introduction Types of simulation output Transient detection When to terminate a simulation 10 Prof. Dr. J ürgen Jasperneite 5
6 Transient Removal In most simulations, only the steady-state performance is of interest. Steady state means the system reached a stable state (equilibrium). Results of initial part should not be included > transient state. Problem: transient removal 11 Transient Removal How to find the initial Part? No exact definitions: >Heuristics Proper initialization Initial data deletion Moving average of independent replications Batch means Long runs Truncation 12 Prof. Dr. J ürgen Jasperneite 6
7 Transient Removal Long Runs Assumption: The runs are long enough that the presence of initial conditions will not affect the result. wastes ressources Difficulty of determine what is long enough! Do not use this in practice Truncation Assumption: The variability during steady-state is less than that during the transient state. Given a sample of n observations {x 1, x 2,...x n }, ignore the first l observations and then calculate the min, max of the remaining n-l observations. Repeat this for l =1,2,..., n-1 until the (l+1)th observation is neither the min nor the max of the remaining observations. The value of l at this point gives the length of the transient state. 13 Transient Removal Example: Consider the observations: 1,2,3,4,5,6,7,8,9,10,11,10,9,10,11,10,9,10,11,10,9.. Ignoring the first observation (l=1), the range of the remaining values is (2,11). Since the 2nd. Value is equal to the Min, the transient phase is longer than 1. Ignoring the first two observations (l=2), the range is now (3,11). Again the next (3rd) value is equal to Min. Finally, at l=9 the range is (9,11) and the (l+1) value (10th) is neither the Min nor the Max. > transient length is 9 and the first nine values are discarded. Value Transient interval Observation number i Prof. Dr. J ürgen Jasperneite 7
8 Contents Introduction Types of simulation output Transient detection When to terminate a simulation 15 Terminating Simulations Again: A majority of simulations are such that steady-state performance is of interest. There are systems that never reach a steady-state. These systems always operate under transient conditions. Example: bursty network traffic Prof. Dr. J ürgen Jasperneite 8
9 Stopping Criteria: Variance Estimation It is important, that the length of the simulation be properly chosen. If the runs too short, the results may be highly variable. If the runs too long, ressources may be wasted The simulation should be run until the CI for the mean narrows to a desired width. (Do you remember?) Only valid if the observations are independent! Unfortunately the output of most simulations are not independent! Example: In a queueing system, if the waiting time for the i-th job is large, the waiting time for the (i+1)-th job would be large too and vice versa. 17 Stopping Criteria: Variance Estimation To compute the variance of means of correlated observations a number of method exists: Independent replications Method of Regeneration Batch means 18 Prof. Dr. J ürgen Jasperneite 9
10 Method of Regeneration Queue length Regeneration points Time 19 by Crane and Iglehart (1974) and Fishman (1973) Stopping Criteria: Variance Estimation Batch Means Requires running a very long simulation, discard the initial transient interval and later divide it up into several parts of equal duration. Each part is called a batch or subsample. The mean of observations in each batch is called the batch mean. Method requires studying the variance of these batch means as a function of the batch size. 20 Prof. Dr. J ürgen Jasperneite 10
11 Stopping Criteria: Variance Estimation A long run of M observations can be divided into n batches of size k each, with n M / k 1. For each batch, compute a batch mean: 1 k k j 1 xi x ij Compute the overall mean: 1 n xi n i 1 x 3. Compute the variance of the batch means: n 1 Var ( x) ( xi x ) n 1 i 1 2 Stopping Criteria: Variance Estimation 22 The confidence interval for the mean is 1) Var ( x) [ x z 1 / 2 ] n The computation is essentially the same as in the method of independent replications. The batch size k must be large, so that the batch means have litte correlation. One way to find k is to compute the autocovariance of successive batch means: 1 Cov x x x x x x n 2 n 1 ( i, i 1 ) ( i )( i 1 ) i 1 Hence: Increase (e.g., double) batch size until Cov is small compared to their variance (less than 1%). 1) If n< 30 use the t-student distribution Prof. Dr. J ürgen Jasperneite 11
12 Application of this method Queue Size Number of Samples: Batch Size Auto-COV Variance Batch Mean Number of batches 1 3,992 4,28 1, ,478 4,038 1, ,7 3,69 1, ,754 3,12 1, ,9259 2,317 1, ,323 1,539 1, ,0026 0,8492 1, ,1284 0,4313 1, ,0122 0,045 1, , ,0172 1,89 7 Auto-COV becomes less than 1 % of the sample variance at a batch-size of End of this lecture After finishing the lab you should... know about simulation principles (in particular, the so-called discrete event simulation) be able to build models for such systems be able to identify suitable performance metrics be familiar with basic statistical have some experience with a modern simulation tool 7: Th e end 24 Prof. Dr. J ürgen Jasperneite 12
13 End of this lecture 7: The end 1. Basic Simulation Modeling Systems, Models (continuous/discrete) Discrete event simulation time advance mechanism, principle, architecture 2. OPNET IT Guru - A Tool for Discrete Event Simulation 3. Review of Basic Probabilities and Statistics Terminology (pmf, distribution function, pdf, cdf) Mean, variance, expected value Confidence Interval, quantile Determining the sample size 4. Building valid, credible Simulation Models Difference between Validation, Verification, Best practice techniques for computer programs Techniques for increasing Model Validity and Credibility 25 End of this lecture 5. Traffic Modeling Trace-driven, empirical distributions Goodness of fit tests Histograms, qq-plots 6. Output Data Analysis Terminating, non-terminating, steady-state, transient removal Stopping criteria: variance estimation 7: Th e end 26 Prof. Dr. J ürgen Jasperneite 13
14 End of this lecture Any questions? 7: The end 27 Prof. Dr. J ürgen Jasperneite 14
CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Quote of the Day A person with one watch knows what time it is. A person with two
More informationNetwork Simulation Chapter 5: Traffic Modeling. Chapter Overview
Network Simulation Chapter 5: Traffic Modeling Prof. Dr. Jürgen Jasperneite 1 Chapter Overview 1. Basic Simulation Modeling 2. OPNET IT Guru - A Tool for Discrete Event Simulation 3. Review of Basic Probabilities
More informationB. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (1)
B. Maddah INDE 504 Discrete-Event Simulation Output Analysis (1) Introduction The basic, most serious disadvantage of simulation is that we don t get exact answers. Two different runs of the same model
More informationOverall Plan of Simulation and Modeling I. Chapters
Overall Plan of Simulation and Modeling I Chapters Introduction to Simulation Discrete Simulation Analytical Modeling Modeling Paradigms Input Modeling Random Number Generation Output Analysis Continuous
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 0 Output Analysis for a Single Model Purpose Objective: Estimate system performance via simulation If θ is the system performance, the precision of the
More informationChapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model
Chapter Output Analysis for a Single Model. Contents Types of Simulation Stochastic Nature of Output Data Measures of Performance Output Analysis for Terminating Simulations Output Analysis for Steady-state
More informationAnalyzing Simulation Results
Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient
More informationEEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org (based on Dr. Raj Jain s lecture
More informationOutline. Simulation of a Single-Server Queueing System. EEC 686/785 Modeling & Performance Evaluation of Computer Systems.
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Outline Simulation of a Single-Server Queueing System Review of midterm # Department of Electrical and Computer Engineering
More informationOutput Analysis for a Single Model
Output Analysis for a Single Model Output Analysis for a Single Model Output analysis is the examination of data generated by a simulation. Its purpose is to predict the performance of a system or to compare
More information14 Random Variables and Simulation
14 Random Variables and Simulation In this lecture note we consider the relationship between random variables and simulation models. Random variables play two important roles in simulation models. We assume
More informationDiscrete-Event System Simulation
Discrete-Event System Simulation FOURTH EDITION Jerry Banks Independent Consultant John S. Carson II Brooks Automation Barry L. Nelson Northwestern University David M. Nicol University of Illinois, Urbana-Champaign
More information2WB05 Simulation Lecture 7: Output analysis
2WB05 Simulation Lecture 7: Output analysis Marko Boon http://www.win.tue.nl/courses/2wb05 December 17, 2012 Outline 2/33 Output analysis of a simulation Confidence intervals Warm-up interval Common random
More informationSlides 12: Output Analysis for a Single Model
Slides 12: Output Analysis for a Single Model Objective: Estimate system performance via simulation. If θ is the system performance, the precision of the estimator ˆθ can be measured by: The standard error
More informationEE/PEP 345. Modeling and Simulation. Spring Class 11
EE/PEP 345 Modeling and Simulation Class 11 11-1 Output Analysis for a Single Model Performance measures System being simulated Output Output analysis Stochastic character Types of simulations Output analysis
More informationChapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 11 Output Analysis for a Single Model Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Objective: Estimate system performance via simulation If q is the system performance,
More informationSimulation. Where real stuff starts
1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?
More informationRedacted for Privacy
AN ABSTRACT OF THE THESIS OF Lori K. Baxter for the degree of Master of Science in Industrial and Manufacturing Engineering presented on June 4, 1990. Title: Truncation Rules in Simulation Analysis: Effect
More informationConstruction Operation Simulation
Construction Operation Simulation Lecture #8 Output analysis Amin Alvanchi, PhD Construction Engineering and Management Department of Civil Engineering, Sharif University of Technology Outline 2 Introduction
More informationChapter 11 Estimation of Absolute Performance
Chapter 11 Estimation of Absolute Performance Purpose Objective: Estimate system performance via simulation If q is the system performance, the precision of the estimator qˆ can be measured by: The standard
More informationOutput Data Analysis for a Single System
Output Data Analysis for a Single System Chapter 9 Based on the slides provided with the textbook 2 9.1 Introduction Output data analysis is often not conducted appropriately Treating output of a single
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Simulation with a given accuracy; Variance reduction techniques;
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ http://www.cs.tut.fi/kurssit/tlt-2706/ OUTLINE: Simulation with a given confidence;
More informationAnalysis of Simulated Data
Analysis of Simulated Data Media Media di una popolazione: somma di tutti i valori delle variabili della popolazione diviso il numero di unità della popolazione (N) µ N i= = 1 N X i Dove: - N = numero
More informationSimulation. Where real stuff starts
Simulation Where real stuff starts March 2019 1 ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3
More informationCPSC 531 Systems Modeling and Simulation FINAL EXAM
CPSC 531 Systems Modeling and Simulation FINAL EXAM Department of Computer Science University of Calgary Professor: Carey Williamson December 21, 2017 This is a CLOSED BOOK exam. Textbooks, notes, laptops,
More informationInitial Transient Phase of Steady state Simulation: Methods of Its Length Detection and Their Evaluation in Akaroa2
Initial Transient Phase of Steady state Simulation: Methods of Its Length Detection and Their Evaluation in Akaroa2 A Thesis Submitted in Partial Fulfilment of the Requirement for the Degree of Master
More information6 Solving Queueing Models
6 Solving Queueing Models 6.1 Introduction In this note we look at the solution of systems of queues, starting with simple isolated queues. The benefits of using predefined, easily classified queues will
More informationSEQUENTIAL ESTIMATION OF THE STEADY-STATE VARIANCE IN DISCRETE EVENT SIMULATION
SEQUENTIAL ESTIMATION OF THE STEADY-STATE VARIANCE IN DISCRETE EVENT SIMULATION Adriaan Schmidt Institute for Theoretical Information Technology RWTH Aachen University D-5056 Aachen, Germany Email: Adriaan.Schmidt@rwth-aachen.de
More informationMore on Input Distributions
More on Input Distributions Importance of Using the Correct Distribution Replacing a distribution with its mean Arrivals Waiting line Processing order System Service mean interarrival time = 1 minute mean
More informationDiscrete Event Simulation IN2045
Chair for Network Architectures and Services Prof. Carle Department of Computer Science TU München Discrete Event Simulation IN2045 Dipl.-Inform. Alexander Klein Dr. Nils Kammenhuber Prof. Dr.-Ing Georg
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
More information1.225J J (ESD 205) Transportation Flow Systems
1.225J J (ESD 25) Transportation Flow Systems Lecture 9 Simulation Models Prof. Ismail Chabini and Prof. Amedeo R. Odoni Lecture 9 Outline About this lecture: It is based on R16. Only material covered
More informationSince D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.
IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationSequential Analysis of Quantiles and Probability Distributions by Replicated Simulations
Wednesday 18 th July, 2007 Sequential Analysis of Quantiles and Probability Distributions by Replicated Simulations A thesis submitted in partial fulfilment of the requirements for the Degree of Doctor
More informationSIMULATION OUTPUT ANALYSIS
1 / 64 SIMULATION OUTPUT ANALYSIS Dave Goldsman School of ISyE Georgia Tech Atlanta, Georgia, USA sman@gatech.edu www.isye.gatech.edu/ sman April 15, 2016 Outline 1 Introduction 2 Finite-Horizon Simulation
More informationSequential Estimation of Quantiles
Sequential Estimation of Quantiles Jong-Suk R. Lee, Donald McNickle and Krzysztof P awlikowski Department of Computer Science and Department of Management University of Canterbury Christchurch, New Zealand
More informationOutput Data Analysis for a Single System
CHAPTER 9 Output Data Analysis for a Single System 9.1 Introduction... 9. Transient and Steady-State Behavior of a Stochastic Process...10 9.3 Types of Simulations with Regard to Output Analysis...1 9.4
More informationSIMULATION OUTPUT ANALYSIS
1 / 71 SIMULATION OUTPUT ANALYSIS Dave Goldsman School of ISyE Georgia Tech Atlanta, Georgia, USA sman@gatech.edu www.isye.gatech.edu/ sman 10/19/17 2 / 71 Outline 1 Introduction 2 A Mathematical Interlude
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More informationCOSC460 Honours Report: A Sequential Steady-State Detection Method for Quantitative Discrete-Event Simulation
COSC460 Honours Report: A Sequential Steady-State Detection Method for Quantitative Discrete-Event Simulation December 1, 2012 Adam Freeth afr58@uclive.ac.nz Department of Computer Science and Software
More informationLecture 26: Chapter 10, Section 2 Inference for Quantitative Variable Confidence Interval with t
Lecture 26: Chapter 10, Section 2 Inference for Quantitative Variable Confidence Interval with t t Confidence Interval for Population Mean Comparing z and t Confidence Intervals When neither z nor t Applies
More informationARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS
Proceedings of the 2013 Winter Simulation Conference R. Pasupathy, S.-H. Kim, A. Tolk, R. Hill, and M. E. Kuhl, eds. ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS Emily K. Lada
More informationARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS
ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS Emily K. Lada Anup C. Mokashi SAS Institute Inc. 100 SAS Campus Drive, R5413 Cary, NC 27513-8617, USA James R. Wilson North Carolina
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationHEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES
HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES by Peter W. Glynn Department of Operations Research Stanford University Stanford, CA 94305-4022 and Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636
More informationStatistics 3657 : Moment Approximations
Statistics 3657 : Moment Approximations Preliminaries Suppose that we have a r.v. and that we wish to calculate the expectation of g) for some function g. Of course we could calculate it as Eg)) by the
More informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationAN ABSTRACT OF THE THESIS OF. Industrial and Manufacturing Engineering presented on December
AN ABSTRAT OF THE THESIS OF Budiman Saleh for the degree of Master of Science in Industrial and Manufacturing Engineering presented on December 12, 1991. Title : Steadv-State Analysis in Simulation : An
More informationContents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii
LIST OF TABLES... xv LIST OF FIGURES... xvii LIST OF LISTINGS... xxi PREFACE...xxiii CHAPTER 1. PERFORMANCE EVALUATION... 1 1.1. Performance evaluation... 1 1.2. Performance versus resources provisioning...
More informationBasic matrix operations
Roberto s Notes on Linear Algebra Chapter 4: Matrix algebra Section 3 Basic matrix operations What you need to know already: What a matrix is. he basic special types of matrices What you can learn here:
More informationNEW ESTIMATORS FOR PARALLEL STEADY-STATE SIMULATIONS
roceedings of the 2009 Winter Simulation Conference M. D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin, and R. G. Ingalls, eds. NEW ESTIMATORS FOR ARALLEL STEADY-STATE SIMULATIONS Ming-hua Hsieh Department
More informationIntroduction to Design of Experiments
Introduction to Design of Experiments Jean-Marc Vincent and Arnaud Legrand Laboratory ID-IMAG MESCAL Project Universities of Grenoble {Jean-Marc.Vincent,Arnaud.Legrand}@imag.fr November 20, 2011 J.-M.
More information7 Variance Reduction Techniques
7 Variance Reduction Techniques In a simulation study, we are interested in one or more performance measures for some stochastic model. For example, we want to determine the long-run average waiting time,
More informationChapter 2 SIMULATION BASICS. 1. Chapter Overview. 2. Introduction
Chapter 2 SIMULATION BASICS 1. Chapter Overview This chapter has been written to introduce the topic of discreteevent simulation. To comprehend the material presented in this chapter, some background in
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 9 Verification and Validation of Simulation Models Purpose & Overview The goal of the validation process is: To produce a model that represents true
More informationSummarizing Measured Data
Summarizing Measured Data 12-1 Overview Basic Probability and Statistics Concepts: CDF, PDF, PMF, Mean, Variance, CoV, Normal Distribution Summarizing Data by a Single Number: Mean, Median, and Mode, Arithmetic,
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationStochastic Simulation Discrete simulation/event-by-event
Stochastic Simulation Discrete simulation/event-by-event Bo Friis Nielsen Institute of Mathematical Modelling Technical University of Denmark 2800 Kgs. Lyngby Denmark Email: bfni@dtu.dk Discrete event
More informationQueueing Theory and Simulation. Introduction
Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan
More informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More informationNATCOR: Stochastic Modelling
NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control
More informationQueueing Theory. VK Room: M Last updated: October 17, 2013.
Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server
More informationLecturer: Olga Galinina
Lecturer: Olga Galinina E-mail: olga.galinina@tut.fi Outline Motivation Modulated models; Continuous Markov models Markov modulated models; Batch Markovian arrival process; Markovian arrival process; Markov
More informationMEDIAN CONFIDENCE INTERVALS -GROUPING DATAINTO BATCHES AND COMPARISON WITH OTHER TECHNIQUES
MEDIAN CONFIDENCE INTERVALS -GROUPING DATAINTO BATCHES AND COMPARISON WITH OTHER TECHNIQUES Johann Christoph Strelen Rheinische Friedrich Wilhelms Universität Bonn Römerstr. 164, 53117 Bonn, Germany E-mail:
More informationSimulation of stationary processes. Timo Tiihonen
Simulation of stationary processes Timo Tiihonen 2014 Tactical aspects of simulation Simulation has always a goal. How to organize simulation to reach the goal sufficiently well and without unneccessary
More informationRemedial Measures, Brown-Forsythe test, F test
Remedial Measures, Brown-Forsythe test, F test Dr. Frank Wood Frank Wood, fwood@stat.columbia.edu Linear Regression Models Lecture 7, Slide 1 Remedial Measures How do we know that the regression function
More informationREAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY SUPPLEMENTARY MATERIAL
REAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY SUPPLEMENTARY MATERIAL by Rouba Ibrahim and Ward Whitt IEOR Department Columbia University {rei2101, ww2040}@columbia.edu Abstract Motivated by interest
More informationPERFORMANCE COMPARISON OF MSER-5 AND N-SKART ON THE SIMULATION START-UP PROBLEM
Proceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. PERFORMACE COMPARISO OF MSER-5 AD -SKART O THE SIMULATIO START-UP PROBLEM Anup
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationChapter 2 Queueing Theory and Simulation
Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,
More informationMath489/889 Stochastic Processes and Advanced Mathematical Finance Solutions for Homework 7
Math489/889 Stochastic Processes and Advanced Mathematical Finance Solutions for Homework 7 Steve Dunbar Due Mon, November 2, 2009. Time to review all of the information we have about coin-tossing fortunes
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationStochastic Simulation of Communication Networks and their Protocols
Stochastic Simulation of Communication Networks and their Protocols Dr.-Ing Umar Toseef umr@comnets.uni-bremen.de Prof. Dr. C. Görg www.comnets.uni-bremen.de VSIM 1-1 Table of Contents 1 General Introduction
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationA SPACED BATCH MEANS PROCEDURE FOR SIMULATION ANALYSIS
Proceedings of the 2007 Winter Simulation Conference S. G. Henderson, B. Biller, M.-H. Hsieh, J. Shortle, J. D. Tew, and R. R. Barton, eds. SBatch: A SPACED BATCH MEANS PROCEDURE FOR SIMULATION ANALYSIS
More informationChapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations
Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models
More informationChapter 5 Random vectors, Joint distributions. Lectures 18-23
Chapter 5 Random vectors, Joint distributions Lectures 18-23 In many real life problems, one often encounter multiple random objects. For example, if one is interested in the future price of two different
More informationISyE 6644 Fall 2014 Test 3 Solutions
1 NAME ISyE 6644 Fall 14 Test 3 Solutions revised 8/4/18 You have 1 minutes for this test. You are allowed three cheat sheets. Circle all final answers. Good luck! 1. [4 points] Suppose that the joint
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationProfessor Terje Haukaas University of British Columbia, Vancouver System Reliability
System Reliability This material was first described to me in a course taught by Professor Armen Der iureghian at the University of California at Berkeley. In 2005 he made an excellent description available
More informationOutline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.
Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]
More informationIE 581 Introduction to Stochastic Simulation. Three pages of hand-written notes, front and back. Closed book. 120 minutes.
Three pages of hand-written notes, front and back. Closed book. 120 minutes. 1. SIMLIB. True or false. (2 points each. If you wish, write an explanation of your thinking.) (a) T F The time of the next
More informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
More informationChem 321 Lecture 5 - Experimental Errors and Statistics 9/10/13
Chem 321 Lecture 5 - Experimental Errors and Statistics 9/10/13 Student Learning Objectives Experimental Errors and Statistics Calibration Results for a 2.0-mL Transfer Pipet 1.998 ml 1.991 ml 2.001 ml
More informationSummarizing Measured Data
Summarizing Measured Data Dr. John Mellor-Crummey Department of Computer Science Rice University johnmc@cs.rice.edu COMP 528 Lecture 7 3 February 2005 Goals for Today Finish discussion of Normal Distribution
More informationDesign of Experiments Part 3
Design of Experiments Part 3 Dr. Bob Gee Dean Scott Bonney Professor William G. Journigan American Meridian University 1 DOE for Variation Traditional DOE evaluates significant differences in the average
More informationReminders. Thought questions should be submitted on eclass. Please list the section related to the thought question
Linear regression Reminders Thought questions should be submitted on eclass Please list the section related to the thought question If it is a more general, open-ended question not exactly related to a
More informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationStochastic Models in Computer Science A Tutorial
Stochastic Models in Computer Science A Tutorial Dr. Snehanshu Saha Department of Computer Science PESIT BSC, Bengaluru WCI 2015 - August 10 to August 13 1 Introduction 2 Random Variable 3 Introduction
More informationGlossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP
Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into
More informationPAC Learning. prof. dr Arno Siebes. Algorithmic Data Analysis Group Department of Information and Computing Sciences Universiteit Utrecht
PAC Learning prof. dr Arno Siebes Algorithmic Data Analysis Group Department of Information and Computing Sciences Universiteit Utrecht Recall: PAC Learning (Version 1) A hypothesis class H is PAC learnable
More informationStochastic Simulation of Communication i Networks
Stochastic Simulation of Communication i Networks and their Protocols - WS 2014/2015 Dr. Xi Li Prof. Dr. Carmelita Görg xili cg@comnets.uni-bremen.de Prof. Dr. C. Görg www.comnets.uni-bremen.de VSIM 1-1
More informationThe bootstrap. Patrick Breheny. December 6. The empirical distribution function The bootstrap
Patrick Breheny December 6 Patrick Breheny BST 764: Applied Statistical Modeling 1/21 The empirical distribution function Suppose X F, where F (x) = Pr(X x) is a distribution function, and we wish to estimate
More informationACCOUNTING FOR INPUT-MODEL AND INPUT-PARAMETER UNCERTAINTIES IN SIMULATION. <www.ie.ncsu.edu/jwilson> May 22, 2006
ACCOUNTING FOR INPUT-MODEL AND INPUT-PARAMETER UNCERTAINTIES IN SIMULATION Slide 1 Faker Zouaoui Sabre Holdings James R. Wilson NC State University May, 006 Slide From American
More informationEngineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 2262 MATERIAL NAME : University Questions MATERIAL CODE : SKMA104 UPDATED ON : May June 2013 Name of the Student: Branch: Unit I (Random Variables)
More informationHomework 4 Math 11, UCSD, Winter 2018 Due on Tuesday, 13th February
PID: Last Name, First Name: Section: Approximate time spent to complete this assignment: hour(s) Homework 4 Math 11, UCSD, Winter 2018 Due on Tuesday, 13th February Readings: Chapters 16.6-16.7 and the
More information