Discrete event simulation modeling examples
The product which offers some programming approach can be evaluated by how easy user with no experience of this product can make the first step.
A traditional example of the easiest code for conventional programming languages is the output of "Hello, world!" to the screen.
However, such example for discrete event simulation software
has to be represented by a model.
Thus, the simplest appropriate model should be chosen.
Such suitable model is a classical simplest system of Queueing Theory: a single server loss system.
This system has an arrival flow of entities based on Poisson process and exponentially distributed service time.
According to Kendall's notation this is a M/M/1 loss
Simple simulation example M/M/1 loss system
View the example of a block simulation model
for M/M/1 loss system.
Queueing theory simulation examples
Here are some block simulation examples of classical queueing theory systems.
- A system with one server and a queue with unlimited time and the number of waiting places M/M/1 queue system.
- A system with multiple servers and a queue with unlimited time and the number of waiting places M/M/C queue system.
- A system with multiple servers and a queue with limited time and the number of waiting places M/M/C/K,T queue system.
Download executable examples
built with OpenSIMPLY. No installation is required.