TCP Connection Termination Three-Way Handshake

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/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. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…