BCMP network
From Wikipedia, the free encyclopedia
In queueing theory, a BCMP network is a system of queues for which the steady state occupancy of the queues has a very simple joint probability distribution, known as a product form. They are generalizations of Jackson networks. The name comes from the initials of the authors of the original paper on the topic[1].
[edit] Definition
A BCMP network contains queues of four types:
- single-server queues with exponential service times (like M/M/1 queues, although the arrival process will not be Poisson)
- Infinite server queues
- Processor sharing queues
- single-server queues with LCFS with pre-emptive resume
The next queue a customer enters after leaving a given queue can be random.
[edit] Steady state distribution
[edit] References
- ^ F. Baskett, K. M. Chandy, R. R. Muntz and F.G. Palacios (1975). "Open, closed and mixed networks of queues with different classes of customers". Journal of the ACM 22: 248–260. doi:.
