Bandwidht Vs Throughput

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: 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, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: 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, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…