# Discrete Event Simulation - TUM

3m ago
1 Views
1.39 MB
53 Pages
Last View : 3m ago
Transcription

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 Carle Chair for Network Architectures and Services Department of Computer Science Technische Universität München http://www.net.in.tum.de

Topics Waiting Queues Random Variable Probability Space Discrete and Continuous RV Frequency Probability(Relative Häufigkeit) Distribution(discrete) Distribution Function(discrete) PDF,CDF Expectation/Mean, Mode, Standard Deviation, Variance, Coefficient of Variation p-percentile(quantile), Skewness, Scalability Issues(Addition) Covariance, Correlation, Autocorrelation Visualization of Correlation PP-Plot QQ-Plot Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 2

Statistics Fundamentals Waiting Queue Theory arrival process rate λ 3.4 0.6 1.7 1.6 0.7 0.7 1.3 buffer, queue random numbers inter-arrival times Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 service process rate μ 1.7 1.0 3.3 4.0 0.7 . service times 3

Statistics Fundamentals What are we talking about and why? Simple queue model: Customers arrive at random times Execution unit serves customers (random duration) Only one customer at a time; others need to queue Standard example Give deeper understanding of important aspects, e.g. Random distributions (input) Measurements, time series (output) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 4

Statistics Fundamentals Queuing model: Input and output Input: (Inter-)arrival times of customers (usually random) Job durations (usually random) Direct output: Departure times of customers Indirect output: Inter-arrival times for departure times of customers Queue length Waiting time in the queue Load of service unit (how often idle, how often working) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 5

Statistics Fundamentals Little Theorem X(t) W n 2 1 Bn 1 2 5 3.4 1.7 1.0 t 10 0.6 1.7 3.3 1.6 0.7 0.7 4.0 1.3 n 0.7 arrivals service durations event queue Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 6

Statistics Fundamentals Little Theorem λ : average arrival rate E[X] : average number of packets in the system E[T] : average retention time of packets in the system Arrival Process E[X] Rate λ E[T] to N t 1 o Ti X (t )dt N0 i 1 1 T N t 1 o X X (t )dt to 0 N to t o N X E[T ] to N t o t o lim lim T X Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 1 E[T ] lim T lim t o t o N N T i 1 i t 1 o E[ X ] lim X lim X (t )dt t o t o t o 0 7

Statistics Fundamentals Kendall Notation GI [x] / GI / n - S Number of Places in the Queue S 0 Loss/Blocking System S Waiting System Number of Servers Service Time Distribution Batch Arrival Process Arrival Process Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 8

Statistics Fundamentals Queuing Discipline FIFO / FCFS LIFO / LCFS SIRO PNPN EDF First In First Out / First Come First Served Last In First Out / Last Come First Served Service In Random Priority-based Service Earliest Deadline First Distributions M D Ek GI Hk Markovian Degenerate Distribution Erlang Distribution General distribution Hyper exponential Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 Exponential Service Time A deterministic service time Erlang k distribution General independent Hyper k distribution 9

Statistics Fundamentals System Characteristics Average customer waiting time Average processing time of a customer Average retention time of a customer Average number of customers in the queue Customer blocking probability Utilization of the system / individual processing units Example Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 How to model and evaluate waiting queues in OPNET 10

Statistics Fundamentals Exercise System A: D / D / 1 - Arrival rate λ 1 / s Service rate μ [1;10] / s System B: M / M / 1 - Arrival rate λ 1 / s Service rate μ [1;10] / s System C: M / M / 20 - Arrival rate λ 10 / s Service rate μ 1 / s System D: M / M / 1 - Arrival rate λ 10 / s Service rate μ 20 / s Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 What is the maximum (meaningful) utilization of the system? Which system performs better? What impact does the utilization have on the system? Which system performs better? Would you prefer a single fast processing unit instead of multiple slow processing units? 11

Statistics Fundamentals Exercise System E: M / M / 10 - Arrival rate λ 9 / s Service rate μ 1 / s System F: M / M / 100 - Arrival rate λ 90 / s Service rate μ 1 / s System G: M / D / 1 - Arrival rate λ 1 / s Service rate μ 1 / 0.7 / s System H: D / M / 1 - Arrival rate λ 1 / s Service rate μ 1 / 0.7 / s Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 What is the maximum (meaningful) utilization of the system? Which system performs better? Which system performs better? Which system has a shorter avg waiting time? 12

