Selective Repeat - ARQ

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/RPSC-PROGRAMMER/paper-1-data-communication-network/dll-flow-control/selective-repeat-arq/asset-selective-repeat-arq after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper 1 | Reasoning Test: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
  2. Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
  3. Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
  4. Paper 1 | 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, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
  5. Paper 1 | Data Communication & Network: 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
  6. Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
  7. Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
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…