Lec-25: Selective Repeat ARQ (Automatic Repeat Request) | Data Link Layer

Lec-25: Selective Repeat ARQ (Automatic Repeat Request) | Data Link Layer

Selective Repeat

This section discusses the concept of Selective Repeat in sliding window protocols. The sender and receiver windows have the same size, which is determined by 2^m - 1, where m is the sequence number length.

Sender and Receiver Window Size

  • The sender and receiver windows have the same size, which is determined by 2^m - 1.
  • For example, if m = 3, the sequence number range is 0 to 7, so the sender and receiver window sizes are both 4 (0 to 3).
  • The window size should not be greater than 2^m - 1 to avoid problems with lost acknowledgements.

Handling Out-of-Order Packets

  • Selective Repeat allows for out-of-order packets to be accepted.
  • The receiver window can accept any packet within its window range, regardless of the order in which they were sent.

Avoiding Duplicate Packets

  • To avoid accepting duplicate packets, the window size should not be greater than 2^m - 1.
  • If a larger window size is used, duplicate packets may be accepted when retransmissions occur.

Conclusion

This section concludes the discussion on Selective Repeat and highlights key points to remember.

Key Points

  • The sender and receiver windows in Selective Repeat have the same size.
  • The window size should be equal to or smaller than 2^m - 1 to avoid issues with lost acknowledgements.
  • Selective Repeat allows for out-of-order packets to be accepted.
  • Duplicate packets can be avoided by using an appropriate window size.

NAK - Negative Acknowledgement

This section discusses the concept of negative acknowledgement (NAK).

NAK - Negative Acknowledgement

  • A negative acknowledgement (NAK) is a response sent by a receiver to indicate that there was an error or failure in receiving or processing data.
  • It is used in communication protocols to inform the sender that the message was not successfully received or processed.
  • NAK helps in ensuring reliable and accurate data transmission by allowing the sender to retransmit the message if it receives a NAK response.

No specific timestamp was provided for this section.

Turn any video into a summary like this

YouTube links, meetings, lectures. With transcripts, search, and chat.

Video description

πŸš€ MASTER COMPUTER SCIENCE | INTERVIEWS | EXAMS Gate Smashers β€” Learn Computer Science through free lectures, structured playlists, interview resources, important questions, notes & exam preparation. πŸ’»πŸ“š 🌐 FREE CS RESOURCES & INTERVIEW PREPARATION : https://gatesmashers.com ━━━━━━━━━━━━━━━━━━━━━━ πŸ“š SUBJECT-WISE COMPUTER SCIENCE PLAYLISTS β–Ί Placement Interview Questions: https://youtube.com/playlist?list=PLUDPUBNI7KL4 β–Ί System Design: https://youtube.com/playlist?list=PLxCzCOWd7aiHanm1nA5_fMwbx5dCNFkDX β–Ί Deep Learning: https://youtube.com/playlist?list=PLxCzCOWd7aiHQ9Qyo70JCTkTxczPnVC6s β–Ί Machine Learning: https://youtube.com/playlist?list=PLxCzCOWd7aiEXg5BV10k9THtjnS48yI-T&si=qPGIoiBrziIFs6CJ β–Ί Design and Analysis of Algorithms (DAA): https://youtube.com/playlist?list=PLxCzCOWd7aiHcmS4i14bI0VrMbZTUvlTa β–Ί Software Engineering: https://youtube.com/playlist?list=PLxCzCOWd7aiEed7SKZBnC6ypFDWYLRvB2 β–Ί Database Management System (DBMS): https://youtube.com/playlist?list=PLxCzCOWd7aiFAN6I8CuViBuCdJgiOkT2Y β–Ί Cloud Computing: https://youtube.com/playlist?list=PLxCzCOWd7aiHRHVUtR-O52MsrdUSrzuy4 β–Ί Theory of Computation (TOC): https://youtube.com/playlist?list=PLxCzCOWd7aiFM9Lj5G9G_76adtyb4ef7i β–Ί Artificial Intelligence: https://youtube.com/playlist?list=PLxCzCOWd7aiHGhOHV-nwb0HR5US5GFKFI β–Ί Computer Networks (CN): https://youtube.com/playlist?list=PLxCzCOWd7aiGFBD2-2joCpWOLUrDLvVV_ β–Ί Operating System (OS): https://youtube.com/playlist?list=PLxCzCOWd7aiGz9donHRrE9I3Mwn6XdP8p β–Ί Structured Query Language (SQL): https://youtube.com/playlist?list=PLxCzCOWd7aiHqU4HKL7-SITyuSIcD93id β–Ί Discrete Mathematics: https://youtube.com/playlist?list=PLxCzCOWd7aiH2wwES9vPWsEL6ipTaUSl3 β–Ί Compiler Design: https://youtube.com/playlist?list=PLxCzCOWd7aiEKtKSIHYusizkESC42diyc β–Ί Number System: https://youtube.com/playlist?list=PLxCzCOWd7aiFOet6KEEqDff1aXEGLdUzn β–Ί Programming in C: https://youtube.com/playlist?list=PLxCzCOWd7aiGmiGl_DOuRMJYG8tOVuapB β–Ί Data Structures: https://youtube.com/playlist?list=PLxCzCOWd7aiEwaANNt3OqJPVIxwp2ebiT β–Ί Computer Architecture: https://youtube.com/playlist?list=PLxCzCOWd7aiHMonh3G6QNKq53C6oNXGrX β–Ί Graph Theory: https://youtube.com/playlist?list=PLxCzCOWd7aiG0M5FqjyoqB20Edk0tyzVt β–Ί Digital Logic: https://youtube.com/playlist?list=PLxCzCOWd7aiGmXg4NoX6R31AsC5LeCPHe ━━━━━━━━━━━━━━━━━━━━━━ 🌐 CONNECT WITH GATE SMASHERS β–Ί Website: https://gatesmashers.com β–Ί YouTube: https://youtube.com/gatesmashers β–Ί Instagram: https://instagram.com/gate.smashers β–Ί Telegram: https://t.me/gatesmashersofficial β–Ί Facebook: https://facebook.com/gatesmashers β–Ί Threads: https://threads.net/@gate.smashers GsetGo β–Ί YouTube: https://youtube.com/@GSetgoofficial β–Ί Instagram: https://instagram.com/gsetgo_ VarunNainaShots β–Ί YouTube: https://youtube.com/@varunainashots β–Ί Instagram: https://instagram.com/varunainashots ━━━━━━━━━━━━━━━━━━━━━━ Subscribe to Gate Smashers and start your Computer Science learning journey today! πŸš€πŸ’»