Alternating bit protocol

Alternating bit protocol (ABP) is a simple network protocol operating at the data link layer (OSI layer 2) that retransmits lost or corrupted messages using FIFO semantics. It can be seen as a special case of a sliding window protocol where a simple timer restricts the order of messages to ensure receivers send messages in turn while using a window of 1 bit.[1]

Design

Messages are sent from transmitter A to receiver B. Assume that the channel from A to B is initialized and that there are no messages in transit. Each message from A to B contains a data part and a one-bit sequence number, i.e., a value that is 0 or 1. B has two acknowledge codes that it can send to A: ACK0 and ACK1.

When A sends a message, it resends it continuously, with the same sequence number, until it receives an acknowledgment from B that contains the same sequence number. When that happens, A complements (flips) the sequence number and starts transmitting the next message.

When B receives a message that is not corrupted and has sequence number 0, it starts sending ACK0 and keeps doing so until it receives a valid message with number 1. Then it starts sending ACK1, etc.

This means that A may still receive ACK0 when it is already transmitting messages with sequence number one. (And vice versa.) It treats such messages as negative-acknowledge codes (NAKs). The simplest behaviour is to ignore them all and continue transmitting.

The protocol may be initialized by sending bogus messages and acks with sequence number 1. The first message with sequence number 0 is a real message.

A variant of this protocol, introduced by Philips, is called Bounded Retransmission Protocol (BRP). Unlike ABP, BRP deals with sequence numbers of datum in the file and interrupts transfer after fixed number of retransmissions for a datum.[2]

History

An Alternating Bit Protocol was used by the ARPANET and the European Informatics Network.[3]

gollark: Somehow.
gollark: I blame networking somehow.
gollark: Isn't that just a LIDAR thing with extra steps?
gollark: I think "neoliberal" is roughly "generally satisfied with the status quo".
gollark: Political opinion calendars are the way.

See also

References

This article is based on material taken from the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the "relicensing" terms of the GFDL, version 1.3 or later.

  1. Tel, Gerard (2000). Introduction to distributed algorithms. Cambridge. p. 85. ISBN 0521794838.
  2. "TreX's Examples -- Bounded Retransmission Protocol". www.irif.fr.
  3. Davies, Donald Watts (1979). Computer networks and their protocols. Internet Archive. Chichester, [Eng.] ; New York : Wiley. pp. 206.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.