1

Quiz 3 Solutions
Communication Networks (EE 706), Spring14

Q UESTION 1 (a) The window size N is 2 after 1 RTT, 22 after 2 RTTs, . . . , 2n after n RTTs for n 9. So after 9 RTTs, N = 29 = 512 and after 10 RTTs, N = min(210 , 1000) = 1000. (b) After 10 RTTs, the number of packets that have been sent and whose ACKs have been received is 1 + 2 + . . . + 29 = 210 1 = 1023 packets. Thereafter, the sender uses a window size of N = 1000, so the transfer completes after 9 more RTTs, i.e., after a total of 19 RTTs. (c) The average throughput is
107 8 190.1

= 42.1 Mbps. Q UESTION 2

In Fig. 1, node u is the destination. The count-to-innity problem occurs if the cost of edge (x, u) increases from 1 to 1000.

Fig. 1.

The gure for Question 2.

Q UESTION 3 (a) False. In the network in Fig. 2, the capacity of both links is 1 unit. Three sessions A, B and C use the network as shown. The allocation rA = 1, rB = 1, rC = 0 is Pareto-efcient, but not max-min fair.

Fig. 2.

The gure for Question 3, part (a).

(b) True. Suppose r = {rp : p P } is max-min fair, but not Pareto efcient. Since it is not Pareto efcient, it is possible to increase rp for some session p while maintaining feasibility without decreasing the rate of any other session. It follows that it is possible to increase the rate rp while maintaining feasibility without decreasing the rate of any session rq for which rq rp . So r is not max-min fair, which is a contradiction. The result follows. Q UESTION 4 Let G be the given graph. There must exist at least one node with no incoming edge. (Otherwise, we could start from any node, say v1 , follow an incoming edge to reach v2 , then follow an incoming edge from v2 to reach v3 and so on until we got a directed cycle.) Number one such node as N . Let G1 be the graph obtained by removing node N and all its outgoing edges from G. Again, there must be at least one node in G1 with no incoming edge in G1 . Number one such node as N 1. We then remove node N 1 and all its outgoing edges from graph G1 to get graph G2 and so on until all the nodes in G are numbered. It is clear from the construction procedure that there may be an edge from i to j only if i > j .