background preloader

Queuing

Facebook Twitter

NServiceBus

NServiceBus - The most popular open-source service bus for .net. Apache ActiveMQ. Queueing theory. Queueing theory is the mathematical study of waiting lines, or queues.[1] In queueing theory a model is constructed so that queue lengths and waiting times can be predicted.[1] Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service.

Queueing theory

Single queueing nodes[edit] Single queueing nodes are usually described using Kendall's notation in the form A/S/C where A describes the time between arrivals to the queue, S the size of jobs and C the number of servers at the node.[5][6] Many theorems in queue theory can be proved by reducing queues to mathematical systems known as Markov chains, first described by Andrey Markov in his 1906 paper.[7] The M/M/1 queue is a simple model where a single server serves jobs that arrive according to a Poisson process and have exponentially distributed service requirements.

MSMQ