Silly Window Syndrome & Nagle's Algo

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/computer-networks/tl-congestion-udp/timers-rtt-sws/asset-silly-window-syndrome-nagles-algo 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.

The lecture introduces Silly Window Syndrome (SWS) as a TCP performance degradation caused by poor implementation, where the sender window shrinks to a value smaller than the TCP header. The instructor identifies two primary causes: the sender transmitting data in small segments repeatedly and the receiver accepting only a few bytes at a time. A hand-drawn diagram illustrates the sender-receiver interaction, highlighting how the window size is determined by min(CW, Rcv). The lecture then transitions to Nagle's Algorithm as the primary solution. This algorithm dictates that the sender should transmit only the first byte upon receiving one-byte data from the application, while buffering all remaining bytes until the outstanding byte is acknowledged. This process effectively forces a wait of one Round Trip Time (RTT). Once the acknowledgment is received, the sender transmits the buffered data in a single TCP segment. Finally, the lecture mentions Clark's solution as an alternative approach, where the receiver should not send a window update for just 1 byte. This prevents the sender from being prompted to transmit small segments, thereby maintaining efficiency by ensuring data is sent in larger chunks relative to the Maximum Segment Size (MSS).

Chapters

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

    The lecture defines Silly Window Syndrome as a TCP performance issue where the window size shrinks to a 'silly value,' making transmitted data smaller than the TCP header. The instructor lists causes such as the sender transmitting small segments and the receiver accepting few bytes at a time. A hand-drawn diagram with 'S' and 'R' nodes is introduced to illustrate the data flow between sender and receiver.

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

    The instructor explains the mechanics of SWS, noting that the window size is limited by min(CW, Rcv). The lecture then introduces Nagle's Algorithm as the solution. Key steps include sending only the first byte, buffering the rest until an acknowledgment is received (waiting for 1 RTT), and then sending all buffered data in one segment. Red ink is used to circle 'first byte' and underline the 1 RTT wait.

  3. 5:00 – 6:06 05:00-06:06

    The lecture concludes by discussing Clark's solution as an alternative to Nagle's Algorithm. The instructor highlights that the receiver should not send a window update for 1 byte, which prevents the sender from being triggered to send small segments. The term 'MSS' is circled, and the diagram shows a 64KB buffer near the receiver to illustrate how larger data chunks are managed.

The lecture provides a clear progression from identifying the problem of Silly Window Syndrome to presenting two distinct solutions. The core issue is the inefficiency of TCP when window sizes become extremely small, leading to a high overhead-to-data ratio. Nagle's Algorithm addresses this at the sender level by buffering data to ensure segments are sent in larger, more efficient chunks after an RTT delay. Clark's solution addresses the issue at the receiver level by delaying window updates until a significant amount of space is available. Both methods aim to prevent the 'silly' behavior of sending small segments, thereby improving overall network efficiency and reducing header overhead.

Loading lesson…