Transmission Vs Propogation delay

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/computer-networks/data-communication/signals-metrics/asset-transmission-vs-propogation-delay after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…