CONGESTION CONTROL POLICY | COMPUTER NETWORK | LECTURE 04 BY DR. SANTOSH KUMAR UPADHYAY | AKGEC

CONGESTION CONTROL POLICY | COMPUTER NETWORK | LECTURE 04 BY DR. SANTOSH KUMAR UPADHYAY | AKGEC

🎙 Dr. Santosh Kumar Upadhyay 👥 22K 📅 August 26, 2026 ⏱ 27 min 👁 1 📄 lecture 🧭 2026-08-26
Available in: English (current) Français

Keywords

congestionopen loopclosed loopbackpressurechoke packet

Summary

This lecture by Dr. Santosh Kumar Upadhyay from AKGEC introduces congestion control policies at the network layer. It defines congestion as network traffic jamming leading to packet loss. The lecture categorizes congestion control into open-loop (preventive) and closed-loop (reactive) strategies. Open-loop policies include retransmission, window, discarding, acknowledgement, and admission policies. Retransmission policy uses timers to avoid frequent retransmissions. Window policy discusses selective repeat to avoid unnecessary retransmissions. Discarding policy suggests dropping less sensitive packets (e.g., in audio/video) to reduce congestion. Acknowledgement policy includes cumulative and negative acknowledgements to reduce traffic. Admission policy checks resource availability before forwarding. Closed-loop policies include backpressure, choke packet, implicit signaling, and explicit signaling. Backpressure propagates congestion information node-to-node upstream. Choke packet sends a direct signal to the source to reduce traffic. Implicit signaling relies on source inference from missing acknowledgements. Explicit signaling embeds congestion information in data packets. The lecture concludes with a summary of these policies.

152 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture provides a clear and structured overview of congestion control policies, which is valuable for students learning computer networks. The argumentation is logical, explaining each policy’s purpose and mechanism. However, the presentation lacks depth in technical details, such as specific algorithms or mathematical models, and does not discuss real-world implementations or trade-offs. The lecturer uses examples (e.g., go-back-n, selective repeat) to illustrate concepts, but the explanation remains at a high level.

Scientific Rigor, Source Quality, Title Accuracy

The lecture is presented by an academic professional, lending credibility to the content. However, no external sources are cited, and the information is based on standard textbook knowledge. The title accurately reflects the content, which is a focused lecture on congestion control policies. The description provides links to the institution’s website and a playlist, but these are not used as sources within the lecture.

151 words

Title / Content Match

The title accurately reflects the content, which is a lecture on congestion control policies in computer networks.

Quality & Reliability

6/10

The lecture is a structured educational presentation by an academic professional, covering standard concepts in congestion control. The content is accurate but lacks depth and critical analysis, and no external sources are cited.

Key Moments

Cited Sources

Concurring Sources

Contribution & Novelties

The lecture provides a systematic categorization of congestion control policies, which is useful for educational purposes. It clarifies the distinction between open-loop and closed-loop approaches and explains each policy’s role. However, it does not introduce novel concepts or advanced techniques, and the content is standard in networking textbooks.

Pour aller plus loin :

92 words

Radar Profile

The radar profile shows moderate scores across all dimensions, indicating a balanced but not exceptional lecture. The content is informative but lacks depth and critical analysis, resulting in a moderate overall quality.

Reliability 6/10