Assignment 2-2016

Question 1: (15 marks)

Explain why worst-case fair WFQ can have the absolute fairness bound.

Question 2: (10 marks)

Consider weighted random early detection (WRED) queue management. The
following two sets of parameters are used for queue management: min th=400, and
maxth=800, and maxp=0.7 for regular packets; minth=100, and maxth=600, and
maxp=0.7 for marked packets. Now let us assume the current average queue size is
500 and a new packet arrives. What is the probability that this new arriving packet
may be dropped if it is a regular packet? What is the probability for it to be dropped if
it is a marked packet?

Question 3: (20 marks)

Consider a delay-jitter regulator. Let us assume that there is a three-hop connection
with four nodes: node 0, node 1, node 2, and node 3. There are three links: link 0
between node 0 and node 1, link 1 between node 1 and node 2, and link 2 between
node 2 and node 3. The maximum delay introduced by node 0 is 5 time units; the
maximum delay introduced by node 1 is 3 time units; the maximum delay introduced
by node 2 is 6 time units; the maximum delay introduced by node 3 is 10 time units.
The maximum delay over link 0 is 4 time units. The maximum delay over link 1 is 5
time units. The maximum delay over link 2 is 10 time units. The following three
packets arrive at node 0: packet 1 arrives at time 0, packet 2 arrives at time 7, and
packet 3 arrives at time 11. Please specify when these three packets will be eligible
for delivery at node 2. Justify your answer.

Question 4: (15 marks)

Consider the max-min weighted fair allocation. There are five connections with
bandwidth demands of (2, 5, 8, 20, 15) and weights (8, 12, 2.5, 7.5, 10). The total
network capacity is 40. What are the final fair shares for these connections.

Question 5: (20 marks)

Consider WFQ (weighted fair queuing). There are four equally weighted connections
A, B, C, and D to a WFQ scheduler. Initially, all these four connections are inactive.
Now suppose that at time 0, a packet of size 2 units arrives at connection B and a
packet of size 3 units arrives at connection D. At time 2, one packet of size 3 units
arrives to connection A. At time 7, one packet of size 4 units arrives to connection C.
At time 10, one more packet of size 4 arrives at connection A. The outgoing link
serving rate is one unit per second. Please specify the finish numbers of all these five
packets. What is the round number when the system becomes idle? What is the time
when the system is idle? Justify your answer.

Question 6: (20 marks)

Consider an 8 8 Batcher-Banyan network. Label the input and output ports from 0
to 7, respectively (the lowest port is port 7). Four packets arriving to the input side of
the Banyan network: packet 1 at input port 1, destined to output port 5; packet 2 at
input port 3, destined to output port 4; packet 3 at input port 5, destined to output port
7; packet 4 at input port 6, destined for output port 7. Which packets will be delivered
during the current round? Justify your answer.