TCP Connection Termination Three-Way Handshake

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/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. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…