A queue is observed over 10000 one-second time intervals with data as given below in the array qdata.
Construct a Poisson nearest neighbour model with a single arrival and servicing pattern and hence answer the following questions:
- What is the average time taken for 1 customer to arrive?
- What is the average number of customer servicings per second?
- What is your estimate for the equilibrium probability 𝑃(𝑛≥4)
- P(n≥4), where 𝑛
- n is the queue size in this model?
- Suppose that two equivalent servers are introduced. What would the equilibrium probability 𝑃(𝑛≥4)
- P(n≥4) then be?
Comments
Leave a comment