TCP Connection Termination Three-Way Handshake

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/transport-layer-services/conn-mgmt-reliability/asset-tcp-connection-termination-three-way-handshake 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.

This lecture segment explains TCP connection termination using the three-way handshake, focusing on active and passive close. The slide shows a timing diagram with client and server transport layers exchanging FIN, FIN+ACK, and ACK segments. The instructor highlights that a FIN segment consumes one sequence number if it carries no data, using red circles and arrows to emphasize the active close on the client side and passive close on the server side. The sequence numbers progress from seq:x/ack:y to seq:y/ack:x+1 and finally seq:x+1/ack:y+1, illustrating how each side acknowledges the other's FIN and closes its direction of communication.

Chapters

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

    The slide titled 'Connection Termination (Three-way handshaking)' introduces the termination process with a timing diagram showing Client and Server transport layers. The instructor circles 'Active close' on the client side in red, indicating where the client initiates termination by sending a FIN segment with seq:x/ack:y. The diagram shows the server responding with FIN+ACK (seq:y/ack:x+1), and the client acknowledging with ACK (seq:x+1/ack:y+1). Red arrows point to the seq field and FIN flag box, emphasizing that the client's close command triggers the first FIN segment.

  2. 2:00 – 3:53 02:00-03:53

    The instructor underlines the bullet point stating 'The FIN segment consumes one sequence number if it does not carry data,' highlighting this key rule. Red curved arrows are drawn above the diagram to trace the flow of segments between client and server. The 'Passive close' label on the server side is shown in blue, contrasting with the red-circled 'Active close.' Two 'Connection closed' markers appear on the timeline, indicating when each side completes its termination. The instructor uses red ellipses to circle both the 'Active close' label and the FIN flag within segments, reinforcing which side initiates and how the flags propagate through the handshake.

The core teaching point is that TCP termination requires three segments: the initiating side sends FIN, the other responds with FIN+ACK, and the initiator acknowledges. The critical rule emphasized is that a FIN consumes one sequence number only when it carries no data, which affects how seq and ack values increment. Active close refers to the side that initiates termination (client in this example), while passive close is the responding side. The diagram's progression from seq:x to seq:x+1 and ack:y to ack:y+1 demonstrates how each FIN advances the sequence number by one, ensuring both directions of communication are properly closed before the connection is fully terminated.

Loading lesson…