Reliable Data Transfer

<h2 id="example-versions">Example Versions</h2>
<p>Sources that describe an example RDT protocol often provide a "version history" to illustrate the development of modern Transport layer techniques, generally resembling the below:
</p>
<h3>Reliable Data Transfer 1.0</h3>
<p>With Reliable Data Transfer 1.0, the data can only be transferred via a reliable data channel.  It is the most simple of the Reliable Data Transfer protocols in terms of algorithm processing.
</p>
<h3>Reliable Data Transfer 2.0</h3>
<p>Reliable Data Transfer 2.0 supports reliable data transfer in unreliable data channels.  It uses a checksum to detect errors.  The receiver sends acknowledgement message if the message is complete, and if the message is incomplete, it sends a negative acknowledgement message and requests the data again. 
</p>
<h3>Reliable Data Transfer 2.1</h3>
<p>Reliable Data Transfer 2.1 also supports reliable data transfers in unreliable data channels and uses a checksum to detect errors. However, to prevent duplicate messages, it adds a sequence number to each <a href="/facts/Network_packet/xCYf8SJu">packet</a>. The receiver sends acknowledgement message with corresponding sequence ID if the data is complete, and sends a negative acknowledgement message with corresponding sequence ID and asks the sender to send again if the message is not complete.
</p>
<h3>Reliable Data Transfer 3.0</h3>
<p>Reliable Data Transfer 3.0, like earlier versions of the protocol, supports reliable data transfer in unreliable data channels, uses checksums to check for errors, and adds sequence numbers to data packets. Additionally, it includes a countdown timer to detect packet loss. If the sender cannot acknowledge specific data in a certain duration, it will consider as packet as lost and will send it again.
</p>

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Reliable_Data_Protocol/B5ewkGAN">Reliable Data Protocol</a></li>
<li><a href="/facts/Computer_Networking/3w5RM99p">Computer Networking</a></li>
<li><a href="/facts/Go-Back-N_ARQ/GyblPqaN">Go-Back-N ARQ</a></li>
<li><a href="/facts/Selective_Repeat_ARQ/cuMB31b5">Selective Repeat ARQ</a></li></ul>

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

<ol>
<li id="fn:1"><p>"Principle Of Reliable Data Transfer Protocol". geeksforgeeks.org. 28 January 2019. <a href="https://www.geeksforgeeks.org/principle-of-reliable-data-transfer-protocol/?ref=lbp" target="_blank">https://www.geeksforgeeks.org/principle-of-reliable-data-transfer-protocol/?ref=lbp</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>"Reliable Data Transfer: rdt2.2 (sender and receiver actions)". University of Massachusetts Amherst. Retrieved 31 December 2021. <a href="https://gaia.cs.umass.edu/kurose_ross/interactive/rdt22.php" target="_blank">https://gaia.cs.umass.edu/kurose_ross/interactive/rdt22.php</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>"Session 6 – Main Theme Reliable Data Transfer" (PDF). New York University. Retrieved 31 December 2009. <a href="https://cs.nyu.edu/~jcf/classes/g22.2262-001_sp10/slides/session6/ReliableDataTransfer.pdf" target="_blank">https://cs.nyu.edu/~jcf/classes/g22.2262-001_sp10/slides/session6/ReliableDataTransfer.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Anirban Mahanti, Instructor of the University of Calgary. "Slide Serve". Retrieved 31 December 2009. <a href="https://www.slideserve.com/nelia/reliable-data-transfer-powerpoint-ppt-presentation" target="_blank">https://www.slideserve.com/nelia/reliable-data-transfer-powerpoint-ppt-presentation</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
</ol>

Reliable Data Transfer open-in-new

Reliable Data Transfer