EEL6507sp09L19
From BoykinWiki
Contents |
EEL6507 Spring 2009, Lecture 19, Monday 2009/02/23 (Notes created by Yonggang Liu)
Covered in this lecutre:
- Introduce method of stages
Talk about Markov model
What are the problems with the Markovian Models?
- Real systems are often non-Markovian
- Service has a different pdf
- arrival has a different pdf
- Bulk Service
- Prioritized Customers
- Queueing Networks
What are good about the Markovian Models?
- Simple
- Memoryless (no explicit history)
- One solution do all B-D models
Method of stages
We want to address the weakness of Markovian Models (typically to deal with the models having pdf that Markovian Models can not solve), as well as keeping the simplicity of the Markovian Models.
Erlangian-r distribution
Consider a new pdf:

Claim:

then:

b(x)is pdf for sum of two random variables each with pdf: 2μe − 2μx,so,
Erlang-r distribution is:

Claim: br(x) is pdf for sum of Xr − 1,X1, where Xr − 1distributes as br − 1(x) and X1 is exponential. Then, br(x) is sum of r exponentials.
See the Laplace transform of Erlangian-r distribution:

First, let's see how to solve:

Approach 1:

Approach 2:


So,

Therefore,

See the Laplace transform of exponential distribution:

Set μ' = rμ then,

Therefore, Erlangian-r is the sum of r-exponential with rate rμ!
Variance of Erlangian distribution
We know the mean of Erlangian distribution is
, then what is the variance of Erlangian distribution?


So,



Markov Model for Erlangian distribution
Consider the case in which we provide an r-stage service facility, as shown in the left. For this system, the mean time to go though is
.
Consider the First stage,

Solve above equation, we get P1(t) = e − μt, which is the CDF for exponential. The time to get through the whole system is Erlangian(x) distributed.

