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 the system
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
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started