DiscreteEventSimulation - CDA6530: Performance Models of...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
DA6530: Performance Models of Computers and Networks CDA6530: Performance Models of Computers and Networks hapter 8: Discrete Event Simulation Chapter 8: Discrete Event Simulation (DES)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
imulation Studies Simulation Studies odels with analytical formulas Models with analytical formulas Calculate the numerical solutions Differential equations ---- Matlab Simulink Or directly solve if has closed formula solutions Discrete equations --- program code to solve The mean value formulas for stochastic events Solutions are only for the mean values If you derive models in your paper, you must use real simulation to verify that your nalytical formulas are accurate 2 analytical formulas are accurate
Background image of page 2
imulation Studies Simulation Studies Models without analytical formulas Monte Carlo simulation Generate a large number of random samples ggregate all samples to generate final result Aggregate all samples to generate final result Example: use U(0,1) to compute integral Discrete-time simulation ivide time into many small steps Divide time into many small steps Update system states step-by-step Approximate, assume system unchanged during a me step time step Discrete event simulation (DES) Accurate 3 Event-driven
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
iscrete ime Simulation Discrete Time Simulation ystem is assumed to change only at System is assumed to change only at each discrete time tick Smaller time step, more accurate simulation Why use it? Simpler than DES to code and understand Fast, if system states change very quickly 4
Background image of page 4
iscrete ime Simulation Discrete Time Simulation While (simulation not complete){ 1). Time tick: k ++; 2). For system’s node i (i=1,2, ) ) Simulate what could happen for node i during the last time 3). Simulate what could happen for node i during the last time step (k-1 k) 4). Update the state of node i if something happens to it ). Output time tick k’s system’s states (e.g., status of 5). Output time tick ks system s states (e.g., status of every node in the system) } 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/14/2012 for the course CDA 6530 taught by Professor Zou during the Fall '11 term at University of Central Florida.

Page1 / 20

DiscreteEventSimulation - CDA6530: Performance Models of...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online