Van de Snepscheut, Jan L. A. (1991) On the Correctness of Sliding Window Protocols. California Institute of Technology , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechAUTHORS:20120426-141614436
- Accepted Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120426-141614436
In this note some struggles with the sliding window protocol and the special case known as the alternating bit protocol, are reported. We try to give a correctness proof, and discover that we cannot do so for one of the versions of the sliding window protocol. One may either require channels that satisfy stronger assumptions or, as we will do, adapt the protocol and stick to the weaker assumptions. The alternating bit protocol can be traced back to [Bartlett]. We have been unable to trace back the origins of the sliding window protocols; [Stenning] discusses one of the versions and lists networks using related protocols.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Computer Science Technical Reports|
|Other Numbering System:|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Kristin Buxton|
|Deposited On:||01 May 2012 20:42|
|Last Modified:||26 Dec 2012 15:08|
Repository Staff Only: item control page