Tyme's Nifty M/M/1 Queue Applet

This applet will simulate an M/M/1 Queue. In this instance, the queue will be people who will show up according to a Poisson distribution with a mean inter-arrival time that you will specify, and they will be serviced at the booth with exponential service times with a mean which you also speicify. The unit of time has been chosen as seconds so that you can see the effects of different rates; a rate of 10 means that one person will show up every 10 seconds on average or the booth will service a person every 10 seconds on average.

Be warned, this uses the java.math.Random() method and is actually only "pseudo-random." Also this is not a bullet proof applet, putting in bad data will cause all those little guys to throw up on you.


Sorry, you must have a Java enabled browser to see these explicit queueing scenes.


Coded by Johnny Tyme . Or Visit Tyme's Home Page.

(C) 1997 By John Tong and M. C. Spruill.