Stochastic Simulation of Communication i Networks

Size: px
Start display at page:

Download "Stochastic Simulation of Communication i Networks"

Transcription

1 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 VSIM 1-1

2 Table of Contents 1 General Introduction 2 Random Number Generation 3 Statistical i Evaluation 4 ComNets Class Library (CNCL) 5 OPNET 6 Network Simulator (ns) 7 SDL + OpenWNS 8 Simulation Speed-Up Methods Prof. Dr. C. Görg VSIM 1-2

3 Discussion (5 minutes) What is simulation? How long is the history of simulation? i Why simulations? What is the crucial question of simulation? Prof. Dr. C. Görg VSIM 1-3

4 Overview ew What is simulation? Why simulations? Classification of simulations Discrete Event Simulation (DES) Event Scheduling Random Number Generation Statistical Evaluation Simulation systems and applications Prof. Dr. C. Görg VSIM 1-4

5 References P. Bratley, B.L. Fox, L.E. Schrage: A Guide to Simulation. Springer 1983, B.P. Zeigler, H. Praehofer, T.G. Kim: Theory of Modeling and Simulation, Academic Press 1976, D. Möller: Modellbildung, Simulation und Identifikation dynamischer Systeme. Springer Lehrbuch R.Y. Rubinstein, B. Melamed: Modern Simulation and Modeling. Wiley Series in Probability and Statistics P.A.W. Lewis, E.J. Orav: Simulation Methodology for Statisticians, Operation Analysts, and Engineers. Vol. 1. Wadsworth Prof. Dr. C. Görg VSIM 1-5

6 References G.S. Fishman: Principles of Discrete Event Simulation. J. Wiley and Sons. New York, A.M. Law, W.D. Kelton: Simulation Modeling & Analysis. McGraw-Hill, Kreutzer, W.: System Simulation - Programming Styles and Languages, Addison Wesley Publishers - Reading (U.S.A.) L. Devroye: Non-Uniform Random Variate Generation. Springer, New York, Prof. Dr. C. Görg VSIM 1-6

7 Web References Prof. Dr. C. Görg VSIM 1-7

8 Historical Development Pre-computer era, e.g.: Buffon (1777) coin experiments, 4040 trials Pearson ( ) trials Kendall (approx. 1938): random number generation using the London telephone directory Von Neumann (1944): Monte Carlo Method for the calculation of complex formulas in nuclear physics : 1956 traffic machines simulation of telephone systems Prof. Dr. C. Görg VSIM 1-8

9 Historical Development Development of special simulation languages GPSS (IBM, 1961, General Purpose Simulation System) SIMULA (class concept, Norwegian Computing Center, 1963, Simula 67) SIMSCRIPT (based on FORTRAN) RAN) Development of special multiprocessor simulators network structure (Chandy 1981) function oriented structure (Lehnert 1979, Barel 1983) Prof. Dr. C. Görg VSIM 1-9

10 Random Experiments and their Application Areas Stochastic Simulation i of Complex Systems Computer Random Experiments Improved Simulation Control by New Evaluation Methods Modeling and Validation of Statistical Concepts Prof. Dr. C. Görg VSIM 1-10

11 Communication Network Examples e.g. Stop & Wait Protocol WLAN MAC Protocol Ad hoc networks TCP/IP Protocols HSDPA Protocols... Prof. Dr. C. Görg VSIM 1-11

12 Evaluation Goals Goal of the study of systems or their models is the evaluation of some characteristics ti of the system Gain insight into system operation on a more conceptual level Compare two systems with respect to particular metrics Tune system behavior for specific situations Judge a priori the effects of reconfiguration/upgrading Reduce costs Prof. Dr. C. Görg VSIM 1-12

13 Ways to study a system System Experiment with the actual system Experiment with a system model Physical Model Mathematical Model Analytical Solution Simulation Prof. Dr. C. Görg VSIM 1-13

14 What is simulation? simulation is imitation has been used for many years to train, explain, evaluate and entertain the facility or process of interest is usually called a system the assumptions, which usually take the form of mathematical or logical relationships, constitute a model simulations and their models are abstractions of reality Prof. Dr. C. Görg VSIM 1-14

15 Why Simulations? Extensively used to verify the correctness of designs Realistic models are often too complex to evaluate analytically y The simulation approach gives more flexibility and convenience Accelerates and replaces effectively the "wait and see" anxieties Safely plays out the "what-if" scenario from the artificial world Prof. Dr. C. Görg VSIM 1-15

