Transmission Vs Propogation delay

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/data-communication/signals-metrics/asset-transmission-vs-propogation-delay after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. 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, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed explanation of two fundamental types of network latency: transmission delay and propagation delay. The lecture begins by introducing transmission delay, defined as the time required to push all the bits of a packet onto the transmission link, and presents the formula: Transmission Delay = Data Size (bits) / Bandwidth (bps). The instructor then transitions to propagation delay, defined as the time it takes for a single bit to travel from the sender to the receiver through the physical medium, with the formula: Propagation Delay = Distance (m) / Propagation Speed (m/s). The video includes a worked example for propagation delay, using a distance of 4800 km and a signal speed of 2x10^8 m/s, which results in a delay of 24 milliseconds. The instructor also provides a worked example for transmission delay, calculating the delay for a 14-byte packet over a 100 Mbps link, resulting in 1.12 microseconds. The presentation uses a digital whiteboard with clear diagrams and step-by-step calculations to illustrate the concepts.

Chapters

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

    The video opens with a slide titled 'Transmission & Propagation Delay' which introduces the two main types of latency. The first concept, 'Transmission Delay,' is defined as the time required to push the entire packet onto the link, depending on packet size and bandwidth. The formula is explicitly written as 'Transmission Delay = Data Size (bits) / Bandwidth (bps)'. The instructor, visible in the bottom right, begins to explain this concept, setting the stage for the detailed calculations to follow.

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

    The focus shifts to 'Propagation Delay,' with a new slide presenting its definition: the time for one bit to travel from sender to receiver, depending on distance and signal speed. The formula 'Propagation Delay = Distance (m) / Propagation Speed (m/s)' is displayed. The instructor draws a diagram showing a signal traveling from point A to point B, labeling the distance as 4800 km. He then substitutes the values into the formula, writing 'T = D / S' and then 'T = 4800 x 10^3 / 2 x 10^8', which he calculates to be 24 milliseconds. This example demonstrates how to compute the propagation delay for a given distance and signal speed.

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

    The video returns to the topic of transmission delay with a new example. The instructor writes the formula 'Tt = Ttn = Data Size (bits) / Bandwidth (bps)'. He then provides a specific case: a data size of 14 bytes (which he converts to 14 x 8 = 112 bits) and a bandwidth of 100 Mbps (100 x 10^6 bps). He performs the calculation, writing 'Tt = 112 / 100 x 10^6', which simplifies to 1.12 x 10^-6 seconds, or 1.12 microseconds. This example illustrates how to calculate transmission delay for a small packet on a high-speed link.

The video systematically explains the two primary components of network latency. It first defines transmission delay as the time to transmit all bits of a packet, using the formula based on data size and bandwidth. It then defines propagation delay as the time for a bit to travel the physical distance, using the formula based on distance and signal speed. The lecture effectively uses two distinct, step-by-step worked examples—one for propagation delay and one for transmission delay—to demonstrate the application of the formulas and highlight the significant difference in magnitude between the two types of delay, with propagation delay being in milliseconds and transmission delay in microseconds.

Loading lesson…