a) Suppose that seven packets arrive at a router according to the pattern in Table 1. Packet A B с D E F G Input Arrival
Posted: Sun May 15, 2022 7:07 pm
c) The random early detection (RED) algorithm was introduced in
the paper S. Floyd and V. Jacobson, "Random early detection
gateways for congestion avoidance", IEEE/ACM Transactions on
Networking, vol. 1, no. 4, pp. 397-413, Aug. 1993, doi:
10.1109/90.251892. Suppose that the current value of count is zero
and that the maximum value for the packet marking probability is
equal to 0.1. Suppose also that the average queue length is halfway
between the minimum and maximum thresholds for the queue. Calculate
the probability that the next packet will not be dropped.
Solve it within 1 hour
a) Suppose that seven packets arrive at a router according to the pattern in Table 1. Packet A B с D E F G Input Arrival time Queue 1 0 1 5 1 6 2 1 2 2 3 3 3 4 Table 1 Packet Length 2 2 3 5 3 6 9 Give the packet output order if weighted fair queuing with a weight of 3 for input queue 3 is used.
the paper S. Floyd and V. Jacobson, "Random early detection
gateways for congestion avoidance", IEEE/ACM Transactions on
Networking, vol. 1, no. 4, pp. 397-413, Aug. 1993, doi:
10.1109/90.251892. Suppose that the current value of count is zero
and that the maximum value for the packet marking probability is
equal to 0.1. Suppose also that the average queue length is halfway
between the minimum and maximum thresholds for the queue. Calculate
the probability that the next packet will not be dropped.
Solve it within 1 hour
a) Suppose that seven packets arrive at a router according to the pattern in Table 1. Packet A B с D E F G Input Arrival time Queue 1 0 1 5 1 6 2 1 2 2 3 3 3 4 Table 1 Packet Length 2 2 3 5 3 6 9 Give the packet output order if weighted fair queuing with a weight of 3 for input queue 3 is used.