Performance of Go Back N - ARQ

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/dll-flow-control/go-back-n-protocol/asset-performance-of-go-back-n-arq after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
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

  1. 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. 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.

Loading lesson…