ABSTRACT
In thiss chapter, the authors assume a channel that connects the Consumer to the Producer. The channel is a raw communication device that may disorder messages, and the problem is therefore to devise a protocol that implements an orderly operating channel. The buffers here are bounded and acknowledgment messages regulate the message flow. The protocol is proved to satisfy the Sliding- Window axioms. The basic idea of the Sender/Receiver protocol is simple. The Sender attaches tag numbers to the messages sent by Producer, so that the n-th message is tagged with a specific tag number. The aim of the protocols is to ensure that, despite the fact that the given raw channel may disorder messages, the Send/Receive operations form an orderly operating channel of capacity.
