The Sliding Window Protocol Revisited

Van de Snepscheut, Jan L. A. (1991) The Sliding Window Protocol Revisited. Technical Report. California Institute of Technology. [CaltechCSTR:1991.cs-tr-91-06]

Full text available as:

Postscript - Requires a viewer, such as GhostView

Abstract

We give a correctness proof of the sliding window protocol. Both safety and liveness properties are addressed. We show how faulty channels can be represented as nondeterministic programs. The correctness proof is given as a sequence of correctness-preserving transformations of a sequential program that satisfies the original specification, with the exception that it does not have any faulty channels. We work as long as possible with a sequential program, although the transformation steps are guided by the aim of going to a distributed program. The final transformation steps consist in distributing the actions of the sequential program over a number of processes.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	84
Deposited By:	Caltech Library System
Deposited On:	25 April 2001
Record Number:	CaltechCSTR:1991.cs-tr-91-06
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1991.cs-tr-91-06
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record