16 Real System Planned System Modeling Model Measurement Simulation Analytic Calculation Result Result Result Validation Realize Modify planned Planned system System Performance Evaluation Cycle Prof. Dr. C. Görg VSIM 1-16

17 Simulation Classification dynamic static discrete continuous hybrid stochastic ti deterministic i ti event driven transaction driven activity oriented Prof. Dr. C. Görg VSIM 1-17

18 Classification of Simulations 1. Static vs. Dynamic Simulation models Static model: representation of a system st at a particular time, or a system st in which time simply plays no role. Example: Monte Carlo model Dynamic model: represents a system as it evolves over time. Example: a WLAN network Prof. Dr. C. Görg VSIM 1-18

19 Classification of Simulations 2. Deterministic vs. Stochastic Simulation Models Deterministic model: If a simulation model does not contain any yprobabilistic (i.e., random) components, it is called deterministic. Example: a system of differential equations describing a chemical reaction might be such a model. Stochastic model: Many systems, however, must be modeled as having at least some random input components, and these give rise to stochastic simulation models. Example: Most queueing and inventory systems are modeled stochastically. Prof. Dr. C. Görg VSIM 1-19

20 Classification of Simulations 3. Continuous vs. discrete time Simulation models Defined analogous to the way discrete and continuous systems are defined, i.e., a discrete system is one in which the state variables change instantaneously at separated points in time, and in a continuous system the state variables change continuously with respect to time. It is important to mention that a discrete model is not always used to model a discrete system, and vice-versa. Prof. Dr. C. Görg VSIM 1-20

21 Classification of Simulations Prof. Dr. C. Görg VSIM 1-21

22 Application Areas Determining hardware requirements or protocols for communication networks Determining hardware and software requirements for a computer system Designing and analyzing logistic systems (manufacturing and transport) Designing and operating transportation systems such as airports, freeways, ports and sub-ways Evaluating designs for service organizations such as call centers, fast-food restaurants, hospitals, post offices, gas stations, Re-engineering of business processes Evaluating military systems or their logistic requirements... Prof. Dr. C. Görg VSIM 1-22

23 Drawbacks No exact answers, only approximations Get random output from stochastic simulations, careful output analysis necessary as standard statistical methods might not work Development of the model takes a lot of time Prof. Dr. C. Görg VSIM 1-23

24 Discrete-Event Simulation (DES) State variables change instantaneously at separate points in time State transitions are triggered by events Thus, simulation models considered here are discrete-event, t dynamic and stochastic ti Example: CNCL (Communication Network Class Library)- a portable C++ library providing a base for all C++ applications Prof. Dr. C. Görg VSIM 1-24

25 The Principle of DES Observe the model only at the points in time when the state of the model changes These points in time are explicitly represented by the simulation clock variable and are called events In between two events, nothing happens to the state of the model, hence one can advance time from one event to the next, checking to see which kind of event would be the next one This is the essence of the next-event time advance algorithm Prof. Dr. C. Görg VSIM 1-25

26 Detail of the event approach structure t (from Kreutzer 1986) Prof. Dr. C. Görg VSIM 1-26

27 Next-event time advance algorithm Initialize simulation clock to 0 Determine time of occurrence of future events stored in the future event list As long as there are events to be processed Increment the simulation clock to the time of the next, most imminent event Update the system state as required by the occurrence of this event Compute times for future events Prof. Dr. C. Görg VSIM 1-27

28 (Future) Event List also called SQS (sequencing set) in Simula t 1 t 2 t n t 1 t 2 t n E 1 E 2 E n time t Prof. Dr. C. Görg VSIM 1-28

29 Event List The event list controls the simulation It contains all the future events (FEL) that are scheduled It is ordered by increasing time of event scheduler Events can be categorized as primary and conditional events E.g.: CNEventHandler, CNEventScheduler, etc. in CNCL Simulation at Mensa t1 arrival t2 service completion at cashier 2 t 3 Some state variables People in line 1 People at meal line 1&2 People at cashier 1&2 People eating at tables service completion at meal 1 t4 finish eating t5 finish eating Prof. Dr. C. Görg VSIM 1-29

