Basics of Windows in TCP

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-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. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: 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, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. 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, Network Security
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…