Performance of Stop and Wait Protocol - ARQ

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-networks/dll-flow-control/stop-and-wait-arq/asset-performance-of-stop-and-wait-protocol-arq after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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, 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
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), 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, 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, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment focuses on measuring the performance of the Stop and Wait protocol by deriving a simplified formula for total time. The instructor begins with a comprehensive expression that includes transmission, propagation, queuing, and processing delays for both data and acknowledgment packets. Through a series of standard assumptions—setting queuing and processing delays to zero, treating the acknowledgment transmission time as negligible due to its small size, and equating data and acknowledgment propagation times—the formula is reduced to Total Time = Tt(data) + 2*Tp. The term 2*Tp is explicitly identified as the Round Trip Time (RTT). A hand-drawn diagram on the right side of the slide illustrates the sender-receiver interaction with vertical lines labeled S and R connected by diagonal arrows forming a triangle. The instructor then introduces a numerical example involving a 1 Mbps link, writing calculations for transmission time using the L/B formula and converting bandwidth units to demonstrate how packet size relates to transmission duration. The segment concludes with the instructor circling the 2*Tp term to emphasize its significance as RTT in performance calculations.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor presents a slide titled 'Measuring Performance for Stop and Wait' displaying the full total time formula: Tt(data) + Tp(data) + Delayque + Delaypro + Tt(ack) + Tp(ack). The slide progressively simplifies this by stating 'Queuing delay and processing delays are generally kept 0' and noting that Tt(ack) is negligible because acknowledgment size is very small. The final simplified formula shown is 'Total Time = Tt(data) + 2*Tp', with a note that 'Some times 2 * Tp time is also called Round Trip Time (RTT)'. A hand-drawn diagram on the right shows vertical lines labeled S and R with diagonal arrows forming a triangle to visualize the sender-receiver exchange.

  2. 2:00 – 5:00 02:00-05:00

    The instructor stands before the slide showing the total time expression and begins introducing a numerical example. He writes '1Mb/s' on the board beside the sender label S in the diagram, establishing the link bandwidth for calculations. The slide continues to display the simplification steps from the full formula down to 'Total Time = Tt(data) + 2*Tp'. The instructor points to the initial formula and then to the simplified version, reinforcing the reduction process. He writes '700' on the board and begins setting up a calculation example with '1 Mbps -> Ls' and 'Lb = 1M' at the bottom, preparing to compute transmission time for a specific packet size.

  3. 5:00 – 10:00 05:00-10:00

    The instructor works through the numerical example, writing handwritten conversions at the bottom of the board: '1 Mbps -> 1s', '1b -> 1/1M', and the transmission time formula '= L/B'. A circled expression 'T = ?/5' appears, indicating the calculation of transmission time for a packet. The diagram on the right now shows the link marked '1 Mb/s' with additional written values including '700'. The instructor crosses out terms in the formula to highlight which components are eliminated under standard assumptions, explaining that Tt(ack) is negligible due to small acknowledgment size. The slide note 'Note:- Sometimes 2 * Tp time is also called Round Trip Time (RTT)' remains visible as the instructor connects the simplified formula to practical bandwidth calculations.

  4. 10:00 – 11:09 10:00-11:09

    The instructor concludes the segment by pointing to the formula for Total Time on the whiteboard and circling the 2*Tp term to emphasize its role as Round Trip Time. The slide displays 'Total Time = Tt(data) + 2*Tp' with the note about RTT clearly visible. The handwritten calculations at the bottom show '1 Mbps -> Ls' and '= L/B', reinforcing the transmission time computation method. The instructor uses visual annotations including circles around key terms to highlight important parts of the equation, ensuring students recognize that 2*Tp represents the round trip propagation delay in Stop and Wait performance analysis.

The lecture systematically derives the total time formula for Stop and Wait protocol performance measurement. Starting from a comprehensive expression with six delay components, the instructor applies three key simplifications: zero queuing/processing delays, negligible acknowledgment transmission time, and equal propagation times for data and acknowledgments. This yields the practical formula Total Time = Tt(data) + 2*Tp, where 2*Tp is defined as Round Trip Time. The hand-drawn S-R diagram with triangular arrow paths visually reinforces the sequential nature of Stop and Wait communication. The numerical example with a 1 Mbps link demonstrates how to compute transmission time using L/B, connecting the abstract formula to concrete bandwidth calculations. The progression from general formula to simplified expression to worked example follows a standard pedagogical pattern for networking performance analysis.

Loading lesson…