30 Discrete Event Simulation: Model Time and Processing Time List of Events t 1, E 1 t 2, E 2 t 3, E 3 t 1 :E 1 t 2 :E 2 t 3 :E 3 model time = simulation time e.g., h, ms, μs T s T E 1 T s T E 2 T s T E 3 t i : event / (process) planning time E i : event routine resp. process T s : administration time T s T E i : processing time event E i e.g., ms, μs processing time = CPU time Prof. Dr. C. Görg VSIM 1-30

31 G/G/1 Model Arrival (λ a ) Server (λ b ) b 1 b FIFO- Queue Prof. Dr. C. Görg VSIM 1-31

32 Discrete Event Simulations Example: A simple queuing system Prof. Dr. C. Görg VSIM 1-32

33 System Terminology State: A variable characterizing an attribute in the system, e.g., number of jobs waiting for processing or level of stock in inventory systems Event: An occurrence at a point in time which may change the state of the system, e.g., arrival of a customer or start of work on a job Entity: An object that passes through the system, e.g., jobs in the queue or orders in a factory. Often an event (e.g., arrival) is associated with an entity (e.g., customer). Queue: A queue is not only a physical queue of people, but any place where entities are waiting to be processed Prof. Dr. C. Görg VSIM 1-33

34 System Terminology Creating: Creating is causing an arrival of a new entity to the system at some point in time Scheduling: Scheduling is the act of assigning i a new future event to an existing entity Random Variable: A random variable is a quantity that is uncertain Interarrival time between two incoming gj jobs (e.g. message, flights, number of defective parts in a shipment) Random Variate: A random variate is an artificially generated random variable Distribution: Distribution A distribution is the mathematical law which governs the probabilistic features of a random variable E.g. negative exponential or normal distribution ib ti Prof. Dr. C. Görg VSIM 1-34

35 Steps of a Simulation Problem Formulation Identify controllable and uncontrollable inputs Identify constraints on the decision variables Define measure of system performance and an objective function Develop a preliminary model structure to interrelate the inputs and the measure of performance Controllable Input System Output Uncontrollable Input (from the outside world) Prof. Dr. C. Görg VSIM 1-35

36 Steps of the Simulation Descriptive Analysis Data Collection and Analysis of Input Variables Computer Simulation Model Development Validation i and finally Performance Evaluation Pre-scriptive Analysis: Optimization or Goal Seeking Post-prescriptive Analysis: Sensitivity and What-If Analysis Prof. Dr. C. Görg VSIM 1-36

37 Steps in a Simulation Study Problem formulation Set objectives and plans Conceptual model Validation Collect data Create simulation model Documentation and report Production runs and analysis Experimental design Prof. Dr. C. Görg VSIM 1-37

38 Structure of a Simulation System (adapted from Kreutzer 1986) Prof. Dr. C. Görg VSIM 1-38

39 Example: Simulation Introduction Assume the example of a gas station (or super market, doctor s office, ) Why do we simulate? What does the model of the gas station look like? Make a diagram of the model identifying the system components. Name the parameters needed to characterize the system. Which results could be obtained by the simulation? How can you best model a queue on a computer and why? What would an implementation look like? What is the difference between a queue and a list? Which functions are needed for a queue (list)? Is the model of the gas station a good mapping of the real system? What potential improvements are possible? Describe a traffic model for the gas station model? Which additional parameters are needed? Why are event-oriented systems usually preferred to other systems (e.g. periodic)? What are the advantages? Name the events in the simulation i of the gas station. Describe the idealized usage of simulation for the introduction of a new (mobile) communication network. Prof. Dr. C. Görg VSIM 1-39

40 Exercise 1: Probability and Correlation 1. The cumulative distribution function (cdf) (Verteilungsfunktion) F X (x) of a random variable (RV) X resp. the probability density function (pdf) f X (x) is defined as: w F ( w) P{ X w} f ( x) dx X resp. f X ( x) X dfx ( x ) dx A random variable is defined: X = 10i where i stands for all possible realizations of a random experiment tossing a fair die. Draw the cdf and the pdf of this experiment! Prof. Dr. C. Görg VSIM 1-40

