Performance of Stop and Wait Protocol - ARQ

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-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. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…