Congestion Control in Data Networks and Internets

Slides:



Advertisements
Similar presentations
1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
Advertisements

EE 4272Spring, 2003 Chapter 12 Congestion in Data Networks Effect of Congestion Control  Ideal Performance  Practical Performance Congestion Control.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
CONGESTION CONTROL T.Najah Al-Subaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System.
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
24.1 Chapter 24 Congestion Control and Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
T.Sharon-A.Frank 1 Multimedia Quality of Service (QoS)
William Stallings Data and Computer Communications 7th Edition
CS 408 Computer Networks Congestion Control (from Chapter 05)
1 Frame Relay u Packet switching system with low overhead u Assumes very reliable high-quality physical network u Developed for use in ISDN networks u.
Congestion in Data Networks
Chapter 10 Congestion Control in Data Networks1 Congestion Control in Data Networks and Internets COMP5416 Chapter 10.
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 13 – Congestion in Data Networks.
Semester Copyright USM EEE442 Computer Networks Congestion En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room.
NETWORK LAYER. CONGESTION CONTROL In congestion control we try to avoid traffic congestion. Traffic Descriptor Traffic descriptors are qualitative values.
Differentiated Services. Service Differentiation in the Internet Different applications have varying bandwidth, delay, and reliability requirements How.
Lecture 2 Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit.
1 K. Salah Module 5.0: Internetworking & Network Layer Basic concepts Congestion Control Routing Protocols –Flooding –Source routing –Distance vector routing.
Semester Copyright USM EEE449 Computer Networks Congestion En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room.
Computer Networks Set 9 Congestion in Data Networks.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Link Scheduling & Queuing COS 461: Computer Networks
Chapter 12 Transmission Control Protocol (TCP)
CSC 581 Communication Networks II Chapter 7c: Congestion Control Dr. Cheer-Sun Yang.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
William Stallings Data and Computer Communications Chapter 12 Congestion in Data Networks.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
1 Congestion and Congestion Control in Packet- Switched Networks.
Muhammad Mateen Yaqoob Department of Computer Science COMSATS Institute of Information Technology, Abbottabad 1.
William Stallings Data and Computer Communications
Multi Protocol Label Switching (MPLS)
Congestion Control in Data Networks and Internets
Instructor Materials Chapter 6: Quality of Service
Topics discussed in this section:
William Stallings Data and Computer Communications
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Congestion Control and
Computer Data Communications
Buffer Management in a Switch
Queue Management Jennifer Rexford COS 461: Computer Networks
Congestion Control and Resource Allocation
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Chapter 8: Internet Operation
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
CONGESTION CONTROL.
CONGESTION CONTROL, QUALITY OF SERVICE, & INTERNETWORKING
Computer Network Performance Measures
William Stallings Data and Computer Communications
Dr. John P. Abraham Professor UTPA
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Chapter 20 Network Layer: Internet Protocol
Border Gateway Protocol
Dr. John P. Abraham Professor UTRGV, EDINBURG, TX
Computer Network Performance Measures
Congestion Control (from Chapter 05)
COS 461: Computer Networks
Switching Techniques.
Dr. John P. Abraham Professor UTPA
Congestion Control (from Chapter 05)
Figure Areas in an autonomous system
Chapter 11. Frame Relay Background Frame Relay Protocol Architecture
Congestion Control (from Chapter 05)
Congestion Control Reasons:
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control and Resource Allocation
Presentation transcript:

Congestion Control in Data Networks and Internets Chapter 10 Congestion Control in Data Networks and Internets Chapter 10 Congestion Control in Data Networks and Internets

Introduction Congestion occurs when number of packets transmitted approaches network capacity Objective of congestion control: keep number of packets below level at which performance drops off dramatically Chapter 10 Congestion Control in Data Networks and Internets

Queuing Theory Data network is a network of queues If arrival rate > transmission rate then queue size grows without bound and packet delay goes to infinity Chapter 10 Congestion Control in Data Networks and Internets

Figure 10.1 Chapter 10 Congestion Control in Data Networks and Internets

At Saturation Point, 2 Strategies Discard any incoming packet if no buffer available Saturated node exercises flow control over neighbors May cause congestion to propagate throughout network Chapter 10 Congestion Control in Data Networks and Internets

Figure 10.2 Chapter 10 Congestion Control in Data Networks and Internets

Ideal Performance I.e., infinite buffers, no overhead for packet transmission or congestion control Throughput increases with offered load until full capacity Packet delay increases with offered load approaching infinity at full capacity Power = throughput / delay Higher throughput results in higher delay Chapter 10 Congestion Control in Data Networks and Internets

Figure 10.3 Chapter 10 Congestion Control in Data Networks and Internets

Practical Performance I.e., finite buffers, non-zero packet processing overhead With no congestion control, increased load eventually causes moderate congestion: throughput increases at slower rate than load Further increased load causes packet delays to increase and eventually throughput to drop to zero Chapter 10 Congestion Control in Data Networks and Internets

Figure 10.4 Chapter 10 Congestion Control in Data Networks and Internets

Congestion Control Backpressure Implicit congestion signaling Request from destination to source to reduce rate Choke packet: ICMP Source Quench Implicit congestion signaling Source detects congestion from transmission delays and discarded packets and reduces flow Chapter 10 Congestion Control in Data Networks and Internets

Explicit congestion signaling Direction Backward Forward Categories Binary Credit-based rate-based Chapter 10 Congestion Control in Data Networks and Internets

Traffic Management Fairness Quality of Service Reservations Last-in-first-discarded may not be fair Quality of Service Voice, video: delay sensitive, loss insensitive File transfer, mail: delay insensitive, loss sensitive Interactive computing: delay and loss sensitive Reservations Policing: excess traffic discarded or handled on best-effort basis Chapter 10 Congestion Control in Data Networks and Internets

Figure 10.5 Chapter 10 Congestion Control in Data Networks and Internets

Frame Relay Congestion Control Minimize frame size Maintain QoS Minimize monopolization of network Simple to implement, little overhead Minimal additional network traffic Resources distributed fairly Limit spread of congestion Operate effectively regardless of flow Have minimum impact other systems in network Minimize variance in QoS Chapter 10 Congestion Control in Data Networks and Internets

Table 10.1 Chapter 10 Congestion Control in Data Networks and Internets

Traffic Rate Management Committed Information Rate (CIR) Rate that network agrees to support Aggregate of CIRs < capacity For node and user-network interface (access) Committed Burst Size Maximum data over one interval agreed to by network Excess Burst Size Maximum data over one interval that network will attempt Chapter 10 Congestion Control in Data Networks and Internets

Figure 10.6 Chapter 10 Congestion Control in Data Networks and Internets

Figure 10.7 Chapter 10 Congestion Control in Data Networks and Internets

Congestion Avoidance with Explicit Signaling 2 strategies Congestion always occurred slowly, almost always at egress nodes forward explicit congestion avoidance Congestion grew very quickly in internal nodes and required quick action backward explicit congestion avoidance Chapter 10 Congestion Control in Data Networks and Internets

2 Bits for Explicit Signaling Forward Explicit Congestion Notification For traffic in same direction as received frame This frame has encountered congestion Backward Explicit Congestion Notification For traffic in opposite direction of received frame Frames transmitted may encounter congestion Chapter 10 Congestion Control in Data Networks and Internets