Basics of Windows in TCP

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/tl-congestion-udp/congestion-control-policy/asset-basics-of-windows-in-tcp after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. 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, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces TCP windowing, emphasizing that each direction of data transfer uses a send and receive window, resulting in four windows for bidirectional communication. The instructor explains that the sender's window size is governed by two factors: receiver window size and congestion window size. A hand-drawn diagram illustrates sender S and receiver R with directional arrows, annotated with example buffer sizes such as 3–4 KB and 16 KB. The final segment reinforces the congestion window concept, with red markings crossing out receiver boxes to highlight sender-side constraints.

Chapters

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

    The slide titled 'Windows in TCP' states that TCP uses two windows (send and receive) per direction, i.e., four for bidirectional communication. Under 'Send Window,' the sender window size is determined by receiver window size and congestion window size. Red handwritten letters C, S, and a circled D appear, followed by green S and R annotations.

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

    The instructor, visible in a black polo shirt, elaborates on the slide content. A hand-drawn diagram shows C above S with a green arrow to R, and below a circled 2 row with R and a blue arrow from S. The presenter writes '3-4KB' and '16 KB' under the boxes, adding a curved arrow labeled rR pointing to the top send box.

  3. 5:00 – 5:40 05:00-05:40

    The slide reiterates that TCP uses send and receive windows per direction. The 'Send Window' section underlines 'Congestion window size.' A hand-drawn diagram shows sender S (3–4 KB box) and receiver R boxes, with a green arrow top and blue arrow bottom; the R boxes are crossed out in red.

The lecture systematically builds understanding of TCP windowing by first defining the four-window structure for bidirectional communication. It then focuses on the send window, identifying receiver and congestion windows as determining factors. Visual annotations, including directional arrows and buffer size examples (3–4 KB, 16 KB), clarify the interaction between sender and receiver. The final red markings on receiver boxes emphasize that congestion window constraints primarily affect the sender's transmission capacity.

Loading lesson…