Performance of Stop and Wait Protocol - ARQ

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/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. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: 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) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
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…