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: Number System, Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Mixture and Alligation, Data Interpretation, Permutation and Combination, Probability, Logarithm, Powers and Exponents (Surds and Indices), Age Problems, Divisibility Rules, Partnership, HCF LCM, Algebra, Pipe and Cistern
- Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Analogy, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Logical Sequence Of Words, Data Sufficiency, Seating Arrangements, Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement
- English Language: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Cloze Test (Cloze Passage), Tenses, Subject Verb Agreement (Verb Noun Agreement), Preposition, Articles, Conjunction, Adverb
- Written English Test: English Writing Ability
- Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
- Communication Round: Communication Assessment
- DBMS (Technical Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Big Data Systems, NoSQL, Data Warehousing & Mining
- SQL (Technical Interview): SQL
- Operating Systems (Technical Interview): 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 (Technical Interview): 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 Security, Cloud Computing and IoT, Cyber and Info Security
- OOPs (Technical Interview): Object Oriented Programming (OOPS)
- HR Interview: MR & HR Interview Preparation
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.

