Question: Consider the single-server queue with geometrically distributed inter-arrival times and service times, with parameters and respectively, as discussed in class. Now assume that

Consider the single-server queue with geometrically distributed inter-arrival times and service times, with parameters λ and µ respectively, as discussed in class. Now assume that the system can store a maximum of 3 packets (including the one in service).

• Draw the state transition diagram of the queueing system.

• Write down the balance equations of each state.

• Solve the steady-state probabilities.

• What is the probability that a new arrival will be rejected because the queue is full?

What is the average number of packets in the system?

• What is the average packet delay in the system?


Step by Step Solution

3.37 Rating (150 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Consider the singleserver queue with geometrically distributed interarrival times and service times ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Operating System Questions!