Selective Repeat ARQ

<h2 id="summary">Summary</h2>
Selective Repeat is part of the automatic repeat request (ARQ). With selective repeat, the sender sends a number of frames specified by a window size even without the need to wait for individual ACK from the receiver as in <a href="/facts/Go-Back-N_ARQ/GyblPqaN">Go-Back-N ARQ</a>. The receiver may selectively reject a single frame, which may be retransmitted alone; this contrasts with other forms of ARQ, which must send every frame from that point again. The receiver accepts out-of-order frames and buffers them. The sender individually retransmits frames that have timed out.

<h2 id="concept">Concept</h2>
It may be used as a protocol for the delivery and acknowledgement of message units, or it may be used as a protocol for the delivery of subdivided message sub-units.
When used as the protocol for the delivery of messages, the sending process continues to send a number of <a href="/facts/Data_frame/ltGCbJIq">frames</a> specified by a window size even after a frame loss. Unlike <a href="/facts/Go-Back-N_ARQ/GyblPqaN">Go-Back-N ARQ</a>, the receiving process will continue to accept and <a href="/facts/Acknowledgement_(data_networks)/NCc7vbwE">acknowledge</a> frames sent after an initial error; this is the general case of the <a href="/facts/Sliding_window_protocol/TvkveH2L">sliding window protocol</a> with both transmit and receive window sizes greater than 1.
The receiver process keeps track of the sequence number of the earliest frame it has not received, and sends that number with every <a href="/facts/Acknowledgement_(data_networks)/NCc7vbwE">acknowledgement</a> (ACK) it sends. If a frame from the sender does not reach the receiver, the sender continues to send subsequent frames until it has emptied its window. The receiver continues to fill its receiving window with the subsequent frames, replying each time with an ACK containing the sequence number of the earliest missing <a href="/facts/Data_frame/ltGCbJIq">frame</a>. Once the sender has sent all the frames in its window, it re-sends the frame number given by the ACKs, and then continues where it left off.
The size of the sending and receiving windows must be equal, and half the maximum sequence number (assuming that sequence numbers are numbered from 0 to n−1) to avoid miscommunication in all cases of packets being dropped. To understand this, consider the case when all ACKs are destroyed. If the receiving window is larger than half the maximum sequence number, some, possibly even all, of the packets that are present after timeouts are duplicates that are not recognized as such. The sender moves its window for every packet that is acknowledged.<a class="footnote-ref" id="fnref:1" href="#fn:1">1</a>
When used as the protocol for the delivery of subdivided messages it works somewhat differently. In non-continuous channels where messages may be variable in length, standard ARQ or Hybrid ARQ protocols may treat the message as a single unit. Alternately selective retransmission may be employed in conjunction with the basic ARQ mechanism where the message is first subdivided into sub-blocks (typically of fixed length) in a process called <a href="/facts/Packet_segmentation/K0UY3pNh">packet segmentation</a>. The original variable length message is thus represented as a concatenation of a variable number of sub-blocks. While in standard ARQ the message as a whole is either acknowledged (ACKed) or negatively acknowledged (NAKed), in ARQ with selective transmission the ACK response would additionally carry a bit flag indicating the identity of each sub-block successfully received. In ARQ with selective retransmission of sub-divided messages each retransmission diminishes in length, needing to only contain the sub-blocks that were linked.
In most channel models with variable length messages, the probability of error-free reception diminishes in inverse proportion with increasing message length. In other words, it's easier to receive a short message than a longer message. Therefore, standard ARQ techniques involving variable length messages have increased difficulty delivering longer messages, as each repeat is the full length. Selective re-transmission applied to variable length messages completely eliminates the difficulty in delivering longer messages, as successfully delivered sub-blocks are retained after each transmission, and the number of outstanding sub-blocks in following transmissions diminishes. Selective Repeat is implemented in UDP transmission.

<h2 id="pseudocode">Pseudocode</h2>
These examples assume an infinite number of sequence and request numbers.<a class="footnote-ref" id="fnref:2" href="#fn:2">2</a>

N  := window size
Rn := request number
Sn := sequence number
Sb := sequence base
Sm := sequence max
buffer[] := buffer to store out-of-order packets

function receiver is
 Rn := 0
 buffer := empty
 Do the following forever:
 if the packet received is error-free and Sn = Rn then
 Accept the packet and send it to a higher layer
 Rn := Rn + 1

while buffer[Rn] exists do
 Accept the packet from the buffer and send it to a higher layer
 Remove packet Rn from the buffer
 Rn := Rn + 1
 
 else if the packet received is error-free and Sn > Rn then
 Buffer the packet at position Sn
 else
 Ignore packet
 Send a Request for Rn

function sender is
 Sb := 0
 Sm := N + 1
 buffer := empty

Repeat the following steps forever:
 if you receive a request number where Rn > Sb then
 Sm := (Sm − Sb) + Rn
 Sb := Rn

Remove packets with Sn < Rn from the buffer

if no packet is in transmission then
 Transmit a packet where Sb ≤ Sn < Sm
 Store the transmitted packet in the buffer

for each packet Sn in buffer do
 if packet Sn timeout occurred then
 Retransmit packet Sn

