Congestion Control Ian Colloff LWG San Francisco September 25, 2006.

Slides:



Advertisements
Similar presentations
Flow Control in Fibre Channel (BB_Credits)
Advertisements

Quality of Service CCDA Quick Reference.
© R. Jayanthan, K. Gunasakera 1999 Quality of Service in Multiservice Networks for Digital Economy R. Jayanthan & Kithsiri Gunasakera National IT Conference.
Cisco S3 C5 Routing Protocols. Network Design Characteristics Reliable – provides mechanisms for error detection and correction Connectivity – incorporate.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
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.
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.
CSCI 465 D ata Communications and Networks Lecture 20 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Traffic Shaping Why traffic shaping? Isochronous shaping
24.1 Chapter 24 Congestion Control and Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 10 Congestion Control in Data Networks1 Congestion Control in Data Networks and Internets COMP5416 Chapter 10.
1 Updates on Backward Congestion Notification Davide Bergamasco Cisco Systems, Inc. IEEE 802 Plenary Meeting San Francisco, USA July.
Router Architecture : Building high-performance routers Ian Pratt
What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.
EE 122: Router Design Kevin Lai September 25, 2002.
Semester Copyright USM EEE449 Computer Networks Congestion En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room.
A Scalable, Commodity Data Center Network Architecture Mohammad Al-Fares, Alexander Loukissas, Amin Vahdat Presented by Gregory Peaker and Tyler Maclean.
A Scalable, Commodity Data Center Network Architecture
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 8: Bridging Slides used with permissions.
Paper Review Building a Robust Software-based Router Using Network Processors.
Computer Network: It is group of interconnected computers and devices which are sharing the same communication infrastructure and communication protocols.
CHABOT COLLEGE CISCO NETWORKING ACADEMY Chabot College Frame Relay Part 1.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 7 Distance Vector Routing Protocols.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 23 Congestion Control and Quality of Service.
ATM SWITCHING. SWITCHING A Switch is a network element that transfer packet from Input port to output port. A Switch is a network element that transfer.
Lecture Week 3 Frame Relay Accessing the WAN. 3.1 Basic Frame Relay Concepts Accessing the WAN.
1 Flow Identification Assume you want to guarantee some type of quality of service (minimum bandwidth, maximum end-to-end delay) to a user Before you do.
Chapter 12 Transmission Control Protocol (TCP)
What is FRAME RELAY ? Frame Relay is a way of sending information over a WAN by dividing data into packets It operates at the Physical and Data Link layers.
A.SATHEESH Department of Software Engineering Periyar Maniammai University Tamil Nadu.
Multimedia Wireless Networks: Technologies, Standards, and QoS Chapter 3. QoS Mechanisms TTM8100 Slides edited by Steinar Andresen.
Packet Drop in HP Switches Guoming. Cause: packet based hashing in F10 LAG + HP switch buffer Assumption: link utilization 50% In the hashing, several.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 3: Introduction to IP QoS.
CCNA 2 Week 9 Router Troubleshooting. Copyright © 2005 University of Bolton Topics Routing Table Overview Network Testing Troubleshooting Router Issues.
1 Congestion Control Computer Networks. 2 Where are we?
Computer Networks: Switching and Queuing Ivan Marsic Rutgers University Chapter 4 – Switching and Queuing Delay Models.
CCNA 2 Week 7 Distance Vector Routing. Copyright © 2005 University of Bolton Topics Distance Vector Protocol Issues RIP IGRP.
Institute of Technology Sligo - Dept of Computing Sem 2 Chapter 12 Routing Protocols.
4/19/20021 TCPSplitter: A Reconfigurable Hardware Based TCP Flow Monitor David V. Schuehler.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
InfiniBand Routers Ian Colloff : QLogic LWG Co-Chair.
Chapter 11 Extending LANs 1. Distance limitations of LANs 2. Connecting multiple LANs together 3. Repeaters 4. Bridges 5. Filtering frame 6. Bridged network.
Mr. Mark Welton.  WAN transportation method that formats data into frames and sent over a network controlled by a service provider  Frame Relay is often.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
Introducing a New Concept in Networking Fluid Networking S. Wood Nov Copyright 2006 Modern Systems Research.
Queuing Delay 1. Access Delay Some protocols require a sender to “gain access” to the channel –The channel is shared and some time is used trying to determine.
Data Communication 1 Frame Relay n X.25 l Provides extensive error checking and flow control l station-to-station checking at the data link layer l Error.
HP Labs 1 IEEE Infocom 2003 End-to-End Congestion Control for InfiniBand Jose Renato Santos, Yoshio Turner, John Janakiraman HP Labs.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
Real-time Transport for Assured Forwarding: An Architecture for both Unicast and Multicast Applications By Ashraf Matrawy and Ioannis Lambadaris From Carleton.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Sem 2 v2 Chapter 12: Routing. Routers can be configured to use one or more IP routing protocols. Two of these IP routing protocols are RIP and IGRP. After.
Ethernet Packet Filtering – Part 2 Øyvind Holmeide 10/28/2014 by.
Congestion Control in Data Networks and Internets
CS 3700 Networks and Distributed Systems
Topics discussed in this section:
Implementing Quality of Service (QoS)
Computer Data Communications
CS 3700 Networks and Distributed Systems
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
Bridges and Extended LANs
Congestion Control in Data Networks and Internets
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Figure Areas in an autonomous system
Chapter 11. Frame Relay Background Frame Relay Protocol Architecture
Presentation transcript:

