Slow Start Phase (Exponential Increase)

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-networks/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. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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, 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
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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…