1 / 30

M/G/1

M/G/1. Cheng-Fu Chou. Residual Life. Inter-arrival time of bus is exponential w/ rate l while hippie arrives at an arbitrary instant in time Question: How long must the hippie wait, on the average , till the bus comes along?

Download Presentation

M/G/1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. M/G/1 Cheng-Fu Chou

  2. Residual Life • Inter-arrival time of bus is exponential w/ rate l while hippie arrives at an arbitrary instant in time • Question: How long must the hippie wait, on the average , till the bus comes along? • Answer 1: Because the average inter-arrival time is 1/l, therefore 1/2l

  3. Residual Life (cont.) • Answer 2: because of memoryless, it has to wait 1/l • General Result

  4. Derivation

  5. M/G/1 • M/G/1 • a(t) = le –lt • b(t) = general • Describe the state [N(t), X0(t)] • N(t): the no. of customers present at time t • X0(t): service time already received by the customer in service at time t • Rather than using this approach, we use “the method of the imbedded Markov Chain”

  6. Imbedded Markov Chain [N(t), X0(t)] • Select the “departure” points, we therefore eliminate X0(t) • Now N(t) is the no. of customer left behind by a departure customer. (HW) • For Poisson arrival pk(t) = rk(t) • If in any system (even in non-Markovian) where N(t) makes discontinuous changes in size (plus or minus) one, then • rk = dk = prob[departure leaves k customers behind] • Therefore, for M/G/1 • rk = dk = pk

  7. Mean Queue Length

  8. This is the famous Pollaczek – Khinchin Mean Value Formula

  9. Examples

  10. Mean Residual Service Time • Wi: waiting time in queue of the i-th customer • Ri: residual service time seen by the i-th customer • Xi: service time of the i-th customer • Ni: # of customers found waiting in the queue by the i-th customer upon arrival

  11. Residual Service Time rt x1 time t x2 xM(t) x1

  12. Distribution of Number in the System

  13. Ex • Q(z) for M/M/1

  14. Sol.

  15. Waiting Time Distribution

  16. Ex • Response time distribution for M/M/1 • Waiting time distribution for M/M/1

  17. Response Time Distribution

  18. Waiting Time Distribution

More Related