Question: Consider sending a large file from a host to another over a TCP connection that has no loss. Suppose TCP uses AIMD for its congestion control without slow start. Assuming CongWin increases by 1 MSS every time a batch of ACKs is received and assuming approximately constant RTTs, how long does it take from CongWin to increase from 1 MSS to 6 MSS?
Answer: At the end of 5 RTT's, the CongWin will be 6 MSS.
That seems awfully straightforward to me, but there are these odd little niggling questions... "without slow start" is significant. I'm presuming that "with slow start" would mean the CongWin doubles every RTT, as it does in examples.
Another small problem I'm having: the book depicts an RTT as the time it takes the packet to get from the sender to the receiver, but, uh, that's got to be an error... I mean, dude. ROUND TRIP TIME. Not one way time. Right?
* * *
Edit: OGOD. The next question utilized Dijkstra's Algorithm. Kill me. Please. (Can we say "meaningless grunt work", little children? I knew you could!)