Idea of Wrap-Around Time

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/computer-networks/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. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test):
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): 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
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): 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
  10. Computer Networks (Domain Test): 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
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric 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…