Slow Start Phase (Exponential Increase)

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/tl-congestion-udp/congestion-control-policy/asset-slow-start-phase-exponential-increase 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 lecture introduces TCP congestion policy, focusing on the slow start phase. It begins by listing the three main components: Slow Start (Exponential Increase), Congestion Avoidance (Additive Increase), and Congestion Detection. The core of the lesson explains how the congestion window size (cwnd) starts at 1 MSS and doubles with each round trip time, following the formula cwnd = 2^n. A client-server timing diagram is used to illustrate this exponential growth, showing segment and ACK exchanges alongside a cwnd bar. The concept of the slow start threshold (Ssthresh) is defined as half the maximum number of TCP segments the receiver window can accommodate. A graph plotting MSS against Time visually distinguishes the curved slow start phase from the linear congestion avoidance phase. The lecture concludes by returning to the overview slide, summarizing the three phases of TCP congestion control.

Chapters

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

    The lecture opens with a slide titled 'TCP Congestion Policy,' listing three key phases: Slow Start (Exponential Increase), Congestion Avoidance (Additive Increase), and Congestion Detection. The instructor then transitions to a detailed slide for the 'Slow Start Phase,' introducing a client-server diagram. On-screen text defines the initial state: 'Initially, sender sets congestion window size = Maximum Segment Size (1 MSS).' The instructor begins explaining the exponential growth, showing that after 1 round trip time, the congestion window size becomes (2)^1 = 2 MSS.

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

    The explanation of the slow start phase continues with a step-by-step breakdown of the exponential increase. The slide displays formulas for subsequent round trips: after 2 RTTs, cwnd = (2)^2 = 4 MSS; after 3 RTTs, cwnd = (2)^3 = 8 MSS. A timing diagram below the text illustrates this with segment and ACK arrows, a 'cwnd' bar at the bottom, and red handwritten annotations. The instructor introduces the slow start threshold (Ssthresh), defined on-screen as 'Maximum number of TCP segments that receiver window can accommodate / 2.' Around the 225-second mark, the slide changes to a graph with 'Time' and 'MSS' axes, showing a curved line for the 'Slow start phase' transitioning into a straight line for the 'Congestion Avoidance phase.'

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

    The lecture concludes the slow start explanation by returning to a client-server diagram. The instructor adds handwritten annotations, such as '64 MSS' and '1KB = 1MSS,' to clarify the threshold calculation. The final transition returns to the 'TCP Congestion Policy' overview slide, which lists the three phases again: 1. Slow Start (Exponential Increase), Congestion Avoidance, and Congestion Detection. This serves as a summary of the lesson's main topic, reinforcing the relationship between the exponential growth of the congestion window and the broader TCP congestion control mechanism.

The lecture provides a structured introduction to TCP's slow start phase, emphasizing its exponential nature. The teaching flow moves from a high-level overview of the three congestion policy phases to a detailed, formula-driven explanation of slow start. Key concepts include the doubling of the congestion window (cwnd) per round trip time, starting from 1 MSS. The use of a client-server timing diagram and an MSS-vs-Time graph helps visualize the transition from exponential growth to linear congestion avoidance. The definition of Ssthresh as half the receiver window size is a critical detail linking slow start to the next phase. The lesson effectively combines textual formulas, visual diagrams, and handwritten annotations to clarify the mechanics of TCP congestion control.

Loading lesson…