41 Exercise 1.2 (cont.) Distributions can be characterized by their moments. The most prominent moments are expectation (Erwartungswert) (mean, Mittelwert) and variance (Varianz), that are a measure for the distribution of the samples s (Stichprobenwerte) rt ) around the mean value. The expectation E{X} resp. μ X and the variance б X of a random variable X are defined as: E{ X} X xf ( x) dx 2 2 E{( X ) } 2 ( x ) f ( x) dx X where б X is called standard deviation (Standardabweichung) (б X 0). In a simulation experiment only a finite sample of values is available from the possible result set. This leads to the usage of estimators (Schätzer), that will approach the exact value for mean value and variance as more values are added to the sample. The following estimators are used as expectation and variance: N 1 E{ X} ~ X xi N 2 X ~ 2 X 1 N 1 N i ( x i ) X Which problems are to be expected when using these estimators in a simulation program? Can the estimator of the variance be rearranged in such a way that it is better suited for implementation? Which disadvantages can this rearranged estimator have? 2 Prof. Dr. C. Görg VSIM 1-41

42 Exercise 1.3 (cont.) An important aspect in simulation experiments is the dependency of values between each other, called correlation (Korrelation). A measure for the correlation of two random variables is the (global) correlation coefficient (Korrelationskoeffizient) : ρ. First the covariance (Kovarianz) C of two random variables X and Y is defined as follows: C E{( X )( Y )} E{ XY} E{ X} E{ Y} X Y Using the definition of the global correlation coefficient shows the following: C X Y and C X Y and thus ρ 1. What is the value of C and ρ in the uncorrelated case? Prof. Dr. C. Görg VSIM 1-42

Stochastic Simulation of Communication Networks and their Protocols

Stochastic 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 information

ISE/OR 762 Stochastic Simulation Techniques

