Selective Repeat - ARQ
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Paper-2 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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, Hardware Basics, Network Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), 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, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
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
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: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.
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.

