Bandwidht Vs Throughput

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/data-communication/signals-metrics/asset-bandwidht-vs-throughput after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. 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, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a clear comparison between bandwidth and throughput, two fundamental concepts in computer networking. The lecture begins by defining bandwidth as the maximum potential capacity of a link, which is a theoretical limit, and states its units are Hertz (Hz) for analog and bits per second (bps) for digital. A diagram illustrates bandwidth as a wide pipe. The video then transitions to define throughput as the actual amount of data successfully transmitted over a specific time, which is typically lower than bandwidth due to delays. The instructor presents the formula for throughput: (Number of Frames × Frame Size) / Total Time in Seconds. To demonstrate the calculation, a worked example is provided: with a bandwidth of 10 Mbps, 2000 frames, each 1000 bytes in size, and a total time of 60 seconds, the throughput is calculated to be 2 Mbps. The video concludes by emphasizing that throughput is the real-world performance, while bandwidth is the theoretical maximum.

Chapters

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

    The video starts with a slide defining bandwidth. The on-screen text states: 'Definition: The maximum potential capacity of a link. It is the theoretical limit of how much data could be sent.' It also specifies the units: 'Unit: Hz (for analog) or bps (for digital).' A diagram on the slide visually represents bandwidth as a wide pipe, labeled 'Bandwidth', and contrasts it with a narrower pipe labeled 'Throughput'. The instructor explains that bandwidth is the theoretical maximum capacity of a link, which is a fixed value. He then writes '= 10 Mbps' on the whiteboard to provide a concrete example of a bandwidth value.

  2. 2:00 – 3:46 02:00-03:46

    The video transitions to a new slide titled 'Throughput'. The definition provided is: 'The actual amount of data that is successfully transmitted at a specific time. Throughput is usually lower than bandwidth due to delay.' The instructor then writes the formula for throughput on the whiteboard: 'Throughput Formula = (Number of Frames × Frame Size) / Total Time in Seconds'. He proceeds to solve a numerical example, writing the values: 'BW = 10 Mbps', 'Number of Frames = 2000', 'Frame Size = 1000 bytes', and 'Total Time = 60 seconds'. He calculates the total data as 2,000,000 bytes and the throughput as 2 Mbps, demonstrating that the actual throughput is significantly less than the theoretical bandwidth.

The video effectively teaches the distinction between bandwidth and throughput by first establishing bandwidth as the theoretical maximum capacity of a network link, using a clear definition and a visual metaphor of a pipe. It then introduces throughput as the practical, real-world data transfer rate, which is always less than or equal to the bandwidth. The core of the lesson is the application of a formula to calculate throughput, which is demonstrated through a step-by-step numerical example. This progression from abstract definition to concrete calculation solidifies the understanding that bandwidth is a potential, while throughput is the actual performance.

Loading lesson…