Idea of Wrap-Around Time

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-b-networking/transport-layer-services/tcp-header-fields/asset-idea-of-wrap-around-time after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces wrap-around time in TCP networking, defining it as the duration required to exhaust all 2^32 sequence numbers. The instructor establishes that wrap-around time is inversely proportional to bandwidth, expressed as Wrap Around Time = 2^32 / x seconds, where x is the bandwidth in bytes per second. A numerical example uses B = 10 Mbps and Data = 4 GB, with unit conversions (e.g., 10 x 2^20) to compute the time. The lesson then connects wrap-around time to TCP segment lifetime (180 seconds or 3 minutes), explaining that if wrap-around time exceeds lifetime, no problem occurs; otherwise, duplicate sequence numbers reach the destination. A loop diagram visualizes the sequence number cycle, and time-stamp options are introduced as a solution to duplication. Board calculations include 2^34 = 16 TB and related conversions, reinforcing the relationship between sequence space size and bandwidth.

Chapters

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

    The slide titled 'Wrap Around Time' displays the definition: 'Time taken to use up all the 2^32 sequence numbers is called as wrap around time.' It also shows 'Wrap Around Time ∝ 1 / Bandwidth' and the formula 'Wrap Around Time = 2^32 / x sec.' The instructor begins a numerical example by writing 'B = 10 Mbps' and 'Data = 4 GB' on the board, starting unit conversion with '10 x 2^20' to express bandwidth in bytes per second.

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

    The instructor continues the worked example, converting 10 Mbps to bytes per second and setting up a fraction with 4 GB in the numerator. The board shows step-by-step calculations, including a circled result of '32K' and an additional expression '32 x 10^24 / 10 x 60' at the top right. The teaching emphasizes that wrap-around time depends on bandwidth and demonstrates practical unit conversion for computing the time to exhaust sequence numbers.

  3. 5:00 – 9:37 05:00-09:37

    The board is cleared to introduce 'Life Time of TCP Segment,' stated as 180 seconds or 3 minutes. The slide explains: 'If RTT > LT then there is no problem' and that if wrap-around time is less than lifetime, the destination receives duplicate sequence numbers. A large loop diagram represents the sequence number cycle, with 'nodes' and a smaller loop added. Calculations for '2^34 = 16 TB' appear on the right, and time-stamp options are introduced as a solution to sequence number duplication.

The lecture progresses from definition to formula, then to a numerical example, and finally to practical implications for TCP. The core concept is that wrap-around time equals 2^32 divided by bandwidth in bytes per second, making it inversely proportional to bandwidth. The worked example with 10 Mbps and 4 GB data illustrates unit conversion and calculation steps. The connection to TCP segment lifetime (180 seconds) clarifies when sequence number duplication becomes a problem: if wrap-around time is less than lifetime, duplicates occur. The loop diagram visually reinforces the cyclic nature of sequence numbers, and time-stamp options are presented as a mitigation strategy. Board calculations such as 2^34 = 16 TB extend the concept to larger sequence spaces, helping students relate bandwidth, data size, and time.

Loading lesson…