|
|
Subject:
TCP/IP Receiver's Window Zero Behavior
Category: Computers > Internet Asked by: nambiar-ga List Price: $5.00 |
Posted:
24 Oct 2005 07:02 PDT
Expires: 23 Nov 2005 06:02 PST Question ID: 584140 |
The question is regarding Window zero behavior in TCP (Transmission control protocol) Consider sender S and receiver R. 1> R advertises a window of W. 2> S sends N packets (such that N = X + Y) such that sum of bytes of all packets/segments is less than W. 3> The first X packets/segments reach R in proper sequence. 4> R copies all X packets/segments. Realizes that it is out of buffer space. 5> R sends a zero window packet with the acknowlegement number set such that all X packets are acknowledged. 6> R is succesful in making free buffer space for just Y packets. 7> The next Y packets reach R in proper sequence. 8> R copies all Y packets. Realizes that it is out of buffer space. 9> R sends a zero window packet with the acknowledgement number set such that all N packets are acknowledged. The question is 1> Is such a sequence of events possible? 2> Even if the above sequence of events is not possible - is it possible that during the data transfer phase R sends acknowledgement packets in the following sequence with the properties (No other packets from sender or reciver in between) 1> Window size = 0, Acknowledgement number = A1 2> Window size = 0, Acknowledgement number = A2 where A2 > A1 Please support your answers with -> Reference to relevant lines in standard documents OR -> Reference to lines of code of the TCP/IP stack which I can see |
|
There is no answer at this time. |
|
There are no comments at this time. |
If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you. |
Search Google Answers for |
Google Home - Answers FAQ - Terms of Service - Privacy Policy |