OurBigBook About$ Donate
 Sign in Sign up

M-D-1 queue (M/D/1)

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Probability theory Queueing theory M-G-1 queue
2026-10-06  0 By others on same topic  0 Discussions Create my own version
An M-D-1 queue has a Poisson process of arrivals, a deterministic service time τ, and one work-conserving server. With arrival rate λ and λτ<1, its equilibrium idle probability is 1−λτ: the stationary completed work per unit time is λτ. Its output generally need not be a Poisson process.

 Ancestors (7)

  1. M-G-1 queue
  2. Queueing theory
  3. Probability theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • M-D-1 queue
  • Past exam of the mathematics course of the University of Cambridge / 2010 / ii / Paper 2 / 27I / e / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 39 / 1 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook