Practice Question (Throughput)

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/dll-access-control/aloha-protocols/asset-practice-question-throughput after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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, Hardware Basics
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture reviews pure ALOHA throughput calculations, beginning with a GATE-2021 practice question (Q.22) and then working through textbook Examples 12.2 and 12.3 to establish the method before returning to solve Q.22. The instructor emphasizes identifying frame size, channel rate, and offered load G, computing transmission time Tf = L/B, then applying S = G e^{-2G}. For Example 12.3, a 200-bit frame on a 200 kbps channel gives Tf = 1 ms; at 1000 frames/s, G = 1 and S ≈ 0.135 (13.5%). The maximum pure ALOHA throughput is Smax = 1/(2e) ≈ 0.184 (18.4%) at G = 1/2. Finally, for Q.22 with a 1000-bit frame on a 1 Mbps channel and 1000 frames/s, Tf = 1 ms, G = 1, so S ≈ 13.5%.

Chapters

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

    The video opens on slide Q.22, a GATE-2021 pure ALOHA throughput problem: 1,000-bit frames on a 1 Mbps (≈10^6 bps) channel with transmissions following a Poisson process at 1,000 frames/s. The instructor then shifts to Example 12.2, circling the given values '200-bit frames' and '200 kbps', underlining 'average number of frames generated by the system', and writing G= in the corner. The core formula S = G x e^-2G is underlined, and the maximum throughput result Smax = 1/(2e) = 0.184 when G = 1/2 is highlighted as the key pure ALOHA result.

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

    The instructor works the throughput calculation using S = G * e^(-2G), circling the formula and the 18.4 percent maximum value. Handwritten annotations on the right introduce G1, G2 and a total G to break down frame generation rates (e.g., G1 = 2, then G1 = 1 and G2 = 1/2), with a note '1000 -> 184' linking frame rate to throughput. The lesson moves to Example 12.3: a pure ALOHA network transmitting 200-bit frames on a shared channel of 200 kbps. The frame transmission time is computed as 200/200 kbps = 1 ms and circled. For a system creating 1000 frames per second (1 frame per millisecond), G = 1, so S = G * e^-2G = 0.135 (13.5 percent) for case a, while the maximum throughput 0.184 (18.4 percent) is circled for case b.

  3. 5:00 – 6:15 05:00-06:15

    The video returns to the GATE-2021 problem Q.22, with red underlines highlighting '1,000 bits', '1 Mbps (≈ 10^6 bits per second)', and '1,000 frames per second'. Red handwritten work below the text shows Tf = L/B = 1000 x 1000 ns / 10^6, with the result '1ms' circled and an added '= 1'. The instructor then writes the throughput formula S = G x e^-2G, substitutes to get 1 x e^-2, and concludes with '= 13.5%', applying the same method demonstrated in Example 12.3 to solve the practice question.

The lecture teaches a consistent three-step method for pure ALOHA throughput problems. First, extract the frame length L and channel rate B to find transmission time Tf = L/B (in seconds). Second, determine the offered load G from the frame generation rate: if frames are created at a rate such that one frame is generated every Tf, then G = 1; more generally G equals the average number of frames generated per frame transmission time. Third, apply S = G e^{-2G} to find throughput as a fraction of channel capacity. The instructor repeatedly circles the formula and the maximum value Smax = 1/(2e) ≈ 0.184 (18.4%) at G = 1/2, contrasting it with the operating point G = 1 giving S ≈ 0.135 (13.5%). This pattern is first illustrated with Example 12.2 and the worked Example 12.3 (200-bit frames, 200 kbps channel, Tf = 1 ms), then transferred to the GATE-2021 Q.22 (1,000-bit frames, 1 Mbps channel, Tf = 1 ms), where the same G = 1 yields S ≈ 13.5%. The central takeaway is that pure ALOHA throughput depends only on the dimensionless offered load G, and that the maximum achievable efficiency is about 18.4%.

Loading lesson…