CONGESTION CONTROL ALGORITHM | COMPUTER NETWORK | LECTURE 05 BY DR. SANTOSH KUMAR UPADHYAY | AKGEC

CONGESTION CONTROL ALGORITHM | COMPUTER NETWORK | LECTURE 05 BY DR. SANTOSH KUMAR UPADHYAY | AKGEC

by Dr. Santosh Kumar Upadhyay

Formal & Physical Sciences Computing & Cybersecurity UComputing and Information TechnologyUTComputer networking and communications
🎙 Dr. Santosh Kumar Upadhyay 👥 22K 📅 August 26, 2026 ⏱ 23 min 👁 2 📄 lecture 🧭 2026-08-26
Available in: English (current) Français

Keywords

congestion controlleaky buckettoken buckettraffic shapingnetwork layer

Summary

This lecture, part of a computer networks course at AKGEC, introduces congestion control algorithms at the network layer. The instructor begins by defining network congestion and its effects, such as increased delay and decreased throughput, leading to retransmissions and worsening conditions. He then distinguishes between open-loop and closed-loop congestion control policies. The core of the lecture focuses on two traffic shaping algorithms: the leaky bucket and the token bucket. The leaky bucket algorithm uses a buffer (bucket) with a hole that releases packets at a constant rate, smoothing bursty traffic into a steady stream, but it can drop packets when the buffer overflows and does not utilize available bandwidth efficiently. The token bucket algorithm, in contrast, uses tokens that are added at a fixed rate; each token allows a packet to be transmitted, enabling bursts up to the token count and better utilizing network resources. The instructor explains the steps of each algorithm with analogies and diagrams, highlighting the token bucket’s flexibility in handling bursty traffic. The lecture concludes by comparing the two algorithms, noting the token bucket’s dynamic nature and ability to accommodate bursts.

185 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture provides a clear and accessible explanation of two fundamental congestion control algorithms, using analogies (water bucket) to aid understanding. The argumentation is logical, progressing from the problem of congestion to the solutions. However, the depth is limited: it does not discuss the mathematical models (e.g., leaky bucket as a queue with constant service rate), the impact on TCP (e.g., congestion avoidance algorithms like Reno, Cubic), or practical considerations such as buffer sizing and QoS. The comparison between leaky and token bucket is qualitative, lacking quantitative analysis of trade-offs.

Scientific Rigor, Source Quality, Title Accuracy

The lecture is a standard educational presentation without citations to external sources or standards (e.g., RFCs). The content aligns with common textbook material (e.g., Tanenbaum’s ‘Computer Networks’), but no specific references are given. The title accurately describes the content. The description provides links to the institution and the course playlist, but no direct references to the algorithms’ origins or further reading.

166 words

Title / Content Match

The title accurately reflects the content: a lecture on congestion control algorithms in computer networks.

Quality & Reliability

6/10

The lecture provides a clear, structured introduction to congestion control algorithms (leaky bucket and token bucket) with analogies and step-by-step explanations. However, it lacks depth in mathematical formalization, practical implementation details, and references to standards or research. The content is accurate but basic, suitable for an introductory university course.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Concurring Sources

  • Leaky bucket — General concept aligns with lecture's explanation
  • Token bucket — General concept aligns with lecture's explanation

Contribution & Novelties

The lecture offers a straightforward pedagogical introduction to congestion control algorithms, suitable for undergraduate students. It clearly contrasts leaky bucket and token bucket, emphasizing the token bucket’s ability to handle bursts. However, it does not introduce novel concepts or recent developments.

Pour aller plus loin :

97 words

Radar Profile

The radar profile shows moderate scores across all dimensions, indicating a balanced but introductory lecture. The highest score is in information quantity, reflecting the coverage of two algorithms, while technical depth and reliability are moderate, consistent with a basic educational video.

Reliability 6/10