Statistics Fundamentals System G: M / D / 1 - λ 1 P(T 0.7s) 1 P(T 0.7s) 0.55 Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 System H: D / M / 1 - μ 1 / 0.7 1.43 P(T 1s) 0.75 13

Statistics Fundamentals Customer Arrival Flowchart Arrival Process Yes Schedule the next arrival event Is a service unit idle? Tally a delay of 0 for this customer No Find the shortest queue Mark service unit as busy Place Customer in the shortest queue Schedule a departure event Return Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 14

Statistics Fundamentals Flowchart Departure Process Yes Departure Event Is the queue empty? No Remove the first customer from the queue Set the state of service unit to idle Compute the customers delay Schedule a departure event for this customer Return Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 15

Statistics Fundamentals M/M/n- System of equations x(i 1) i x(i), i 1,2,3,., n, x(i 1) n x(i), i n 1,. x(i) 1 i 0 State Transition Diagram - M / M / n - Picture taken from Tran-Gia, Analytische Leistungsbewertung verteilter Systeme, p. 98 Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 16

Statistics Fundamentals M / M / 10 - State Distribution - M / M / 10 - Picture taken from Tran-Gia, Analytische Leistungsbewertung verteilter Systeme, p. 99 Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 17

Statistics Fundamentals M / M / 10 - The waiting probability decreases with an increasing number of processing units (assuming constant utilization) n number of processing units W - Waiting probability Utilization Picture taken from Tran-Gia, Analytische Leistungsbewertung verteilter Systeme, p. 100 Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 18

Statistics Fundamentals Classic definition of probability The theory of chance consists in reducing all the events of the same kind to a certain number of cases equally possible, that is to say, to such as we may be equally undecided about in regard to their existence, and in determining the number of cases favorable to the event whose probability is sought. The ratio of this number to that of all the cases possible is the measure of this probability, which is thus simply a fraction whose numerator is the number of favorable cases and whose denominator is the number of all the cases possible. - Pierre-Simon Laplace, A Philosophical Essay on Probabilities Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 19

Statistics Fundamentals Random Variable Probability Space (Ereignisraum) Ω {ω1, ω2, ω3, ω4, , ωi} Relation ω1 x1 ω2 ω3 ω4 ωi x2 x3 x4 xi Random Variable X Event Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 20

Statistics Fundamentals Discrete Random Variable: Countable Example: Flipping of a coin ω1 {head-0}, ω2 {tail-1} X {0, 1} Ω {ω1, ω2} Example: Rolling two dice ω1 {2}, ω2 {3}, , ω11 {12} X {2, 3, 4, , 12} Ω {ω1, ω2, , ω11} Continuous Random Variable: Uncountable Example: Round Trip Time T {5ms, 200ms} ω1 {t 10ms}, ω2 {10ms t 20ms}, ω3 {t 20ms} Ω {ω1, ω2} Example: Sensed Interference Level Discrete or not discrete Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 21

Statistics Fundamentals Frequency Probability / Law of large numbers (Relative Häufigkeit) Number of random experiments n total number of trials Xi event or characteristic of the outcome ni number of trials where the event Xi occurred ni h( X i ) n ni n n P( X i ) lim 0 h( X i ) 1 h( X ) 1 i i 0 P( X i ) 1 Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 P( X ) 1 i Vollständigkeitsrelation Xi disjoint i 22

Statistics Fundamentals Vollständiges Ereignissystem X Y N P(Y ) P( X i ) i 1 X Y Verbundereignis X Y P( X Y ) P( X , Y ) P(Y , X ) P( X Y ) P( X ) P(Y ) P( X Y ) Bedingte Wahrscheinlichkeit P( X , Y ) P( X Y ) P(Y ) P( X Y ) P( X , Y ) Statistische Unabhängigkeit P( X Y ) P( X ) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 v P( X , Y ) P( X ) P(Y ) 23

