Slow Start Phase (Exponential Increase)

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/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. About Course: About the Course
  2. 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
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length 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…