Performance of Go Back N - ARQ
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- 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)
- 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)
- 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
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- 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
- 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
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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 segment focuses on optimizing transmission efficiency within the Go Back N Automatic Repeat reQuest (ARQ) protocol. The instructor establishes that to maximize efficiency, the sender must keep multiple packets in transition while waiting for acknowledgments. This concept is visually supported by a whiteboard titled "Sequence and Acknowledgement Numbers" featuring handwritten derivations. The core mathematical relationship defines the optimal window size ($W_s$) as $1 + 2a$, where 'a' represents the ratio of propagation delay to transmission time. The lecture further details how to determine the necessary sequence number bits using a logarithmic ceiling function, specifically $\lceil \log_2(1 + 2a) \rceil$. Visual evidence includes calculations showing $75 + 1 = 76$ and comparisons of powers of two ($2^6=64, 2^7=128$) to justify bit allocation.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the fundamental requirement for maximizing efficiency in Go Back N ARQ: filling the transmission pipe with multiple packets in transition. On-screen text explicitly states, "To improve the efficiency of transmission (to fill the pipe), multiple packets must be in transition while the sender..." The derivation of the window size formula $W_s = 1 + 2a$ is presented alongside efficiency calculations ($\eta = U.T / T.T$). The instructor uses handwritten notes to demonstrate that efficiency equals 1 when the window size is optimal. A diagram of packets in transition with 'X' marks indicates the flow, and the instructor points to formulas relating window size to transmission and propagation delays.
2:00 – 4:25 02:00-04:25
The lecture transitions to calculating the specific number of bits required for sequence numbers based on the derived window size. The whiteboard displays the formula $\text{Number of bits required for sequence numbers} = \lceil \log_2(1 + 2a) \rceil$. Concrete calculations are visible, including $75 + 1 = 76$ circled in red and powers of two ($2^6=64, 2^7=128$) to illustrate bit capacity. Red boxes and arrows highlight the window size equation $W_s = (1 + 2a)$, connecting it to the diagram of packets. The instructor stands before the board titled "Sequence and Acknowledgement Numbers," emphasizing that sequence numbers must cover the entire window size to prevent ambiguity.
The video provides a concise derivation of Go Back N ARQ efficiency parameters. The central thesis is that transmission efficiency depends on the sender's ability to transmit continuously without waiting for individual acknowledgments. This is achieved by setting the window size $W_s$ to $1 + 2a$. The lecture logically progresses from defining this window size to calculating the sequence number bits needed to support it. Key evidence includes the handwritten efficiency formula $\eta = U.T / T.T$ and the logarithmic bit calculation. The visual aids, such as red circles around $75 + 1 = 76$ and the comparison of $2^6$ versus $2^7$, serve to concretize abstract delay ratios into practical bit allocations. The progression ensures students understand both the theoretical limit of efficiency and the implementation details required for sequence numbering.