Statistics Fundamentals Vollständiges Ereignissystem Ω N P(Y ) P( X i , Y ) X1 X2 XN i 1 Y X3 Xi Xi Y Bayes Function P(Y X i ) P( X i ) P(Y X i ) P( X i ) P( X i Y ) N P(Y ) P(Y X k ) P( X k ) k 1 Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 24

Statistics Fundamentals Distribution (Verteilung) X – discrete random variable Function x(i) P(X i) – x(i) e [0,1] , i 0,1,2, ,Xmax (Distribution) X max – x(i ) 1 (Vollständigkeitsrelation) i 0 Example: Rolling two dice ω1 {2}, ω2 {3}, , ω11 {12} X {2, 3, 4, , 12} Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 Ω {ω1, ω2, , ω11} 25

Statistics Fundamentals Example: Throwing two dice Sample Space (Ereignisraum) (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (5,1) (5,2) (5,3) (5,4) (5,5) (5,6) (6,1) (6,2) (6,3) (6,4) (6,5) (6,6) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 26

Statistics Fundamentals Example: Throwing two dice Sample Space (Ereignisraum) (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (5,1) (5,2) (5,3) (5,4) (5,5) (5,6) (6,1) (6,2) (6,3) (6,4) (6,5) (6,6) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 27

Statistics Fundamentals Distribution Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 28

Statistics Fundamentals Palour Game: Die Siedler von Catan Rules: Players are only allowed to build along borders of a field Players roll two dice If the sum of the dice corresponds to the number of the field, the player gets the resources from this field Question Where is the best place for a building? Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 29

Statistics Fundamentals Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 30

Statistics Fundamentals 9 8 7 6 5 4 3 2 1 Prison Are all fields reached with the same probability? Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 31

Statistics Fundamentals Distribution (Verteilung) Discrete random variable X i value of the random variable X x(i) probability that the outcome of random variable X is i x(i) P{ X i}, i 0,1,., X max (Distribution) X max x(1) 1 (Vollständigkeitsrelation) i 0 x(i) Distribution Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 X 32

Statistics Fundamentals Distribution function (Verteilungsfunktion) X (t ) P{X t} t1 t2 X (t1 ) X (t2 ) t1 t2 P{t1 X t2 } X (t2 ) X (t1 ) X ( ) 0 X ( ) 1 X c (t ) 1 X (t ) P{X t} X(t) P(X t) (monotony) Distribution function Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 33

Statistics Fundamentals Difference between distribution and distribution function X(t) P(X t) x(i) X Distribution (Verteilung) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 Distribution function (Verteilungsfunktion) 34

Statistics Fundamentals Continuous random variable x(t )dt 1 Probability Density Function (Verteilungsdichtefunktion) d x(t ) X (t ) dt Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 Cumulative Density Function t X (t ) x(t )dt 35

Statistics Fundamentals Expectation (Erwartungswert) X : Probability density function g(x) : Function of random variable X E g ( X ) g (t ) x(t )dt Mean (Mittelwert einer Zufallsvariablen) m1 E X t x(t )dt Mode (Outcome of the random variable with the highest probability) c Max( x(t )) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 36

Statistics Fundamentals Gewöhnliche Momente einer Zufallsvariablen g( X ) X k mk E X k t k x(t )dt , k 0,1,2,. Central moment (Zentrales Moment) Variation of the random variable in respect to its mean g ( X ) ( X m1 ) k k E ( X m1 ) k (t m1 ) x(t )dt , k 0,1,2,. Special Case (k 2): 2 E ( X m1 ) 2 VAR[ X ] Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 37

Statistics Fundamentals Standard deviation (Standardabweichung) X VAR[X ] Coefficient of variation (Variationskoeffizient) cX X E[ X ] , E[ X ] 0 The coefficient of variation is a normalized measure of dispersion of a probability distribution It is a dimensionless number which does not require knowledge of the mean of the distribution in order to describe the distribution Picture taken from Wikipedia Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 38

Statistics Fundamentals p-percentile tp (p-Quantil) A percentile is the value of a variable below which a certain percent of observations fall VDF F : R (0,1) (bijective) F ( x) P( X x) p F 1 ( x) inf{x R : p F ( x)} 90%-Quantil Special Case: Median 0.5-percentile Upper percentile 0.75-percentile Lower percentile 0.25-percentile Typical Use Case: QoS in networks (e.g. 99.9%-percentile of the delay) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 90% of customers are waiting less than 5 minutes Cumulative Density Function 39

Statistics Fundamentals Skewness (Schiefe) Skewness describes the asymmetry of a distribution v 0 : The left tail of the distribution is longer (linksschief) Mass is concentrated in the right v 0 : The right tail of the distribution is longer (rechtsschief) Mass is concentrated in the left X 3 3 X E 3 Picture taken from Wikipedia Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 40

Statistics Fundamentals Scalability Issues Multiplication of a random variable X with a scalar s Y s X E[Y ] s E[ X ] VAR[Y ] s 2 VAR[ X ] Addition of two random variables X and Y Z X Y E[Z ] E[ X ] E[Y ] VAR[Z ] VAR[ X ] VAR[Y ] Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 (only if A and B independent) 41

Statistics Fundamentals Covariance Covariance is a measure which describes how two variables change together Cov( X , Y ) E[( X E[ X ])(Y E[Y ])] E[ XY ] E[ X ] E[Y ] Special Case: Cov( X , X ) VAR[ X ] Other Characteristics: Cov( X , a) 0 Cov( X , Y ) Cov(Y , X ) Cov(aX , bY ) abCov( X , Y ) Cov( X a, Y b) Cov( X , Y ) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 42

Statistics Fundamentals Correlation function Correlation function describes how two random variable tend to derivate from their expectation Cov( X , Y ) Cor ( X , Y ) VAR ( X ) VAR (Y ) Characteristics: Y X Cor ( X , Y ) 1 (Maximum positive) Y X Cor ( X , Y ) 1 (Maximum negative) Cor ( X , Y ) 0 Cor ( X , Y ) 0 Both random variable tend to have either high or low values (difference to their expectation) The random variables differ from each other such that one has high values while the other has low values and vice versa (difference to their expectation) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 43

Statistics Fundamentals Autocorrelation (LK 4.9) Autocorrelation is the cross-correlation of a signal with itself. In the context of statistics it represents a metric for the similarity between observations of a stochastic process. From a mathematical point of view, autocorrelation can be regarded as a tool for finding repeating patterns of a stochastic process. Definition: Correlation of two samples with distance k from a stochastic process X is given by: Cor ( X , Y ) with Yi X i j Use case: Test of random number generators Evaluation of simulation results (c.f. Batch-Means) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 44

Statistics Fundamentals Example: 00101110101001101100010011101010100011 00101110101001101100010011101010100011 Random Autocorrelation Lag 4 Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 45

Statistics Fundamentals Visualization of Correlation Example: Two random variables X and Y are plotted against each other Picture taken from Wikipedia Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 46

Statistics Fundamentals Visual comparison of different distributions Quantile-Quantile Plot Probability-Probability Plot Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 50

Statistics Fundamentals Quantile-Quantile plots (QQ plots) Usage: Compare two distributions against each other Usually: Measurement distribution vs. theoretical distribution – do the measurements fit an assumed underlying theoretical model? Also possible: Measurement distribution vs. other measurement distribution – are the two measurement runs really from the same population, or is there variation between the two? How it works: Determine 1% quantile, 2% quantile, , 100% quantile for distributions Plot 1% quantile vs. 1% quantile, 2% quantile vs 2% quantile, etc. Not restricted to percentiles – usually, each of the n data points from the measurement is taken as its own 1/n quantile How to read: If everything is located along the line x y then the two distributions are very similar QQ plots amplify discrepancies near the “tail” of the distributions Warning about scales: Plot program often automatically assign X and Y different scales Straight line indicates: choice of distribution OK, but parameters don’t fit Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 51

Statistics Fundamentals QQ Plot Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 52

Statistics Fundamentals QQ Plot Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 53

Statistics Fundamentals Probability-Probability plots (PP plots) Very similar to QQ plot QQ plot is more common, though Difference to QQ plot: QQ plot compares [quantiles of] two distributions: 1% quantile vs. 1% quantile, etc. Graphically: the y axes of the cumulative density distribution functions are plotted against each other PP plot compares probabilities of two distributions Graphically: the y axes of the probability density functions are plotted against each other How to read: Basically the same as QQ plot PP plots highlight differences near the centers of the distributions (whereas QQ plots highlight differences near the ends of the distributions) Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 54

Statistics Fundamentals PP Plot Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 55

Statistics Fundamentals PP Plot Network– Security, IN2045 Discrete Event WS 2008/09, Simulation, Chapter SS 92010 56

Network Security, WS 2008/09, Chapter 9IN2045 -Discrete Event Simulation, SS 2010 22 Topics Waiting Queues Random Variable Probability Space Discrete and Continuous RV Frequency Probability(Relative Häufigkeit) Distribution(discrete) Distribution Function(discrete) PDF,CDF Expectation/Mean, Mode, Standard Deviation, Variance, Coefficient of Variation

Related Documents:

ning B 3 tum 20 l (5 gal.) CS Neopren B PROFI-NET C 3 tum 20 l (5 gal.) CM EPDM C PROFI-BUS D 3 tum 20 l (5 gal.) CM Neopren D Device-Net F 3 tum 200 l (55 gal.) CS EPDM N Inget G 3 tum 200 l (55 gal.) CS Neopren H 3 tum 200 l (55 gal.) CM EPDM J 3 tum 200 l (55 gal.) CM Neopren K 6 tum 200 l (55 gal.) CS EPDM M 6 tum 200 l (55 gal.) CS Neopren .

the TUM Central Administration (e.g. The TUM Legal Office) other TUM entities (e.g. TUM Graduate School, TUM Integrated Research Centres) incubators, commercialization agencies, consultants, patent attorneys, funding institutions Technology Transfer Industry Liaison Office Project Management TUM-KAUST Project Management GIST-TUM Asia/ TUM CREATE

Rum tum did-dle did- dle tr- la Rum Tum . 5. Ask the children to add in some capital letters to show which words/letters should be said loudly. Little Nonsense Song . rrRUM TUM, rrRUM TUM di Diddle RUM TUM Tra la TIDDLE UM Rum tum mm Tra la la Tra la la Rum tum tiddle um tum Tiddle-iddle, tiddle-iddle, Tiddle-iddle, tiddle-iddle

Tum Cm 12 tum 12 30,5 14 35,6 12–26 tum 3/4 1,9 1 1/8 2,85 14 tum 14 35,6 16 40,6 16 tum 16 40,6 18 45,7 18 tum 18 45,7 20 50,8 20 tum 20 50,8 22 55,9 22 tum 22 55,9 24 61,0 B A A 35 mm (används för 1-tums och 1-1/8-tums ryggstödskäppar) 30 mm (används för 3/4-tums och 7/8-tums ryggstödskäppar) OBS! Ryggstödskäpparnas klämbultar .

Network Security, WS 2008/09, Chapter 9IN2045 – Discrete Event Simulation, WS 2011/2012 10 Discrete Event Simulation A Discrete Event Simulation (DES) is the reproduction of the behaviour of a system over time by means of a model where the state variables of the models change

Event 406 - Windows Server 2019 58 Event 410 58 Event 411 59 Event 412 60 Event 413 60 Event 418 60 Event 420 61 Event 424 61 Event 431 61 Event 512 62 Event 513 62 Event 515 63 Event 516 63 Event 1102 64 Event 1200 64 Event 1201 64 Event 1202 64 Event 1203 64 Event 1204 64

2. Benefits of Discrete Event Simulation Discrete Event Simulation has evolved as a powerful decision making tool after the appearance of fast and inexpensive computing capacity. (Upadhyay et al., 2015) Discrete event simulation enables the study of systems which are discrete, dynamic and stoc

Discrete Event Simulation (DES) 9 Tecniche di programmazione A.A. 2019/2020 Discrete event simulation is dynamic and discrete It can be either deterministic or stochastic Changes in state of the model occur at discrete points in time The model maintains a list of events ("event list") At each step, the scheduled event with the lowest time gets