EEL6507sp09L36
From BoykinWiki
Contents |
EEL6507 Spring 2009, Lecture 36, Wednesday 2009/04/15 (Notes created by Ajay Jain)
Topic :Finish M/G/1 Busy Time
From Last Lecture

we have a recursive definition of the busy time.So if Distribution of service time is given for any queueing system Busy time can
be calculated.In general its very difficult to find solution for busy time distribution in term of service time distribution alone.
Some points :
- Service rate does not depend on queue length.
- Arrival rate does not depend on queue length.
As mentioned above if service time distribution is given we can find the busy time distribution ,Lets analyze for M/M/1
For M/M/1 case




Making Quadratic in G * (s) and solving we get

Moments of Busy Time
First Moment

Applying our regular technique of taking derivative and equating S=0


Second Moment
Note:
- Higher Variance in service give higher variance in busy time
- Higher Traffic rate give higher variance in busy time
