Suppose we have two TCP flows passing through some router

Suppose we have two TCP flows passing through some router -...

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

View Full Document Right Arrow Icon
Suppose we have two TCP flows passing through some router - Assume that rate of packet loss for stream 1 = p 1 - Rate of others for stream 2 = p 2 - Last time T(Throughput) = MTU/RTT Bleh bleh bleh of top “modified” go back n Rules for A: While in state i - If pkt is available and we haven’t sent packet w/ SN=i before, then sent pkt w/ SN = i - Optionally we can send pkts with SN = i + 1, i + 2, i + n -1 - If RN= i is received then send pkt w/ SN = i - If RN= j, where j = i +1, i+ 2,… i +n o Then flush pkts with i , i +1,j-1 and go to state j End do while in state i
Background image of page 1

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

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

Unformatted text preview: Rules for B:-Same as “standard” go back n-While state j, sends RN =j periodically-Other stuff Show protocol doesn’t get stuck Proof of correctness i = state of A j = state of B i ≤ j ≤ i + n why is the state of i always less than the state of j? If i changes the only thing it can change to is something, possibly Bleh bleh, lets assume all this stuff is true, check if we get stuck or not Suppose B is in state j, we know that A is in state at most j. Two cases i ) state of A = i < j ii ) state of A =j bleh bleh works...
View Full Document

Page1 / 2

Suppose we have two TCP flows passing through some router -...

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