About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
A Queueing Analysis of Two ARQ Protocols
Abstract
In every data communication system, a procedure must be provided to allow for the retransmission of data when errors are detected. The receiving node is required to make a (positive/negative) acknowledgment (ACK/NACK) to the sending node. Until an acknowledgment is received, a “copy” of the message must be retained at the sending node. If an ACK is received, the space assigned to the “copy” is released. If either a NACK or no acknowledgment is received in a suitable interval of time, retransmission is required. Different protocols specifying how the nodes recover from a transmission error can be defined. In this paper, we present a queueing analysis of the two ARQ (automatic repeat request) protocols-block and select ARQ-for a (slotted) concentrator network node. Copyright © 1980 by The Institute of Electrical and Electronics Engineers, Inc.