Congestion Control Ian Colloff LWG San Francisco September 25, 2006

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 2 Congestion Control Agenda l What is congestion l Terminology l Control of Congestion l Legacy Device support l Conclusion

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 3 What is Congestion l Within the switching fabric:- – Two or more ports target a single port with a sustained flow that is greater than the link bandwidth l Buffers fill, limits credit return to neighbor device –Result: head of line blocking – A long link in the fabric l The link capacity is close to or greater than the maximum buffer credits at one or both ends l Credit “starvation” –Link is not able to run at full rate, head of line blocking –Static form, but needs to be considered in a general solution l At an Endpoint – When an endpoint can’t receive data at full link rate l Limits credit return to its connecting switch port –Result: head of line blocking

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 4 Diagram of a Congestion Situation Flows in the middle of a fabric “Source” of congestion Backup if Switch B input buffer fills Switch ASwitch B

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 5 Terminology l FECN : Forward Explicit Congestion Notification – Signal from the switch to the destination endpoint of data l BECN : Backward Explicit Congestion Notification – Signal from the destination endpoint to the source of data l Root of Congestion : – Queues or buffers fill, directed to an output port, but the data flows at link rate l Victim of Congestion : – Queues or buffers fill, directed to an output port, but the data can’t run at link rate due to lack of credits

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 6 Congestion Control Specification l Congestion control is in Annex 10 in Volume 1 version 1.2 of the InfiniBand Specification – The functionality is Optional l Does not define a Congestion Manager – Defines the base mechanisms a Congestion Manager may use to control congestion l Basic mechanisms to:- – Control injection rate in “Hardware” time frame l Little or no software intervention required – Enable comprehensive Management features to be developed using the controls – Maybe used by a QoS Manager to control rates – Performance metrics, for congestion analysis

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 7 Control of Congestion I l Limited by protocol & device complexity – Control Flows at endpoints on:- l QP or Port/SL basis (mutually exclusive) – Use FECN l Switches mark congested flows randomly at a Root of congestion (identification and marking is configurable) –Override to mark on a Victim –Prohibitive cost of issuing a BECN directly from a switch port – Endpoint receiving a FECN returns a BECN l Either in a Congestion Notification Packet or ACK(optional) – Endpoint receiving a BECN l Reduces the rate of injection for a flow into the fabric –Rate is increased over time

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 8 Control of Congestion II l At the source endpoint – Rate reduction l Table per port each has 128 or more entries –Tables are configurable –Each entry contains an inter-packet delay value for a flow –Subsequent entries in the table should reduce the flow –Can control rates between 100% and 0.006% of link rate l Receipt of a BECN increases index into the table –Index per QP or SL/Port –This increase is configurable, and each SL can be different – Rate increase l Timer (configurable on an SL/Port basis) –On expiry, an index into the table is reduced by 1. – The mechanism is flexible and highly configurable l Can be used for linear and non-linear response functions

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 9 Legacy Devices l Interaction with Legacy Devices – The Congestion Notification Packet l The packet to be silently dropped (op-code) – Switch: control credit return (optional) l Credit starvation –Average “buffer occupancy” threshold breached, Limit rate of credit return l Controlled on a VL basis –All VL’s for a port have the same threshold, and rate limit –Different ports may have different values l Affect flows that don’t contribute to congestion

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 10 Conclusion l No Congestion Control scheme is perfect – Provides a very flexible mechanism to help control congestion – Options to help control legacy endpoints l In a coarse way – Relatively easy to implement – Simulation indicates that the scheme can successfully control congestion (under the trial conditions)

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 11 Backup Slides

Copyright © 2006 InfiniBand ® Trade Association. Other names and brands are properties of their respective owners. 12 Congestion Avoidance l Over provision the fabric – More paths between endpoints l Load balancing techniques – Wider links within the fabric – Higher link speeds within the fabric – Provide a fabric that has the blocking characteristics of a single switch l More expensive than a conventional CCB Fat Tree l Load balance – Using multiple paths through the fabric between two endpoints