655 views
1 votes
1 votes
Consider a misbehaving TCP receiver. The receiver modifies its TCP such that upon receiving a data segment containing N bytes, the receiver divides the resulting acknowledgment into M, where M≤Nseperate acknowledgements each covering one of M distinct pieces of the received data segment. For e.g.
if it receives data acknowledging bytes 1 to 1000, then the receiver, for M=2 , will send 2 ACKs for 501 and 1001.

Assuming no losses and negligible packet transmission time, an expression for the sender window size during the slow start phase, in terms of n (number of RTTs) and M is ?

(A)$M^n$

(B)$(M+1)^n$

(C)$M(M+1)^{n-1}$

(D)$n^M$

Please log in or register to answer this question.

Answer:

No related questions found