Slow Start Phase (Exponential Increase)

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/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. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, 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, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  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, Run Time Environment
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. 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, Hardware Basics, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
  15. Paper 2 - Full-length Mock Tests:
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…