Congestion Management in Lossless Interconnects: Challenges and Benefits
|
|
- William Warren
- 6 years ago
- Views:
Transcription
1 Congestion Management in Lossless Interconnects: Challenges and Benefits José Duato Technical University of Valencia (SPAIN) Conference title 1
2 Outline Why is congestion management required? Benefits Congestion and congestion management strategies Challenges Enhancing reactive congestion management Congestion management & adaptive routing HOL blocking elimination techniques Hybrid congestion management strategy HPC Advisory Council Workshop. March 21-23, Congestion Management 2
3 Current role of interconnection networks For three decades the goal of computer architects has been to keep the processors busy top performance Interconnects were usually cheap, and never a bottleneck Now, global system performance in large systems is limited by the interconnection network (e.g. Tianhe-1A) Network latency directly impacts application performance, and network saturation leads to latency increasing by orders of magnitude Saturation should be avoided at all costs HPC Advisory Council Workshop. March 21-23, Congestion Management 3
4 Conflicting interests: cost vs. performance Saturation was traditionally avoided by overdimensioning the interconnection network, but this is becoming very expensive No overdimensioning Danger when working with high traffic loads (close to the saturation point) Network performance (throughput, latency) should be good under very different traffic patterns & load scenarios Traffic load may significantly vary over time, reaching saturation At saturation, network performance drops dramatically HPC Advisory Council Workshop. March 21-23, Congestion Management 4
5 Network throughput at saturation HS = traffic injected to Hot Spot destination HS starts HS ends HPC Advisory Council Workshop. March 21-23, Congestion Management 5
6 Should we currently care about congestion? Growing processor speed Growing link speed Power consumption increases Processor prices drop (demand) Relative interconnect cost increases Power management Smaller networks Congestion probability grows Congestion Performance Management degradation Strategies Saturation point reached with lower traffic load Bandwidth decreases HPC Advisory Council Workshop. March 21-23, Congestion Management 6
7 Benefits Stable performance when the network reaches saturation No performance drop Delivers maximum achievable throughput Reacts quickly when power management turned some components off and demand suddenly increases Prevents performance degradation due to power management Enables more aggressive power saving strategies without risk Helps to keep performance when faults occur and fault tolerance techniques enable alternative paths Alternative paths may become congested (less resources are available) HPC Advisory Council Workshop. March 21-23, Congestion Management 7
8 Contention Several packets from different flows request the same output port in a switch One packet makes progress, the others wait Network contention HPC Advisory Council Workshop. March 21-23, Congestion Management 8
9 Congestion Persistent contention Buffers containing packets belonging to flows involved in contention become full Persistent network contention HPC Advisory Council Workshop. March 21-23, Congestion Management 9
10 Congestion propagation In lossless networks, congestion is quickly propagated by flow control, forming congestion trees Flow control Persistent network contention HPC Advisory Council Workshop. March 21-23, Congestion Management 10
11 Congestion propagation In lossless networks, congestion is quickly propagated by flow control, forming congestion trees Congestion trees may cause Head-of-Line blocking Congestion propagation may reach the sources Persistent network contention Congestion affects packets belonging to flows that do not cause congestion HPC Advisory Council Workshop. March 21-23, Congestion Management 11
12 Congestion trees Congestion tree structure: Congestion tree leaf Congestion tree branch Congestion tree root Congestion tree leaf Congestion tree branch HPC Advisory Council Workshop. March 21-23, Congestion Management 12
13 Traditional solution Overdimensioning the network Many more components than really necessary Offered network bandwidth is much higher than the bandwidth requested by end nodes Overdimensioned network HPC Advisory Council Workshop. March 21-23, Congestion Management 13
14 Latency Traditional solution Overdimensioning the network Advantage: low link utilization low latency Latency Working zone Congestion zone Injected traffic Traffic HPC Advisory Council Workshop. March 21-23, Congestion Management 14
15 Classical congestion management strategies Proactive congestion management (congestion prevention) Path setup before data transmission Used in ATM, computer networks (QoS) High overhead, high setup latencies, poor link utilization (not suitable for HPC) HPC Advisory Council Workshop. March 21-23, Congestion Management 15
16 Classical congestion management techniques Reactive congestion management (congestion recovery) Injection limitation techniques using closed-loop feedback Does not scale well with network size and link bandwidth Notification delay (proportional to distance / number of hops) Link and buffer capacity (proportional to clock frequency) May produce traffic oscillations (closed loop system with pure delay) HPC Advisory Council Workshop. March 21-23, Congestion Management 16
17 Other approaches Adaptive Routing May help to delay the occurrence of congestion Useless when heavy congestion arises Problems regarding in-order packet delivery Packet dropping Not suitable for most current HPC parallel applications HPC Advisory Council Workshop. March 21-23, Congestion Management 17
18 Challenges To develop congestion management techniques that react locally and immediately when congestion arises To make congestion management techniques truly scalable To achieve coordination among end nodes without explicit communication among them To eliminate instabilities and oscillatory responses To minimize the number of extra resources needed to handle congestion To make congestion management compatible with adaptive routing HPC Advisory Council Workshop. March 21-23, Congestion Management 18
19 Enhancing reactive congestion management Stop injecting packets for a while when a BECN is received Do not change injection rate again until feedback from previous changes is received to prevent oscillations Source nodes can dynamically adjust their injection rate to available bandwidth without communicating among them Inject exactly one packet when a BECN is received New contenders are automatically detected and injection rate reduced Slightly reduce the above rate to slowly eliminate the congestion tree HPC Advisory Council Workshop. March 21-23, Congestion Management 19
20 Congestion management & adaptive routing Existing congestion management techniques do not work correctly with adaptive routing Injection rate is adjusted for a certain congestion, but now packets may follow a different path (unstable behavior) Adaptive routing may spread congestion over more links Never use adaptive routing for congested packets when the congestion point is at an end node In this case, adaptive routing does not help, spreads congestion over more links, and increases HOL blocking Use adaptive routing otherwise(more research needed here) HPC Advisory Council Workshop. March 21-23, Congestion Management 20
21 HOL blocking elimination techniques Key idea: The real problem is not the congestion itself, but its negative effect (HOL blocking) By eliminating HOL blocking, congestion becomes harmless In general, different buffers required at each port for separating packet flows HPC Advisory Council Workshop. March 21-23, Congestion Management 21
22 HOL blocking example 33 % Sw % Sw. 5 Congested flows Non-congested flows 33 % Sw % Sw % 33 % Sw % Dst % Sw % Sw % 33 % Dst % Sw % 33 % Sending 33 % Stopped 33 % Sending HPC Advisory Council Workshop. March 21-23, Congestion Management 22
23 Real-life HOL blocking example The A-31 highway metaphor Bottleneck A-31 A-43 The flow is affected by the bottleneck of the A-31 highway Map Source: Google Maps HPC Advisory Council Workshop. March 21-23, Congestion Management 23
24 HOL blocking elimination techniques VOQnet (Virtual Output Queuing at network level) A separate queue at each input port for every destination Packets with the same destination are stored in the same queue Completely eliminates HOL blocking Number of required buffer resources increases at least quadratically with network size!!! HPC Advisory Council Workshop. March 21-23, Congestion Management 24
25 HOL blocking elimination techniques VOQsw (Virtual Output Queuing at switch level) & DAMQs (Dynamically Allocated Multi-Queues) A separate queue at every input port for every output port Packets requesting the same output are stored in the same queue Better than nothing but does not eliminate HOL blocking completely. Effectiveness depends on traffic pattern. Virtual Channels Performance depends on channel (queue) assignment HPC Advisory Council Workshop. March 21-23, Congestion Management 25
26 HOL blocking elimination techniques DBBM (Destination-Based Buffer Management) Several groups of destinations are defined A separate queue for each group at every port Packets with destinations in the same group are stored at the same queue OBQA (Output-Based Queue Assignment) Suitable for fat-trees with DESTRO routing Queue assignment linked with topology & routing algorithm Reduces HOL blocking with the minimum number of queues per port HPC Advisory Council Workshop. March 21-23, Congestion Management 26
27 OBQA description Logical input port organization Each input port has a number of queues (q) smaller than switch radix OBQA assigns packets to queues using this formula: Selected_Queue = Requested_Output_Port MOD q HPC Advisory Council Workshop. March 21-23, Congestion Management 27
28 OBQA evaluation Uniform traffic simulation results Network Latency (cycles) vs Normalized Generated Traffic 4-ary 4-tree 8x8 switches (configuration #2) 16-ary 2-tree 32x32 switches (configuration #3) HPC Advisory Council Workshop. March 21-23, Congestion Management 28
29 HOL blocking elimination techniques RECN (Regional Explicit Congestion Notification) & FBICM (Flow-Based Implicit Congestion Management) Key differences with respect to previous techniques: Explicitly identifies congested points Congestion information storage Dynamic queue allocation for congested flows HPC Advisory Council Workshop. March 21-23, Congestion Management 29
30 Principles of RECN-like solutions Congestion becomes harmless if the HOL blocking produced by congested packets is completely eliminated. HOL blocking produced by congested packets is completely eliminated if they are buffered separately. Non-congested packets can share queues without suffering significant HOL blocking. Congested packets can be separately buffered by using a small number of queues per port. Congested packets must be explicitly identified (i.e. packets belonging to flows contributing to create some congestion). Precise identification of congested packets is based on previous knowledge of the location of existing congestion points. HPC Advisory Council Workshop. March 21-23, Congestion Management 30
31 RECN basic procedure Congested points are detected at any input or output switch port of the network The routes to detected congested points are progressively notified to input and output ports crossed by congested flows After receiving a notification, a port dynamically allocates a CAM line to store the location of the congested point, and a set-aside queue (SAQ) to store congested packets A packet arriving at a port will be stored in a SAQ if it will pass through the congested point associated to that SAQ A packet arriving at a port will be stored in the standard ( cold ) queue if its route does not match any CAM entry SAQs can be dynamically deallocated, and later allocated for other congested points HPC Advisory Council Workshop. March 21-23, Congestion Management 31
32 How RECN works A congestion point forms HPC Advisory Council Workshop. March 21-23, Congestion Management 32
33 How RECN works Cold queue fills over a threshold HPC Advisory Council Workshop. March 21-23, Congestion Management 33
34 How RECN works Internal notification to each input sending packets to the congested output HPC Advisory Council Workshop. March 21-23, Congestion Management 34
35 How RECN works New SAQs are allocated for packets addressed to the congested output port HPC Advisory Council Workshop. March 21-23, Congestion Management 35
36 How RECN works Notifications sent when the SAQs fill over a threshold HPC Advisory Council Workshop. March 21-23, Congestion Management 36
37 How RECN works A new SAQ is allocated for the congested output at each notified output HPC Advisory Council Workshop. March 21-23, Congestion Management 37
38 How RECN works Internal notifications when the SAQs receive packets and the occupancy is over a threshold HPC Advisory Council Workshop. March 21-23, Congestion Management 38
39 How RECN works HPC Advisory Council Workshop. March 21-23, Congestion Management 39
40 How RECN works HPC Advisory Council Workshop. March 21-23, Congestion Management 40
41 How RECN works At the end, congestion tree packets are completely stored in SAQs HPC Advisory Council Workshop. March 21-23, Congestion Management 41
42 How RECN works Cold flow sharing some network resources with a branch of the congestion tree HPC Advisory Council Workshop. March 21-23, Congestion Management 42
43 How RECN works Cold packets are never stored in SAQs, so they never share a queue with congested packets HPC Advisory Council Workshop. March 21-23, Congestion Management 43
44 RECN basics RECN achieves efficiency and scalability in source routing environments Turnpool Turnpointer Packet header information: The routing information is included in packet header and congestion notifications (turnpool), and it is used at each hop (turnpointer) HPC Advisory Council Workshop. March 21-23, Congestion Management 44
45 CAM structure Xon/Xoff Flow control CAM v turnpool bit mask b Xoff v turnpool bit mask b Xoff v turnpool bit mask b Xoff SAQ 0 SAQ 1 SAQ n-1 Valid Congested point Blocked HPC Advisory Council Workshop. March 21-23, Congestion Management 45
46 Reception of packets after SAQ allocation Turn pointer 4 2 Header of incoming packet Cold Queue +4 SAQ 0 SAQ 1 SAQ n ? 0 CAM line SAQ 0 CAM line SAQ 1 The incoming packet is stored in SAQ0 CAM line SAQ n-1 HPC Advisory Council Workshop. March 21-23, Congestion Management 46
47 FBICM operation Key features Effective HOL blocking elimination in networks with distributed routing Implicit congestion points identification, detecting flows heading to them just by inspecting packet destination Congestion information is based on destinations instead of turnpools and it represents any network congested point New CAM structure, new detection, propagation and resource management policies HPC Advisory Council Workshop. March 21-23, Congestion Management 47
48 FBICM operation IQ Switch architecture Normal Flow Queues (NFQ) Congested Flow Queues (CFQ) Separate non-congested flows from congested flows HPC Advisory Council Workshop. March 21-23, Congestion Management 48
49 FBICM operation CAM structure Congested flow identification fields Congested port, Hops to reach, Destination list, Next CFQ (Congested Flow Queue) Flow Control fields Stop & Go, Sent Stop, Receiving control HPC Advisory Council Workshop. March 21-23, Congestion Management 49
50 FBICM operation Congestion detection Primary CFQ + Threshold NFQ exceeded Switch 1 CAM allocation Switch 2 P4 P4 P5 NFQ CFQ CAM P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 50
51 FBICM operation Packet Processing Congested Packets are stored in the CFQ Switch 1 Switch 2 P4 P4 P5 NFQ CFQ CAM P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 51
52 FBICM operation Packet Processing Congested Packets are stored in the CFQ Switch 1 Switch 2 P4 P4 P5 NFQ CFQ CAM P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 52
53 FBICM operation Packet Processing Congested Packets are stored in the CFQ Switch 1 Switch 2 P4 P4 P5 NFQ CFQ CAM P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 53
54 FBICM operation Packet Processing Congested Packets are stored in the CFQ Switch 1 Switch 2 P4 P4 P5 NFQ CFQ CAM P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 54
55 FBICM operation Packet Processing Switch 1 Switch 2 HOL blocking is avoided P4 P4 P5 NFQ CFQ CAM P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 55
56 FBICM operation Packet Processing Switch 1 Switch 2 HOL blocking is avoided P4 P4 P5 NFQ CFQ CAM P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 56
57 FBICM operation Packet Processing Switch 1 Switch 2 HOL blocking is avoided P4 P4 P5 NFQ CFQ CAM P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 57
58 FBICM operation Congestion Information Propagation Switch 1 Switch 2 P4 P4 P5 NFQ CFQ CAM 0 P5 P6 P6 P7 P7 New CAM Line Information: Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null HPC Advisory Council Workshop. March 21-23, Congestion Management 58
59 FBICM operation Congestion Information Propagation The threshold is exceeded in the CFQ Switch 1 Switch 2 P4 P4 CAM 1 P5 P6 NFQ CFQ external Stop CAM 0 P5 P6 P7 P7 New CAM Line Information: New CAM allocation (copy of CAM 0) CAM 0 CAM 1 Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: 0 Stop: true HPC Advisory Council Workshop. March 21-23, Congestion Management 59
60 FBICM operation Congestion Information Propagation Switch 1 port and matches with congestion Switch 2 Internal Stop P4 Congested packet reaches output information in CAM 1 P4 P5 NFQ CFQ P5 CAM 1 CAM 0 P6 P6 P7 P7 New CAM Line Information: CAM 0 Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null CAM 1 Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: 0 Stop: true HPC Advisory Council Workshop. March 21-23, Congestion Management 60
61 FBICM operation Congestion Information Propagation Switch 1 updating congested point Switch 2 Internal Stop NFQ P4 CFQ New CAM + CFQ allocated information P4 CAM 2 P5 NFQ CFQ P5 CAM 1 CAM 0 P6 P6 P7 P7 New CAM Line Information: CAM 0 Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null CAM 1 Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: 0 Stop: true CAM 2 Active Cong_Port: P6 Hops: 2 Destination_list NextCFQ: 1 Stop: true HPC Advisory Council Workshop. March 21-23, Congestion Management 61
62 FBICM operation Congestion Information Propagation Switch 1 Congestion tree branch Switch 2 NFQ CFQ CAM 2 P4 P4 CAM 1 P5 P6 NFQ CFQ CAM 0 P5 P6 P7 P7 Congestion tree resources will be released dynamically New CAM Line Information: CAM 0 Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: null CAM 1 Active Cong_Port: P6 Hops: 1 Destination_list NextCFQ: 0 Stop: true CAM 2 Active Cong_Port: P6 Hops: 2 Destination_list NextCFQ: 1 Stop: true HPC Advisory Council Workshop. March 21-23, Congestion Management 62
63 FBICM evaluation Network Throughput vs. Load (Config. 1) Random Uniform Traffic BMIN 64 x 64 Congested Traffic BMIN 64 x 64 HPC Advisory Council Workshop. March 21-23, Congestion Management 63
64 FBICM evaluation Network Throughput vs. Time (Config. 1) Real Traffic (CF = 20) BMIN 64 x 64 Real Traffic (CF = 40) BMIN 64 x 64 HPC Advisory Council Workshop. March 21-23, Congestion Management 64
65 Hybrid congestion management strategy Key ideas Use FBICM to quickly and locally eliminate HOL blocking, propagating congestion information and allocating buffers as necessary Use reactive congestion management to slowly eliminate congestion, deallocating FBICM buffers whenever possible Use of FBICM provides immediate response and allows reactive congestion management to be tuned for slow reaction, thus avoiding oscillations Reactive congestion management drastically reduces FBICM buffer requirements (just one buffer per port) HPC Advisory Council Workshop. March 21-23, Congestion Management 65
66 Conclusions Interconnects performance : Key when power management enabled Goal: To achieve best possible behavior with limited number of resources Congestion (HOL blocking): Serious menace DBBM and OBQA reduce HOL blocking in specific scenarios techniques ) with a small set of resources (ad-hoc Reactive congestion management: Does not scale well. Can be improved RECN: efficiently eliminates HOL blocking in Source Routing Networks FBICM: efficiently eliminates HOL blocking in Distributed Deterministic Routing Networks Hybrid congestion management: Mechanisms help each other HPC Advisory Council Workshop. March 21-23, Congestion Management 66
67 Acknowledgements Pedro García (University of Castilla La Mancha) developed the research on RECN and FBICM under my guidance and prepared part of the slides in this presentation The techniques to enhance reactive congestion management are being developed in collaboration with Simula Research Laboratory (Oslo) HPC Advisory Council Workshop. March 21-23, Congestion Management 67
68 Thanks!! Any question? Conference title 68
Congestion Management in HPC
Congestion Management in HPC Interconnection Networks Pedro J. García Universidad de Castilla-La Mancha (SPAIN) Conference title 1 Outline Why may congestion become a problem? Should we care about congestion
More information36 IEEE POTENTIALS /07/$ IEEE
INTERCONNECTION NETWORKS ARE A KEY ELEMENT IN a wide variety of systems: massive parallel processors, local and system area networks, clusters of PCs and workstations, and Internet Protocol routers. They
More informationAn Effective Queuing Scheme to Provide Slim Fly topologies with HoL Blocking Reduction and Deadlock Freedom for Minimal-Path Routing
An Effective Queuing Scheme to Provide Slim Fly topologies with HoL Blocking Reduction and Deadlock Freedom for Minimal-Path Routing Pedro Yébenes 1, Jesús Escudero-Sahuquillo 1, Pedro J. García 1, Francisco
More informationCongestion Management for Ethernet-based Lossless DataCenter Networks
Congestion Management for Ethernet-based Lossless DataCenter Networks Pedro Javier Garcia 1, Jesus Escudero-Sahuquillo 1, Francisco J. Quiles 1 and Jose Duato 2 1: University of Castilla-La Mancha (UCLM)
More informationUNIVERSITY OF CASTILLA-LA MANCHA. Computing Systems Department
UNIVERSITY OF CASTILLA-LA MANCHA Computing Systems Department A case study on implementing virtual 5D torus networks using network components of lower dimensionality HiPINEB 2017 Francisco José Andújar
More informationCongestion in InfiniBand Networks
Congestion in InfiniBand Networks Philip Williams Stanford University EE382C Abstract The InfiniBand Architecture (IBA) is a relatively new industry-standard networking technology suited for inter-processor
More informationRequirement Discussion of Flow-Based Flow Control(FFC)
Requirement Discussion of Flow-Based Flow Control(FFC) Nongda Hu Yolanda Yu hunongda@huawei.com yolanda.yu@huawei.com IEEE 802.1 DCB, Stuttgart, May 2017 www.huawei.com new-dcb-yolanda-ffc-proposal-0517-v01
More informationSCALABLE STRATEGIES FOR ALLEVIATING THE HOL BLOCKING PRODUCED BY CONGESTION TREES IN LOSSLESS INTERCONNECTION NETWORKS
SCALABLE STRATEGIES FOR ALLEVIATING THE HOL BLOCKING PRODUCED BY CONGESTION TREES IN LOSSLESS INTERCONNECTION NETWORKS P. Nicolas Kokkalis, Njuguna Njoroge, Ernesto Staroswiecki EE382C Interconnection
More informationFast-Response Multipath Routing Policy for High-Speed Interconnection Networks
HPI-DC 09 Fast-Response Multipath Routing Policy for High-Speed Interconnection Networks Diego Lugones, Daniel Franco, and Emilio Luque Leonardo Fialho Cluster 09 August 31 New Orleans, USA Outline Scope
More informationQuality of Service. Traffic Descriptor Traffic Profiles. Figure 24.1 Traffic descriptors. Figure Three traffic profiles
24-1 DATA TRAFFIC Chapter 24 Congestion Control and Quality of Service The main focus of control and quality of service is data traffic. In control we try to avoid traffic. In quality of service, we try
More informationInfiniBand Congestion Control
InfiniBand Congestion Control Modelling and validation ABSTRACT Ernst Gunnar Gran Simula Research Laboratory Martin Linges vei 17 1325 Lysaker, Norway ernstgr@simula.no In a lossless interconnection network
More informationWhat Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control
Chapter 12 Congestion in Data Networks Effect of Congestion Control Ideal Performance Practical Performance Congestion Control Mechanisms Backpressure Choke Packet Implicit Congestion Signaling Explicit
More informationBasic Low Level Concepts
Course Outline Basic Low Level Concepts Case Studies Operation through multiple switches: Topologies & Routing v Direct, indirect, regular, irregular Formal models and analysis for deadlock and livelock
More informationWhat Is Congestion? Computer Networks. Ideal Network Utilization. Interaction of Queues
168 430 Computer Networks Chapter 13 Congestion in Data Networks What Is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet handling capacity
More informationRouting Algorithms. Review
Routing Algorithms Today s topics: Deterministic, Oblivious Adaptive, & Adaptive models Problems: efficiency livelock deadlock 1 CS6810 Review Network properties are a combination topology topology dependent
More informationToward a Reliable Data Transport Architecture for Optical Burst-Switched Networks
Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University
More informationLecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren
Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren Lecture 21 Overview" How fast should a sending host transmit data? Not to fast, not to slow, just right Should not be faster than
More informationCongestion in Data Networks. Congestion in Data Networks
Congestion in Data Networks CS420/520 Axel Krings 1 Congestion in Data Networks What is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationResource allocation in networks. Resource Allocation in Networks. Resource allocation
Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers
More informationApplication of SDN: Load Balancing & Traffic Engineering
Application of SDN: Load Balancing & Traffic Engineering Outline 1 OpenFlow-Based Server Load Balancing Gone Wild Introduction OpenFlow Solution Partitioning the Client Traffic Transitioning With Connection
More informationIntroduction. Router Architectures. Introduction. Introduction. Recent advances in routing architecture including
Introduction Router Architectures Recent advances in routing architecture including specialized hardware switching fabrics efficient and faster lookup algorithms have created routers that are capable of
More informationAddress InterLeaving for Low- Cost NoCs
Address InterLeaving for Low- Cost NoCs Miltos D. Grammatikakis, Kyprianos Papadimitriou, Polydoros Petrakis, Marcello Coppola, and Michael Soulie Technological Educational Institute of Crete, GR STMicroelectronics,
More informationChapter II. Protocols for High Speed Networks. 2.1 Need for alternative Protocols
Chapter II Protocols for High Speed Networks 2.1 Need for alternative Protocols As the conventional TCP suffers from poor performance on high bandwidth delay product links [47] meant for supporting transmission
More informationRouting Algorithm. How do I know where a packet should go? Topology does NOT determine routing (e.g., many paths through torus)
Routing Algorithm How do I know where a packet should go? Topology does NOT determine routing (e.g., many paths through torus) Many routing algorithms exist 1) Arithmetic 2) Source-based 3) Table lookup
More informationCongestion Control in Communication Networks
Congestion Control in Communication Networks Introduction Congestion occurs when number of packets transmitted approaches network capacity Objective of congestion control: keep number of packets below
More informationIntroduction. Introduction. Router Architectures. Introduction. Recent advances in routing architecture including
Router Architectures By the end of this lecture, you should be able to. Explain the different generations of router architectures Describe the route lookup process Explain the operation of PATRICIA algorithm
More informationComputer Networking. Queue Management and Quality of Service (QOS)
Computer Networking Queue Management and Quality of Service (QOS) Outline Previously:TCP flow control Congestion sources and collapse Congestion control basics - Routers 2 Internet Pipes? How should you
More informationFairness Example: high priority for nearby stations Optimality Efficiency overhead
Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency
More informationADVANCED COMPUTER NETWORKS
ADVANCED COMPUTER NETWORKS Congestion Control and Avoidance 1 Lecture-6 Instructor : Mazhar Hussain CONGESTION CONTROL When one part of the subnet (e.g. one or more routers in an area) becomes overloaded,
More information15-744: Computer Networking TCP
15-744: Computer Networking TCP Congestion Control Congestion Control Assigned Reading [Jacobson and Karels] Congestion Avoidance and Control [TFRC] Equation-Based Congestion Control for Unicast Applications
More informationCongestion Control. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Congestion Control Daniel Zappala CS 460 Computer Networking Brigham Young University 2/25 Congestion Control how do you send as fast as possible, without overwhelming the network? challenges the fastest
More informationComputer Networking
15-441 Computer Networking Lecture 17 TCP Performance & Future Eric Anderson Fall 2013 www.cs.cmu.edu/~prs/15-441-f13 Outline TCP modeling TCP details 2 TCP Performance Can TCP saturate a link? Congestion
More informationSOFTWARE BASED FAULT-TOLERANT OBLIVIOUS ROUTING IN PIPELINED NETWORKS*
SOFTWARE BASED FAULT-TOLERANT OBLIVIOUS ROUTING IN PIPELINED NETWORKS* Young-Joo Suh, Binh Vien Dao, Jose Duato, and Sudhakar Yalamanchili Computer Systems Research Laboratory Facultad de Informatica School
More informationOverview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services
Overview 15-441 15-441 Computer Networking 15-641 Lecture 19 Queue Management and Quality of Service Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 What is QoS? Queuing discipline and scheduling
More information"Filling up an old bath with holes in it, indeed. Who would be such a fool?" "A sum it is, girl," my father said. "A sum. A problem for the mind.
We were doing very well, up to the kind of sum when a bath is filling at the rate of so many gallons and two holes are letting the water out, and please to say how long it will take to fill the bath, when
More informationBandwidth Allocation & TCP
Bandwidth Allocation & TCP The Transport Layer Focus Application Presentation How do we share bandwidth? Session Topics Transport Network Congestion control & fairness Data Link TCP Additive Increase/Multiplicative
More informationStateless Resource Sharing AND ATS
Stateless Resource Sharing AND ATS Putting together the Best of breads IEEE P802.1Qcr, 2016-09-14, York, UK Szilveszter Nádas, Balázs Varga (A), János Farkas Introduction SRS Overview and Presentation
More informationEnd-to-End Adaptive Packet Aggregation for High-Throughput I/O Bus Network Using Ethernet
Hot Interconnects 2014 End-to-End Adaptive Packet Aggregation for High-Throughput I/O Bus Network Using Ethernet Green Platform Research Laboratories, NEC, Japan J. Suzuki, Y. Hayashi, M. Kan, S. Miyakawa,
More informationOverview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers
Overview 15-441 Computer Networking TCP & router queuing Lecture 10 TCP & Routers TCP details Workloads Lecture 10: 09-30-2002 2 TCP Performance TCP Performance Can TCP saturate a link? Congestion control
More informationCongestion. Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets limited resources
Congestion Source 1 Source 2 10-Mbps Ethernet 100-Mbps FDDI Router 1.5-Mbps T1 link Destination Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets
More informationTCP and BBR. Geoff Huston APNIC
TCP and BBR Geoff Huston APNIC Computer Networking is all about moving data The way in which data movement is controlled is a key characteristic of the network architecture The Internet protocol passed
More informationETSF05/ETSF10 Internet Protocols. Performance & QoS Congestion Control
ETSF05/ETSF10 Internet Protocols Performance & QoS Congestion Control Quality of Service (QoS) Maintaining a functioning network Meeting applications demands User s demands = QoE (Quality of Experience)
More informationOptical Packet Switching
Optical Packet Switching DEISNet Gruppo Reti di Telecomunicazioni http://deisnet.deis.unibo.it WDM Optical Network Legacy Networks Edge Systems WDM Links λ 1 λ 2 λ 3 λ 4 Core Nodes 2 1 Wavelength Routing
More informationNext Steps Spring 2011 Lecture #18. Multi-hop Networks. Network Reliability. Have: digital point-to-point. Want: many interconnected points
Next Steps Have: digital point-to-point We ve worked on link signaling, reliability, sharing Want: many interconnected points 6.02 Spring 2011 Lecture #18 multi-hop networks: design criteria network topologies
More informationLecture 21. Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov.
Lecture 21 Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov. 7 http://money.cnn.com/2011/11/07/technology/juniper_internet_outage/
More informationIntroduction: Two motivating examples for the analytical approach
Introduction: Two motivating examples for the analytical approach Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. D. Manjunath Outline
More informationCSE 123A Computer Networks
CSE 123A Computer Networks Winter 2005 Lecture 14 Congestion Control Some images courtesy David Wetherall Animations by Nick McKeown and Guido Appenzeller The bad news and the good news The bad news: new
More informationThe final publication is available at
Document downloaded from: http://hdl.handle.net/10251/82062 This paper must be cited as: Peñaranda Cebrián, R.; Gómez Requena, C.; Gómez Requena, ME.; López Rodríguez, PJ.; Duato Marín, JF. (2016). The
More informationInterconnection Networks: Topology. Prof. Natalie Enright Jerger
Interconnection Networks: Topology Prof. Natalie Enright Jerger Topology Overview Definition: determines arrangement of channels and nodes in network Analogous to road map Often first step in network design
More informationNetworks. Distributed Systems. Philipp Kupferschmied. Universität Karlsruhe, System Architecture Group. May 6th, 2009
Networks Distributed Systems Philipp Kupferschmied Universität Karlsruhe, System Architecture Group May 6th, 2009 Philipp Kupferschmied Networks 1/ 41 1 Communication Basics Introduction Layered Communication
More informationHybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks
Hybrid Control and Switched Systems Lecture #17 Hybrid Systems Modeling of Communication Networks João P. Hespanha University of California at Santa Barbara Motivation Why model network traffic? to validate
More information4. Networks. in parallel computers. Advances in Computer Architecture
4. Networks in parallel computers Advances in Computer Architecture System architectures for parallel computers Control organization Single Instruction stream Multiple Data stream (SIMD) All processors
More informationUnicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks
Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on
More informationOutline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste
Outline 15-441 Computer Networking Lecture 18 TCP Performance Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 TCP congestion avoidance TCP slow start TCP modeling TCP details 2 AIMD Distributed,
More informationTCP and BBR. Geoff Huston APNIC
TCP and BBR Geoff Huston APNIC Computer Networking is all about moving data The way in which data movement is controlled is a key characteristic of the network architecture The Internet protocol passed
More informationRemoving the Latency Overhead of the ITB Mechanism in COWs with Source Routing Λ
Removing the Latency Overhead of the ITB Mechanism in COWs with Source Routing Λ J. Flich, M. P. Malumbres, P. López and J. Duato Dpto. of Computer Engineering (DISCA) Universidad Politécnica de Valencia
More informationFrame Relay. Frame Relay: characteristics
Frame Relay Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Network management and QoS provisioning - 1 Frame Relay: characteristics Packet switching
More informationAppendix B. Standards-Track TCP Evaluation
215 Appendix B Standards-Track TCP Evaluation In this appendix, I present the results of a study of standards-track TCP error recovery and queue management mechanisms. I consider standards-track TCP error
More informationCongestion Control for High Bandwidth-delay Product Networks. Dina Katabi, Mark Handley, Charlie Rohrs
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Outline Introduction What s wrong with TCP? Idea of Efficiency vs. Fairness XCP, what is it? Is it
More informationRandom Early Detection (RED) gateways. Sally Floyd CS 268: Computer Networks
Random Early Detection (RED) gateways Sally Floyd CS 268: Computer Networks floyd@eelblgov March 20, 1995 1 The Environment Feedback-based transport protocols (eg, TCP) Problems with current Drop-Tail
More informationDelay Tolerant Networks
Delay Tolerant Networks DEPARTMENT OF INFORMATICS & TELECOMMUNICATIONS NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS What is different? S A wireless network that is very sparse and partitioned disconnected
More informationETSF10 Internet Protocols Transport Layer Protocols
ETSF10 Internet Protocols Transport Layer Protocols 2012, Part 2, Lecture 2.1 Kaan Bür, Jens Andersson Transport Layer Protocols Process-to-process delivery [ed.4 ch.23.1] [ed.5 ch.24.1] Transmission Control
More informationCHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS
28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the
More informationThis Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network
This Lecture BUS0 - Computer Facilities Network Management Switching networks Circuit switching Packet switching gram approach Virtual circuit approach Routing in switching networks Faculty of Information
More informationTransmission Control Protocol. ITS 413 Internet Technologies and Applications
Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion
More informationInterconnection Networks: Routing. Prof. Natalie Enright Jerger
Interconnection Networks: Routing Prof. Natalie Enright Jerger Routing Overview Discussion of topologies assumed ideal routing In practice Routing algorithms are not ideal Goal: distribute traffic evenly
More informationETSF05/ETSF10 Internet Protocols. Performance & QoS Congestion Control
ETSF05/ETSF10 Internet Protocols Performance & QoS Congestion Control Quality of Service (QoS) Maintaining a functioning network Meeting applications demands User s demands = QoE (Quality of Experience)
More informationFuture Routing Schemes in Petascale clusters
Future Routing Schemes in Petascale clusters Gilad Shainer, Mellanox, USA Ola Torudbakken, Sun Microsystems, Norway Richard Graham, Oak Ridge National Laboratory, USA Birds of a Feather Presentation Abstract
More informationTransport layer issues
Transport layer issues Dmitrij Lagutin, dlagutin@cc.hut.fi T-79.5401 Special Course in Mobility Management: Ad hoc networks, 28.3.2007 Contents Issues in designing a transport layer protocol for ad hoc
More informationLecture 4 Wide Area Networks - Congestion in Data Networks
DATA AND COMPUTER COMMUNICATIONS Lecture 4 Wide Area Networks - Congestion in Data Networks Mei Yang Based on Lecture slides by William Stallings 1 WHAT IS CONGESTION? congestion occurs when the number
More informationQCN: Quantized Congestion Notification. Rong Pan, Balaji Prabhakar, Ashvin Laxmikantha
QCN: Quantized Congestion Notification Rong Pan, Balaji Prabhakar, Ashvin Laxmikantha Overview Description the QCN scheme Pseudocode available with Rong Pan: ropan@cisco.com Basic simulations Infinitely
More informationXCP: explicit Control Protocol
XCP: explicit Control Protocol Dina Katabi MIT Lab for Computer Science dk@mit.edu www.ana.lcs.mit.edu/dina Sharing the Internet Infrastructure Is fundamental Much research in Congestion Control, QoS,
More informationChapter 24 Congestion Control and Quality of Service 24.1
Chapter 24 Congestion Control and Quality of Service 24.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24-1 DATA TRAFFIC The main focus of congestion control
More informationCombining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing?
Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing? J. Flich 1,P.López 1, M. P. Malumbres 1, J. Duato 1, and T. Rokicki 2 1 Dpto. Informática
More informationLayer 3: Network Layer. 9. Mar INF-3190: Switching and Routing
Layer 3: Network Layer 9. Mar. 2005 1 INF-3190: Switching and Routing Network Layer Goal Enable data transfer from end system to end system End systems Several hops, (heterogeneous) subnetworks Compensate
More informationInterconnection Network
Interconnection Network Recap: Generic Parallel Architecture A generic modern multiprocessor Network Mem Communication assist (CA) $ P Node: processor(s), memory system, plus communication assist Network
More informationTCP Congestion Control : Computer Networking. Introduction to TCP. Key Things You Should Know Already. Congestion Control RED
TCP Congestion Control 15-744: Computer Networking L-4 TCP Congestion Control RED Assigned Reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [TFRC] Equation-Based Congestion Control
More informationRCRT:Rate-Controlled Reliable Transport Protocol for Wireless Sensor Networks
RCRT:Rate-Controlled Reliable Transport Protocol for Wireless Sensor Networks JEONGYEUP PAEK, RAMESH GOVINDAN University of Southern California 1 Applications that require the transport of high-rate data
More informationCongestion Control and Resource Allocation
Congestion Control and Resource Allocation Lecture material taken from Computer Networks A Systems Approach, Third Edition,Peterson and Davie, Morgan Kaufmann, 2007. Advanced Computer Networks Congestion
More informationCS 498 Hot Topics in High Performance Computing. Networks and Fault Tolerance. 9. Routing and Flow Control
CS 498 Hot Topics in High Performance Computing Networks and Fault Tolerance 9. Routing and Flow Control Intro What did we learn in the last lecture Topology metrics Including minimum diameter of directed
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationCongestion Management Protocols Simulation Results and Protocol Variations
Congestion Management Protocols Simulation Results and Protocol Variations Guenter Roeck, Teak Technologies July 2007 1 Rationale Independent protocol validation Determine performance of CPRP probing
More informationOFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management
Marina Garcia 22 August 2013 OFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management M. Garcia, E. Vallejo, R. Beivide, M. Valero and G. Rodríguez Document number OFAR-CM: Efficient Dragonfly
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Amin Vahdat, Dina Katabi Lecture 14 Overview" TCP congestion control review XCP Overview 2 Congestion Control
More informationCongestion Control for High Bandwidth-delay Product Networks
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Chi-Yao Hong Adapted from slides by Dina Katabi CS598pbg Sep. 10, 2009 Trends in the Future
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11 1 Midterm exam Midterm this Thursday Close book but one-side 8.5"x11" note is allowed (must
More informationP802.1Qcz Congestion Isolation
P802.1Qcz Congestion Isolation IEEE 802 / IETF Workshop on Data Center Networking Bangkok November 2018 Paul Congdon (Huawei/Tallac) The Case for Low-latency, Lossless, Large-Scale DCNs More and more latency-sensitive
More informationTCP and BBR. Geoff Huston APNIC. #apricot
TCP and BBR Geoff Huston APNIC The IP Architecture At its heart IP is a datagram network architecture Individual IP packets may be lost, re-ordered, re-timed and even fragmented The IP Architecture At
More informationChapter III. congestion situation in Highspeed Networks
Chapter III Proposed model for improving the congestion situation in Highspeed Networks TCP has been the most used transport protocol for the Internet for over two decades. The scale of the Internet and
More informationActivity-Based Congestion Management for Fair Bandwidth Sharing in Trusted Packet Networks
Communication Networks Activity-Based Congestion Management for Fair Bandwidth Sharing in Trusted Packet Networks Michael Menth and Nikolas Zeitler http://kn.inf.uni-tuebingen.de Outline The problem Definition
More informationdifferent problems from other networks ITU-T specified restricted initial set Limited number of overhead bits ATM forum Traffic Management
Traffic and Congestion Management in ATM 3BA33 David Lewis 3BA33 D.Lewis 2007 1 Traffic Control Objectives Optimise usage of network resources Network is a shared resource Over-utilisation -> congestion
More informationNetwork-on-chip (NOC) Topologies
Network-on-chip (NOC) Topologies 1 Network Topology Static arrangement of channels and nodes in an interconnection network The roads over which packets travel Topology chosen based on cost and performance
More informationSwitched Network Latency Problems Solved
1 Switched Network Latency Problems Solved A Lightfleet Whitepaper by the Lightfleet Technical Staff Overview The biggest limiter to network performance is the control plane the array of processors and
More informationCS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP
CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering
More information6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long
6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long Please read Chapter 19 of the 6.02 book for background, especially on acknowledgments (ACKs), timers,
More informationNetwork Control and Signalling
Network Control and Signalling 1. Introduction 2. Fundamentals and design principles 3. Network architecture and topology 4. Network control and signalling 5. Network components 5.1 links 5.2 switches
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationQuality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel
Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel Semra.gulder@crc.ca, mathieu.deziel@crc.ca Abstract: This paper describes a QoS mechanism suitable for Mobile Ad Hoc Networks
More informationCS-534 Packet Switch Architecture
CS-534 Packet Switch Architecture The Hardware Architect s Perspective on High-Speed Networking and Interconnects Manolis Katevenis University of Crete and FORTH, Greece http://archvlsi.ics.forth.gr/~kateveni/534
More information