Queuing systems

A queuing system (English: waiting or queuing system) is in the queuing theory an abstract model of an operating system, which describes the traffic flow even within real systems such as communication networks or computer networks. Components of an operating system are:

• Arrival process of the operating requirements
• Operation process of requirements
• Structure and mode of operation system

Arrival and operating processes are generally given in the form of probability distributions for the random arrival intervals and service times. Structure and mode of operation of the system are described by the queuing model, includes the number and arrangement of operating units and a waiting places, and the manner of dispatch ( "Operation discipline ").

In the waiting system requirements can, if all operating units are busy, wait in a waiting room. If the waiting room is limited, so the queuing system is a loss system and rejects arrivals when the waiting room is full. Queuing models are specified by the indication of up to six parameters, which are usually specified in the Kendall notation. On the basis of this simple structure, many generalizations are considered, for example, cross-linked systems with unreliable response systems or intermittent system failures.

Simulation of general response systems

Usually response systems are simulated using an event list.

Simulation in the Markov case

In the calculation of traffic models are often made for arrival and service processes by Markov conditions, because they simplify the computing and lead to practical results. Response systems can be simulated including by Petri nets.

Networked -service systems are widely accepted as Jackson networks. This can be less costly special case in the simulation of networked service systems are considered.