Little's Law with multiple queues of different priorities. Assume a single application sending packets with random...

Transcribed Image Text:

Little's Law with multiple queues of different priorities. Assume a single application sending packets with random interarrival times at rate λ to a network switch with three queues numbered 1, 2, 3. Assume packets are labeled by the application with three different priorities, namely, 1, 2, 3. Packets will enter the queue with the matching number. One network interface card (NIC) sends packets out from the three queues as long as any queue has packets in it. If the average delay observed at the output, regardless of priorities, is T, what is the queue size required for queue #1, queue #2, and queue #3? Little's Law with multiple queues of different priorities. Assume a single application sending packets with random interarrival times at rate λ to a network switch with three queues numbered 1, 2, 3. Assume packets are labeled by the application with three different priorities, namely, 1, 2, 3. Packets will enter the queue with the matching number. One network interface card (NIC) sends packets out from the three queues as long as any queue has packets in it. If the average delay observed at the output, regardless of priorities, is T, what is the queue size required for queue #1, queue #2, and queue #3?

Answer rating: 100% (QA)

To determine the queue size required for each of the three queues Queue 1 Queue 2 and Queue 3 when L... View the full answer