Abstract
A window protocol based on the block acknowledgment method, in which acknowledgment message has two numbers, m and n, to acknowledge the reception of all data messages with sequence numbers ranging from m to n, is discussed. In the window protocol, message sequence numbers are taken from a finite domain and both message disorder and loss can be tolerated. An initial version of the protocol that uses a simplified timeout action and unbounded sequence numbers is presented, the simplified timeout action in the protocol is replaced by a sophisticated one without disturbing the protocol's correctness, and the unbounded sequence numbers are replaced by bounded ones while preserving the protocol's correctness. Remarks concerning other variations of the protocol are also presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
