1 / 18

### Understanding Congestion in Data Networks: Causes, Control Mechanisms, and Effects ###

Congestion in data networks occurs when the number of packets approaches the network's handling capacity. This can lead to decreased performance and packet loss. Effective congestion control aims to maintain packet transmission below critical levels, typically around 80% utilization. Various strategies exist, including open-loop and closed-loop controls, backpressure mechanisms, and explicit signaling methods. Understanding these concepts is crucial for designing efficient networks that manage traffic effectively while minimizing congestion issues. ###

fineen
Télécharger la présentation

### Understanding Congestion in Data Networks: Causes, Control Mechanisms, and Effects ###

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computer Networks Set 9 Congestion in Data Networks

  2. What Is Congestion? • Congestion occurs when the number of packets being transmitted through the network approaches the packet handling capacity of the network • Congestion control aims to keep number of packets below level at which performance falls off dramatically • Data network is a network of queues • Generally 80% utilization is critical • Finite queues mean data may be lost

  3. Queues at a Node

  4. Effects of Congestion • Packets arriving are stored at input buffers • Routing decision made • Packet moves to output buffer • Packets queued for output transmitted as fast as possible • Statistical time division multiplexing • If packets arrive to fast to be routed, or to be output, buffers will fill • Can discard packets • Can use flow control • Can propagate congestion through network

  5. Interaction of Queues

  6. Ideal Performance

  7. Practical Performance • Ideal assumes infinite buffers and no overhead • Buffers are finite • Overheads occur in exchanging congestion control messages

  8. Effects of Congestion -No Control

  9. Congestion control • Many policies affect congestion control: acks, retransmits, routing algorithms, Virtual circuits... • Two major families fo congestion control: Open-loop, closed-loop. • Open-loop: Prevent conditions that lead to congestion, e.g. Leacky bucket, token bucket: Traffic shaping. • Closed-loop: Deal with congestion when it happens: Use current information about network to deal with congestion.

  10. Mechanisms for Congestion Control

  11. Backpressure • If node becomes congested it can slow down or halt flow of packets from other nodes • May mean that other nodes have to apply control on incoming packet rates • Propagates back to source • Can restrict to logical connections generating most traffic • Used in connection oriented that allow hop by hop congestion control (e.g. X.25) • Not used in ATM nor frame relay • Only recently developed for IP

  12. Choke Packet • Warning is either generated by monitoring outgoing line utilization or queue lengths (weighted). • Control packet • Generated at congested node • Sent to source node • e.g. ICMP source quench • From router or destination • Source cuts back until no more source quench message • Sent for every discarded packet, or anticipated • Rather crude mechanism

  13. Implicit Congestion Signaling • Transmission delay may increase with congestion • Packet may be discarded • Source can detect these as implicit indications of congestion • Useful on connectionless (datagram) networks • e.g. IP based • (TCP includes congestion and flow control - see chapter 17) • Used in frame relay LAPF

  14. Explicit Congestion Signaling • Network alerts end systems of increasing congestion • End systems take steps to reduce offered load • Backwards • Congestion avoidance in opposite direction to packet required • Forwards • Congestion avoidance in same direction as packet required

  15. Categories of Explicit Signaling • Binary • A bit set in a packet indicates congestion • Credit based • Indicates how many packets source may send • Common for end to end flow control • Rate based • Supply explicit data rate limit • e.g. ATM

  16. Traffic Management • Fairness • Quality of service • May want different treatment for different connections • Reservations • e.g. ATM • Traffic contract between user and network

  17. Congestion Control in Packet Switched Networks • Send control packet to some or all source nodes • Requires additional traffic during congestion • Rely on routing information • May react too quickly • End to end probe packets • Adds to overhead • Add congestion info to packets as they cross nodes • Either backwards or forwards

  18. Required Reading • Stallings chapter 12

More Related