Poisson process is the process of finding probability of arrival at any given time.

*slide 8:*

eg: M/M/2/5

how many parallel servers do we have? ⇒ 2

Whats sys capacity ⇒ 5

When something is not mentioned, others are infinite

eg:

in M/M/1, only A,B, C are defined, N and K and Infinite

in M/M/2/5, the space in Queue is 3. Here there can be total 5 clients (2 being served and 3 in the queue)

M is coming from Markov model

K is always assumed to be infinite bc arrival time is depended on population.

Eg in mall, if there are 3 cash and 5 queue capacity and there are total 20 people in the mall, if we don’t consier 20 as inifi, our calculations may end or may not be definite.

11

Y axis is no of clients

X axis is time or departure time

14:

l = lamda w

lambda = summation of all lambda