Selective Repeat - ARQ

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/MCA-ENTRANCE-EXAM/computer-networks/dll-flow-control/selective-repeat-arq/asset-selective-repeat-arq after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
  2. Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
  3. English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  5. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  6. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  7. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
  8. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  9. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Selective Repeat Automatic Repeat Request (ARQ), a protocol designed for noisy links where only damaged frames are resent rather than multiple frames. The instructor contrasts this with Go-Back-N ARQ, emphasizing that Selective Repeat requires the sender and receiver window size to be at most one-half of 2^m. The session progresses through timer handling mechanisms, where a tree diagram illustrates that one timer is used for each frame sent. Key events include the loss of Frame 1, triggering a NAK and subsequent retransmission of specific frames. The instructor explains that if a valid NAK frame arrives, the sender resends only the corresponding frame. The lecture concludes with mathematical derivations for sequence and acknowledgement numbers, utilizing formulas like $W_s = (1 + 2a)$ to maximize efficiency and calculating bits required as $ ext{ceil}( ext{log}_2(1 + 2a))$.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video begins with a presentation slide titled "Selective Repeat Automatic Repeat Request" contrasting the protocol with Go-Back-N ARQ. Text on screen explains that for noisy links, a mechanism exists where only damaged frames are resent rather than multiple frames. The scene shifts to a detailed timing diagram illustrating communication between Sender A and Receiver B, showing frame transmission, acknowledgments, a lost frame event, and subsequent retransmission. Visible text notes that the sender and receiver window size must be at most one-half of 2^m.

  2. 2:00 – 5:00 02:00-05:00

    The instructor explains the timer handling mechanism in Selective Repeat ARQ, drawing a tree diagram to illustrate how timers are managed for each frame sent. The slide details a sequence where Frame 1 is lost, triggering a NAK and subsequent retransmission of frames. The instructor highlights the NAK arrow to emphasize that a valid NAK triggers a retransmission of only the specific missing frame. On-screen text states, "If a valid NAK frame arrives, we just resend the corresponding frame," and shows Frame 1 (resend) following a NAK.

  3. 5:00 – 5:26 05:00-05:26

    The video features a lecturer explaining "Sequence and Acknowledgement Numbers" for Selective Repeat ARQ. The whiteboard displays formulas for maximizing efficiency, specifically the window size $W_s = (1 + 2a)$ and the bits required $ ext{ceil}( ext{log}_2(1 + 2a))$. Handwritten calculations show the derivation of sequence number bits, starting with $75 + 1 = 76$ and comparing powers of 2 like $2^6=64$, $2^7=128$, and $2^8=256$. The instructor writes out utilization formulas involving transmission time ($T_T$) and propagation delay ($T_P$).

The lecture systematically builds understanding of Selective Repeat ARQ by first defining its core advantage over Go-Back-N: selective retransmission of only damaged frames. The instructor uses visual timing diagrams to demonstrate the protocol's operation, specifically focusing on how lost frames trigger NAKs and specific retransmissions. A critical constraint highlighted is the window size limitation of $2^{m-1}$ to prevent ambiguity. The session concludes with practical mathematical applications, deriving the necessary sequence number bits and window sizes to maximize channel utilization based on propagation delay and transmission time. This progression from conceptual definition to operational mechanics and finally to mathematical optimization provides a comprehensive overview of the protocol's design principles.

Loading lesson…