Browser width is too narrow.

Rotate the screen or increase the width.

Rotate the screen or increase the width.

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 should be represented by a model. So, the simplest appropriate model should be chosen.

A model of a single server loss system is such a suitable case. This is the simplest classical queuing theory system. It should be noted that this is a degenerate case, since there is no queue as such in this system.

So, the entities flow in this system arrives as a Poisson process with exponentially distributed interarrival time. The service time value is exponentially distributed too. According to Kendall's notation this is a

Block simulation model of M/M/1 loss system.

Simula-like simulation model for the same system.

- M/M/1 queuing system with one server and a queue with unlimited waiting time and capacity.
- M/M/C queuing system with multiple servers and a queue with unlimited waiting time and capacity.
- M/M/C/K,T queuing system with multiple servers and a queue with limited waiting time and capacity.
- Retrial queuing system with multiple servers and a queue with limited waiting time and capacity.

Download executable examples built with OpenSIMPLY. No installation is required.

Free download simulation software. Try it right now.

The OpenSIMPLY tutorial with practical examples will help you get started quickly.

Run executable demos. No installation is required.

The OpenSIMPLY tutorial with practical examples will help you get started quickly.

Run executable demos. No installation is required.