A2-2009-10 - Q1: Refer to Fig.1, which illustrates the...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Q1: Refer to Fig.1, which illustrates the convergence of TCP’s AIMD algorithm. Suppose that instead of a multiplicative decrease, TCP decreased the window size by a constant amount. Would the resulting AIAD algorithm converge to an equal share algorithm? Justify your answer using a diagram similar to Fig. 1. Fig 1: Convergence of TCP’s AIMD algorithm. Q2: Consider sending a large file from a host to another over a TCP connection that has no loss. a) Suppose TCP uses AIMD for its congestion control without low start. Assuming CongWin increases by 1 MSS every time a batch of ACKs is received and assuming approximately constant round-trip times, how long does it take for CongWin to increase from 1 MSS to 6 MSS (assuming no loss events)? b) What is the average throughout (in terms of MSS and RTT) for this connection up through time = 5 RTT? Q3: Consider the following two questions. a) A bare-bones forwarding table in a VC network has four columns. What is the meaning of the values in each of these columns? A bare-bones forwarding table in
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/19/2010 for the course COMPUTER cs5294 taught by Professor Abc during the Spring '10 term at City UK.

Page1 / 3

A2-2009-10 - Q1: Refer to Fig.1, which illustrates the...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online