ISE/OR 762 Stochastic Simulation Techniques ISE/OR 762 Stochastic Simulation Techniques Topic 0: Introduction to Discrete Event Simulation Yunan Liu Department of Industrial and Systems Engineering NC State University January 9, 2018 Yunan Liu (NC

More information

Queueing Theory and Simulation. Introduction

Queueing 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 information

Chapter 2 Queueing Theory and Simulation

Chapter 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 information

Stochastic Simulation of

Stochastic Simulation of Stochastic Simulation of Communication Networks -WS 2014/2015 Part 2 Random Number Generation Prof. Dr. C. Görg www.comnets.uni-bremen.de VSIM 2-1 Table of Contents 1 General Introduction 2 Random Number

More information

EE 368. Weeks 3 (Notes)

EE 368. Weeks 3 (Notes) EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How

More information

Stochastic Simulation of Communication Networks

Stochastic Simulation of Communication Networks Stochastic Simulation of Communication Networks Part 2 Amanpreet Singh (aps) Dr.-Ing Umar Toseef (umr) (@comnets.uni-bremen.de) Prof. Dr. C. Görg www.comnets.uni-bremen.de VSIM 2-1 Table of Contents 1

More information

Discrete-event simulations

Discrete-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 information

Simulation & Modeling Event-Oriented Simulations

Simulation & Modeling Event-Oriented Simulations Simulation & Modeling Event-Oriented Simulations Outline Simulation modeling characteristics Concept of Time A DES Simulation (Computation) DES System = model + simulation execution Data Structures Program

More information

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Queueing 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 information

1.225J J (ESD 205) Transportation Flow Systems

1.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 information

The University of British Columbia Computer Science 405 Practice Midterm Solutions

The University of British Columbia Computer Science 405 Practice Midterm Solutions The University of British Columbia Computer Science 405 Practice Midterm Solutions Instructor: Kees van den Doel Time: 45 mins Total marks: 100 The solutions provided here are much more verbose than what

More information

Ways to study a system System

Ways to study a system System Simulation What is simulation? Simple synonym: imitation We are interested in studying a system Instead of experimenting with the system itself we experiment with a model of the system Ways to study a

More information

Systems Simulation Chapter 6: Queuing Models

Systems Simulation Chapter 6: Queuing Models Systems Simulation Chapter 6: Queuing Models Fatih Cavdur fatihcavdur@uludag.edu.tr April 2, 2014 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical

More information

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 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 information

Discrete Event Simulation IN2045

Discrete 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 information

The effect of probabilities of departure with time in a bank

The effect of probabilities of departure with time in a bank International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper

More information

Name of the Student:

Name of the Student: SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Part A questions REGULATION : R2013 UPDATED ON : November 2017 (Upto N/D 2017 QP) (Scan the above QR code for the direct

More information

Network Simulation Chapter 6: Output Data Analysis

Network Simulation Chapter 6: Output Data Analysis 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

More information

Chapter 1: Revie of Calculus and Probability

Chapter 1: Revie of Calculus and Probability Chapter 1: Revie of Calculus and Probability Refer to Text Book: Operations Research: Applications and Algorithms By Wayne L. Winston,Ch. 12 Operations Research: An Introduction By Hamdi Taha, Ch. 12 OR441-Dr.Khalid

More information

PBW 654 Applied Statistics - I Urban Operations Research

PBW 654 Applied Statistics - I Urban Operations Research PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization

More information

Probability Theory and Random Variables

Probability Theory and Random Variables Probability Theory and Random Variables One of the most noticeable aspects of many computer science related phenomena is the lack of certainty. When a job is submitted to a batch oriented computer system,

More information

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

Computer 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 information

1 Modelling and Simulation

1 Modelling and Simulation 1 Modelling and Simulation 1.1 Introduction This course teaches various aspects of computer-aided modelling for the performance evaluation of computer systems and communication networks. The performance

More information

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 20, 2012 Introduction Introduction The world of the model-builder

More information

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved. The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines

More information

Slides 9: Queuing Models

Slides 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 information

EP2200 Course Project 2017 Project II - Mobile Computation Offloading

EP2200 Course Project 2017 Project II - Mobile Computation Offloading EP2200 Course Project 2017 Project II - Mobile Computation Offloading 1 Introduction Queuing theory provides us a very useful mathematic tool that can be used to analytically evaluate the performance of

More information

Probability and Statistics Concepts

Probability and Statistics Concepts University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each

More information

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 CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer

More information

Hand Simulations. Christos Alexopoulos and Dave Goldsman 9/2/14. Georgia Institute of Technology, Atlanta, GA, USA 1 / 26

Hand Simulations. Christos Alexopoulos and Dave Goldsman 9/2/14. Georgia Institute of Technology, Atlanta, GA, USA 1 / 26 1 / 26 Hand Simulations Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 9/2/14 2 / 26 Outline 1 Monte Carlo Integration 2 Making Some π 3 Single-Server Queue 4

More information

Introduction to Modelling and Simulation

Introduction to Modelling and Simulation Introduction to Modelling and Simulation Prof. Cesar de Prada Dpt. Systems Engineering and Automatic Control EII, University of Valladolid, Spain prada@autom.uva.es Digital simulation Methods and tools

More information

QUEUING SYSTEM. Yetunde Folajimi, PhD

QUEUING SYSTEM. Yetunde Folajimi, PhD QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of

More information

Continuous Time Processes

Continuous Time Processes page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point

More information

Simulation. Where real stuff starts

Simulation. 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 information

Preliminary statistics

Preliminary statistics 1 Preliminary statistics The solution of a geophysical inverse problem can be obtained by a combination of information from observed data, the theoretical relation between data and earth parameters (models),

More information

Verification and Validation. CS1538: Introduction to Simulations

Verification and Validation. CS1538: Introduction to Simulations Verification and Validation CS1538: Introduction to Simulations Steps in a Simulation Study Problem & Objective Formulation Model Conceptualization Data Collection Model translation, Verification, Validation

More information

Variance reduction techniques

Variance 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 information

SINGLE RUN OPTIMIZATION USING THE REVERSE-SIMULATION METHOD

SINGLE RUN OPTIMIZATION USING THE REVERSE-SIMULATION METHOD SINGLE RUN OPTIMIZATION USING THE REVERSE-SIMULATION METHOD Young Hae Lee Kyoung Jong Park Department of Industrial Engineering Hanyang University Seoul, 133-791, KOREA Yun Bae Kim Department of Industrial

More information

Introduction and Overview STAT 421, SP Course Instructor

Introduction and Overview STAT 421, SP Course Instructor Introduction and Overview STAT 421, SP 212 Prof. Prem K. Goel Mon, Wed, Fri 3:3PM 4:48PM Postle Hall 118 Course Instructor Prof. Goel, Prem E mail: goel.1@osu.edu Office: CH 24C (Cockins Hall) Phone: 614

More information

VALUES FOR THE CUMULATIVE DISTRIBUTION FUNCTION OF THE STANDARD MULTIVARIATE NORMAL DISTRIBUTION. Carol Lindee

VALUES FOR THE CUMULATIVE DISTRIBUTION FUNCTION OF THE STANDARD MULTIVARIATE NORMAL DISTRIBUTION. Carol Lindee VALUES FOR THE CUMULATIVE DISTRIBUTION FUNCTION OF THE STANDARD MULTIVARIATE NORMAL DISTRIBUTION Carol Lindee LindeeEmail@netscape.net (708) 479-3764 Nick Thomopoulos Illinois Institute of Technology Stuart

More information

Simulation. Where real stuff starts

Simulation. 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 information

Queuing Theory and Stochas St t ochas ic Service Syste y ms Li Xia

Queuing Theory and Stochas St t ochas ic Service Syste y ms Li Xia Queuing Theory and Stochastic Service Systems Li Xia Syllabus Instructor Li Xia 夏俐, FIT 3 618, 62793029, xial@tsinghua.edu.cn Text book D. Gross, J.F. Shortle, J.M. Thompson, and C.M. Harris, Fundamentals

More information

Recap. 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 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 information

Engineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.

Engineering 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 information

Review of Statistical Terminology

Review of Statistical Terminology Review of Statistical Terminology An experiment is a process whose outcome is not known with certainty. The experiment s sample space S is the set of all possible outcomes. A random variable is a function

More information

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

Glossary 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 information

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 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 information

Advanced Computer Networks Lecture 3. Models of Queuing

Advanced Computer Networks Lecture 3. Models of Queuing Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of

More information

Stochastic Models of Manufacturing Systems

Stochastic Models of Manufacturing Systems Stochastic Models of Manufacturing Systems Ivo Adan Systems 2/49 Continuous systems State changes continuously in time (e.g., in chemical applications) Discrete systems State is observed at fixed regular

More information

Queuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.

Queuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models. Queuing Theory Introduction Waiting lines are the most frequently encountered problems in everyday life. For example, queue at a cafeteria, library, bank, etc. Common to all of these cases are the arrivals

More information

Chapter 4: Monte Carlo Methods. Paisan Nakmahachalasint

Chapter 4: Monte Carlo Methods. Paisan Nakmahachalasint Chapter 4: Monte Carlo Methods Paisan Nakmahachalasint Introduction Monte Carlo Methods are a class of computational algorithms that rely on repeated random sampling to compute their results. Monte Carlo

More information

ISyE 6644 Fall 2016 Test #1 Solutions

ISyE 6644 Fall 2016 Test #1 Solutions 1 NAME ISyE 6644 Fall 2016 Test #1 Solutions This test is 85 minutes. You re allowed one cheat sheet. Good luck! 1. Suppose X has p.d.f. f(x) = 3x 2, 0 < x < 1. Find E[3X + 2]. Solution: E[X] = 1 0 x 3x2

More information

Discrete Random Variables

Discrete Random Variables CPSC 53 Systems Modeling and Simulation Discrete Random Variables Dr. Anirban Mahanti Department of Computer Science University of Calgary mahanti@cpsc.ucalgary.ca Random Variables A random variable is

More information

Figure 10.1: Recording when the event E occurs

Figure 10.1: Recording when the event E occurs 10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable

More information

CDA6530: Performance Models of Computers and Networks. Chapter 8: Discrete Event Simulation (DES)

CDA6530: Performance Models of Computers and Networks. Chapter 8: Discrete Event Simulation (DES) CDA6530: Performance Models of Computers and Networks Chapter 8: Discrete Event Simulation (DES) Simulation Studies Models with analytical formulas Calculate the numerical solutions Differential equations

More information

Part I Stochastic variables and Markov chains

Part 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 information

Chapter 2 SIMULATION BASICS. 1. Chapter Overview. 2. Introduction

Chapter 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 information

MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL

MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL Volume 117 No. 13 2017, 271-282 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN

More information

CS 700: Quantitative Methods & Experimental Design in Computer Science

CS 700: Quantitative Methods & Experimental Design in Computer Science CS 700: Quantitative Methods & Experimental Design in Computer Science Sanjeev Setia Dept of Computer Science George Mason University Logistics Grade: 35% project, 25% Homework assignments 20% midterm,

More information

MULTIPLE CHOICE QUESTIONS DECISION SCIENCE

MULTIPLE CHOICE QUESTIONS DECISION SCIENCE MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects

More information

Making Hard Decision. Probability Basics. ENCE 627 Decision Analysis for Engineering

Making Hard Decision. Probability Basics. ENCE 627 Decision Analysis for Engineering CHAPTER Duxbury Thomson Learning Making Hard Decision Probability asics Third Edition A. J. Clark School of Engineering Department of Civil and Environmental Engineering 7b FALL 003 y Dr. Ibrahim. Assakkaf

More information

2008 Winton. Review of Statistical Terminology

2008 Winton. Review of Statistical Terminology 1 Review of Statistical Terminology 2 Formal Terminology An experiment is a process whose outcome is not known with certainty The experiment s sample space S is the set of all possible outcomes. A random

More information

On the Partitioning of Servers in Queueing Systems during Rush Hour

On the Partitioning of Servers in Queueing Systems during Rush Hour On the Partitioning of Servers in Queueing Systems during Rush Hour Bin Hu Saif Benjaafar Department of Operations and Management Science, Ross School of Business, University of Michigan at Ann Arbor,

More information

The exponential distribution and the Poisson process

The exponential distribution and the Poisson process The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]

More information

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 29, 2014 Introduction Introduction The world of the model-builder

More information

Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model

Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model 2st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 205 wwwmssanzorgau/modsim205 Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow

More information

Overall Plan of Simulation and Modeling I. Chapters

Overall 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 information

CS 1538: Introduction to Simulation Homework 1

CS 1538: Introduction to Simulation Homework 1 CS 1538: Introduction to Simulation Homework 1 1. A fair six-sided die is rolled three times. Let X be a random variable that represents the number of unique outcomes in the three tosses. For example,

More information

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Speed Studies - Project Traffic Queuing Intersections Level of Service in Highways and

More information

Chapter 2 Random Processes

Chapter 2 Random Processes Chapter 2 Random Processes 21 Introduction We saw in Section 111 on page 10 that many systems are best studied using the concept of random variables where the outcome of a random experiment was associated

More information

Math 105 Course Outline

Math 105 Course Outline Math 105 Course Outline Week 9 Overview This week we give a very brief introduction to random variables and probability theory. Most observable phenomena have at least some element of randomness associated

More information

Queuing Theory. Using the Math. Management Science

Queuing Theory. Using the Math. Management Science Queuing Theory Using the Math 1 Markov Processes (Chains) A process consisting of a countable sequence of stages, that can be judged at each stage to fall into future states independent of how the process

More information

Stochastic Models in Computer Science A Tutorial

Stochastic 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 information

A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS

A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS Kumar Satyam and Ananth Krishnamurthy Department of Decision Sciences and Engineering Systems,

More information

Time-varying failure rate for system reliability analysis in large-scale railway risk assessment simulation

Time-varying failure rate for system reliability analysis in large-scale railway risk assessment simulation Time-varying failure rate for system reliability analysis in large-scale railway risk assessment simulation H. Zhang, E. Cutright & T. Giras Center of Rail Safety-Critical Excellence, University of Virginia,

More information

Network Simulation Chapter 5: Traffic Modeling. Chapter Overview

Network 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 information

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The

More information

Introduction to Queueing Theory

Introduction to Queueing Theory Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 30-1 Overview Queueing Notation

More information

SYSTEM MODELING AND SIMULATION. Sub Code: 10CS82 IA Marks : 25 Hrs/Week: 04 Exam Hours : 03 Total Hrs : 52 Exam Marks : 100 PART A

SYSTEM MODELING AND SIMULATION. Sub Code: 10CS82 IA Marks : 25 Hrs/Week: 04 Exam Hours : 03 Total Hrs : 52 Exam Marks : 100 PART A SYSTEM MODELING AND SIMULATION Sub Code: 10CS82 IA Marks : 25 Hrs/Week: 04 Exam Hours : 03 Total Hrs : 52 Exam Marks : 100 PART A UNIT 1 8 Hours Introduction: When simulation is the appropriate tool and

More information

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013 Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah

More information

Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com

Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com 1 School of Oriental and African Studies September 2015 Department of Economics Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com Gujarati D. Basic Econometrics, Appendix

More information

Answers to selected exercises

Answers to selected exercises Answers to selected exercises A First Course in Stochastic Models, Henk C. Tijms 1.1 ( ) 1.2 (a) Let waiting time if passengers already arrived,. Then,, (b) { (c) Long-run fraction for is (d) Let waiting

More information

Discrete-Event System Simulation

Discrete-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 information

M/G/1 and Priority Queueing

M/G/1 and Priority Queueing M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula

More information

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii

Contents 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 information

On the Partitioning of Servers in Queueing Systems during Rush Hour

On the Partitioning of Servers in Queueing Systems during Rush Hour On the Partitioning of Servers in Queueing Systems during Rush Hour This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity

More information

Introduction to Queueing Theory

Introduction to Queueing Theory Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings

More information

Manufacturing System Flow Analysis

Manufacturing System Flow Analysis Manufacturing System Flow Analysis Ronald G. Askin Systems & Industrial Engineering The University of Arizona Tucson, AZ 85721 ron@sie.arizona.edu October 12, 2005 How Many IEs Does It Take to Change a

More information

MAS1302 Computational Probability and Statistics

MAS1302 Computational Probability and Statistics MAS1302 Computational Probability and Statistics April 23, 2008 3. Simulating continuous random behaviour 3.1 The Continuous Uniform U(0,1) Distribution We have already used this random variable a great

More information

Queuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if

Queuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if 1 Queuing Theory 3. Birth-Death Process Law of Motion Flow balance equations Steady-state probabilities: c j = λ 0λ 1...λ j 1 µ 1 µ 2...µ j π 0 = 1 1+ j=1 c j, if j=1 c j is finite. π j = c j π 0 Example

More information

Introduction to Queuing Theory. Mathematical Modelling

Introduction to Queuing Theory. Mathematical Modelling Queuing Theory, COMPSCI 742 S2C, 2014 p. 1/23 Introduction to Queuing Theory and Mathematical Modelling Computer Science 742 S2C, 2014 Nevil Brownlee, with acknowledgements to Peter Fenwick, Ulrich Speidel

More information

Lecture 4: Bernoulli Process

Lecture 4: Bernoulli Process Lecture 4: Bernoulli Process Hyang-Won Lee Dept. of Internet & Multimedia Eng. Konkuk University Lecture 4 Hyang-Won Lee 1 / 12 Stochastic Process A stochastic process is a mathematical model of a probabilistic

More information

IE 581 Introduction to Stochastic Simulation

IE 581 Introduction to Stochastic Simulation 1. List criteria for choosing the majorizing density r (x) when creating an acceptance/rejection random-variate generator for a specified density function f (x). 2. Suppose the rate function of a nonhomogeneous

More information

IE Advanced Simulation Experiment Design and Analysis. Hong Wan Purdue University

IE Advanced Simulation Experiment Design and Analysis. Hong Wan Purdue University IE Advanced Simulation Experiment Design and Analysis Hong Wan Purdue University Spring, 2007, based on Prof. Barry L. Nelson s notes for IEMS465, Northwestern University 1 SIMULATION OVERVIEW One view

More information

Continuous-time Markov Chains

Continuous-time Markov Chains Continuous-time Markov Chains Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ October 23, 2017

More information

2DI90 Probability & Statistics. 2DI90 Chapter 4 of MR

2DI90 Probability & Statistics. 2DI90 Chapter 4 of MR 2DI90 Probability & Statistics 2DI90 Chapter 4 of MR Recap - Random Variables ( 2.8 MR)! Example: X is the random variable corresponding to the temperature of the room at time t. x is the measured temperature

More information

Homework 2. Spring 2019 (Due Thursday February 7)

Homework 2. Spring 2019 (Due Thursday February 7) ECE 302: Probabilistic Methods in Electrical and Computer Engineering Spring 2019 Instructor: Prof. A. R. Reibman Homework 2 Spring 2019 (Due Thursday February 7) Homework is due on Thursday February 7

More information

Name of the Student: Problems on Discrete & Continuous R.Vs

Name of the Student: Problems on Discrete & Continuous R.Vs SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Additional Problems MATERIAL CODE : JM08AM1004 REGULATION : R2013 UPDATED ON : March 2015 (Scan the above Q.R code for

More information

10.2 For the system in 10.1, find the following statistics for population 1 and 2. For populations 2, find: Lq, Ls, L, Wq, Ws, W, Wq 0 and SL.

10.2 For the system in 10.1, find the following statistics for population 1 and 2. For populations 2, find: Lq, Ls, L, Wq, Ws, W, Wq 0 and SL. Bibliography Asmussen, S. (2003). Applied probability and queues (2nd ed). New York: Springer. Baccelli, F., & Bremaud, P. (2003). Elements of queueing theory: Palm martingale calculus and stochastic recurrences

More information