OurBigBook About$ Donate
 Sign in Sign up

Embedded departure chain of an M-G-1 queue

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Probability theory Queueing theory M-G-1 queue
Created 2026-10-03 Updated 2026-10-06  0 By others on same topic  0 Discussions Create my own version
Let Qn​ be the number left immediately after departure n, and let An​ be the arrivals during the next service. Then
Qn+1​=Qn​−1{Qn​>0}​+An​.
(1)
Conditional on service duration S, An​ is Poisson with parameter λS, so
EAn​=λES,EAn2​=λES+λ2ES2.
(2)
  • Table of contents
    • Pollaczek-Khinchine mean formula Embedded departure chain of an M-G-1 queue

Pollaczek-Khinchine mean formula

 0  0
Embedded departure chain of an M-G-1 queue
For a stable M/G/1 queue with traffic intensity ρ=λES<1, the mean waiting time before service is
Wq​=2(1−ρ)λES2​.
(1)
Equivalently, the mean number in the system is
L=ρ+2(1−ρ)λ2ES2​.
(2)

 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 (1)

  • Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 3 / 27J / 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