Performance of Stop and Wait Protocol - ARQ
Duration: 11 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Paper 1 | Reasoning Test: 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, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, 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, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
- Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
- Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
- Paper 1 | 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, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
- Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
- Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
- Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
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
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: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.
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.
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.