<h2 id="choosing-a-window-size-n">Choosing a window size (N)</h2>
There are a few things to keep in mind when choosing a value for N in Selective Repeat ARQ:

<ol><li>The sender must not transmit faster than the receiver can handle. N should be bounded by the receiver’s capacity to process and buffer out-of-order packets.</li>
<li>N must be less than half the total number of sequence numbers (if they are numbered from zero to the maximum value of the sequence number space) to avoid ambiguity in detecting duplicate packets and dropped acknowledgments.<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a></li>
<li>Considering the constraints in (1) and (2), choose N to be as large as possible to maximize throughput.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a></li></ol>
<h2 id="examples">Examples</h2>
The <a href="/facts/Transmission_Control_Protocol/WW4sPrt9">Transmission Control Protocol</a> uses a variant of <a href="/facts/Go-Back-N_ARQ/GyblPqaN">Go-Back-N ARQ</a> to ensure reliable transmission of data over the <a href="/facts/Internet_Protocol/Qq6VeEal">Internet Protocol</a>, which does not provide guaranteed delivery of packets; with <a href="/facts/Transmission_Control_Protocol/WW4sPrt9">Selective Acknowledgement (SACK) extension</a>, it may also use Selective Repeat ARQ.
The <a href="/facts/ITU-T/9nJwkPYx">ITU-T</a> <a href="/facts/G.hn/Tf9P5x7s">G.hn</a> standard, which provides a way to create a high-speed (up to 1 Gigabit/s) <a href="/facts/Local_area_network/edUDxJ6J">Local area network</a> using existing home wiring (<a href="/facts/Power_line_communication/y0QpHy0V">power lines</a>, phone lines and <a href="/facts/Ethernet_over_coax/MYXFbf0C">coaxial cables</a>), uses Selective Repeat ARQ to ensure reliable transmission over noisy media. <a href="/facts/G.hn/Tf9P5x7s">G.hn</a> employs <a href="/facts/Packet_segmentation/K0UY3pNh">packet segmentation</a> to sub-divide messages into smaller units, to increase the probability that each one is received correctly.
The <a href="/facts/STANAG_5066/RSRfh4Xk">STANAG 5066</a> Profile for High Frequency (HF) Radio Data Communication uses selective repeat ARQ, with a maximum window size of 128 protocol-data units (PDUs).

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Go-Back-N_ARQ/GyblPqaN">Go-Back-N ARQ</a></li>
<li><a href="/facts/Reliable_Data_Transfer/HQ8SD4NP">Reliable Data Transfer</a></li>
<li><a href="/facts/Pipeline_(software)/vNahQdsH">Pipeline (software)</a></li>
<li><a href="/facts/Automatic_repeat_request/1bR2urmF">Automatic repeat request</a></li>
<li><a href="/facts/Computer_networking/3w5RM99p">Computer networking</a></li></ul>

<h2 id="further-reading">Further reading</h2>
<ul><li>Lockitt, J. A.; Gatfield, A. G.; Dobyns, T. R. (1975). A Selective Repeat ARQ system. 3rd International Conference on Digital Satellite Communications. 3rd International Conference on Digital Satellite Communications. pp. 189–195. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/1975dsc..conf..189L">1975dsc..conf..189L</a>.</li>
<li>Weldon, E. (March 1982). "An Improved Selective-Repeat ARQ Strategy". IEEE Transactions on Communications. 30 (3): 480–486. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/1982ITCom..30..480W">1982ITCom..30..480W</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FTCOM.1982.1095497">10.1109/TCOM.1982.1095497</a>. <a href="/facts/ISSN_(identifier)/DPAflDvU">ISSN</a> <a href="https://search.worldcat.org/issn/0090-6778">0090-6778</a>.</li>
<li>Comroe, R.; D. Costello (July 1984). "ARQ schemes for data transmission in mobile radio systems". IEEE Journal on Selected Areas in Communications. 2 (4): 472–481. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/1984IJSAC...2..472C">1984IJSAC...2..472C</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FJSAC.1984.1146084">10.1109/JSAC.1984.1146084</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:22759443">22759443</a>.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Tanenbaum, Andrew S. (2003). Computer Networks (4th ed.). Prentice Hall. ISBN 0-13-066102-3. <a href="0-13-066102-3" target="_blank">0-13-066102-3</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Kurose, James F.; Keith W. Ross. Computer Networking: A Top-Down Approach. ISBN 0-321-49770-8. <a href="0-321-49770-8" target="_blank">0-321-49770-8</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Tanenbaum, Andrew S. (2003). Computer Networks (4th ed.). Prentice Hall. ISBN 0-13-066102-3. <a href="0-13-066102-3" target="_blank">0-13-066102-3</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Marbach, Peter. "ARQ Protocols" (PDF). Retrieved August 24, 2013. <a href="http://www.cs.toronto.edu/~marbach/COURSES/CSC358_S14/l4.pdf" target="_blank">http://www.cs.toronto.edu/~marbach/COURSES/CSC358_S14/l4.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
</ol>

Selective Repeat ARQ open-in-new

Selective Repeat ARQ