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
Like
0 By others
on same topic
0 Discussions
Create my own version
Let
Q
n
be the
number
left immediately after departure
n
, and let
A
n
be the arrivals during the next service. Then
Q
n
+
1
=
Q
n
−
1
{
Q
n
>
0
}
+
A
n
.
(1)
Conditional on service duration
S
,
A
n
is Poisson with
parameter
λ
S
, so
E
A
n
=
λ
E
S
,
E
A
n
2
=
λ
E
S
+
λ
2
E
S
2
.
(2)
Table of contents
Pollaczek-Khinchine mean formula
Embedded departure chain of an M-G-1 queue
Pollaczek-Khinchine mean formula
0
0
0
Embedded departure chain of an M-G-1 queue
For
a
stable
M
/
G
/1
queue with traffic intensity
ρ
=
λ
E
S
<
1
, the
mean
waiting
time
before service is
W
q
=
2
(
1
−
ρ
)
λ
E
S
2
.
(1)
Equivalently, the
mean
number
in the system is
L
=
ρ
+
2
(
1
−
ρ
)
λ
2
E
S
2
.
(2)
Ancestors
(7)
M-G-1 queue
Queueing theory
Probability theory
Probability and statistics
Area of mathematics
Mathematics
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)
Subscribe (1)
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