Efficiency of Stop and Wait Protocol - ARQ

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/dll-flow-control/stop-and-wait-arq/asset-efficiency-of-stop-and-wait-protocol-arq after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture explains the efficiency of the Stop and Wait ARQ protocol, deriving the formula η = 1 / (1 + 2a) and calculating effective bandwidth. The instructor begins by defining efficiency as the ratio of useful transmission time (Tt) to total cycle time, which includes waiting periods for acknowledgments. Through algebraic simplification, the formula is reduced to a function of 'a', representing the ratio of propagation delay (Tp) to transmission time. The session concludes with a numerical example calculating throughput based on efficiency and bandwidth.

Chapters

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

    The instructor introduces the concept of efficiency for Stop and Wait ARQ, displaying a slide titled "Efficiency(n):" with the initial formula Useful Time / Total Cycle time = Tt / (Tt + 2 * Tp). He explains that useful transmission time is Tt, while the remaining 2 * Tp represents waiting time for processing. The derivation proceeds by dividing both numerator and denominator by Tt, resulting in the simplified expression n = 1 / (1 + 2 * Tp/Tt). The variable 'a' is defined as the ratio Tp / Tt, leading to the final efficiency formula η = 1 / (1 + 2a).

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

    The lecture continues with the derivation of the efficiency formula η = 1 / (1 + 2a), emphasizing that total time consists of transmission and propagation delays while queuing and processing delays are negligible. A handwritten note on the slide identifies 2 * Tp as Round Trip Time (RTT). The instructor then transitions to defining Throughput or Effective Bandwidth using the formula: Throughput = η * B. This section solidifies the relationship between efficiency and actual data transfer rates, preparing for a numerical application.

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

    The instructor calculates the effective bandwidth for a Stop and Wait protocol by substituting values into the formula Throughput = η * B. With an efficiency (η) of 0.5 and bandwidth (B) of 10 Mbps, the calculation yields a final throughput of 5 Mbps. The result is written and underlined on screen as "5 x 10 Mbps = 5 Mbps". The instructor then begins to illustrate the concept with a diagram representing data frames, visualizing how efficiency impacts frame transmission.

The lecture systematically derives the efficiency metric for Stop and Wait ARQ, starting from fundamental time components. The core formula η = 1 / (1 + 2a) highlights how propagation delay relative to transmission time degrades performance. By defining 'a' as Tp/Tt, the instructor simplifies complex timing relationships into a single variable. The final application demonstrates that even with high bandwidth, low efficiency significantly reduces effective throughput, as shown in the 5 Mbps result from a 10 Mbps link. This progression from theoretical derivation to practical calculation reinforces the importance of minimizing propagation delay in network design.

Loading lesson…