We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byNia Yeates
Modified over 2 years ago
Alex Shpiner, Eitan Zahavi, Ori Rottenstreich April 2014 The Buffer - Bandwidth Tradeoff in Lossless Networks
© 2014 Mellanox Technologies 2 - Mellanox Technologies- Background: Network Incast Congestion Source: 100% 300%
© 2014 Mellanox Technologies 3 - Mellanox Technologies- Background: Pause Frame Flow Control Source: Buffer
© 2014 Mellanox Technologies 4 - Mellanox Technologies- Background: Incast with Pause Frame Flow Control Source: 33% 100%
© 2014 Mellanox Technologies 5 - Mellanox Technologies- Background: Congestion Spreading Problem Source: This flow is also paused, since the pause control does not distinguish between flows. Effective link bandwidth= Link bandwidth * %unpaused Trade-off 33% instead of 66%
© 2014 Mellanox Technologies 6 - Mellanox Technologies- Buffer-bandwidth Tradeoff Effective bandwidth = Link bandwidth * %unpaused
© 2014 Mellanox Technologies 7 - Mellanox Technologies- Evaluation Flow 1). Assume network with links of bandwidth C and buffers of size B 2). Define the most challenging workload the network can handle without congestion spreading 3). Increase links bandwidth by α and reduce buffer size by β 4). Evaluate the relation between α and β that able to handle the workload from step 2. Transmit the workload at the same rate, while keeping the same effective link bandwidth
© 2014 Mellanox Technologies 8 - Mellanox Technologies- Network Model The most challenging workload:
© 2014 Mellanox Technologies 9 - Mellanox Technologies- Determining the Workload Parameters Arrival rate Queue size N senders
© 2014 Mellanox Technologies 10 - Mellanox Technologies- Effect of Buffer Size Reduction with Link Acceleration Arriving traffic Input Queue Size Input Queue Size
© 2014 Mellanox Technologies 11 - Mellanox Technologies- Effect of Buffer Size Reduction with Link Acceleration– cont.
© 2014 Mellanox Technologies 12 - Mellanox Technologies- Effect of Buffer Size Reduction with Link Acceleration– cont.
© 2014 Mellanox Technologies 13 - Mellanox Technologies- Asymptotic Analysis α N By increasing link bandwidth by X% the buffer saving is at least X% for any incast load!
© 2014 Mellanox Technologies 14 - Mellanox Technologies- Multiple Incast Cascade Analysis Last rank defines the workload parameters: Rank n, α>1, β<1: Rank 1 Rank 2 Rank n
© 2014 Mellanox Technologies 15 - Mellanox Technologies- Conclusions
© 2014 Mellanox Technologies 16 - Mellanox Technologies- Thank You
Test B, 100 Subtraction Facts
1 Maintaining Packet Order in Two-Stage Switches Isaac Keslassy, Nick McKeown Stanford University.
Slide 1 Insert your own content. Slide 2 Insert your own content.
Péter Hága Eötvös Loránd University, Hungary European Conference on Complex Systems 2008 Jerusalem, Israel.
10/11/2014Anue Systems, Inc. 1 v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December.
First: Data Link Layer 1. Retransmission Policy: It deals with how fast a sender times out and what it transmit upon timeout. A jumpy sender that times.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 14.
10/5/2013Multiplication Rule 11 Multiplication Rule 1: If a > b and c > 0 then a c > bc Examples If 7 > 3 and 5 > 0 then 7(5) > 3(5) If 2x + 6 > 8 then.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Real-Time Networks – WAN Traffic Shaping.
Addition 1’s to
1 Chapter 58 - Clinical Syndromes of Metabolic Alkalosis Copyright © 2013 Elsevier Inc. All rights reserved.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 28.
GH Telstra Internet 1 Capacity Measurement for IP Networks Geoff Huston Technical Manager Telstra Internet.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 116.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 40.
Combining Functions Sum, Difference, Product, and Quotient Functions.
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
DISTRIBUTED ADAPTIVE ROUTING FOR BIG-DATA APPLICATIONS RUNNING ON DATA CENTER NETWORKS * Mellanox Technologies LTD, + Technion - EE Department Eitan Zahavi.
Dai Davies, DANTE DRCN 2014 Ghent April
A Switch-Based Approach to Starvation in Data Centers Alex Shpiner and Isaac Keslassy Department of Electrical Engineering, Technion. Gabi Bracha, Eyal.
Addition Facts = = =
Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
Doc. No. IEEE hew-r2 Submission May 2013 Klaus Doppler, NokiaSlide 1 Dense apartment building use case for HEW Date: May 14, 2013 Authors:
Base Station Operation and User Association Mechanisms For Energy- Delay Tradeoffs in Green Cellular Networks by Kyuho Son, Hongseok Kim, Yung Yi, Bhaskar.
1 Real-Time Queueing Theory Presented by: John Lehoczky Carnegie Mellon SAMSI Workshop Congestion Control and Heavy Traffic.
Unit-4 Lecture 9 Network Layer 1. Congestion Prevention Polices. To avoid congestion by using the appropriate polices at different levels. Layers DL Layer.
1 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. On the Capacity of Wireless CSMA/CA Multihop Networks Rafael Laufer and Leonard Kleinrock Bell.
PERFORMANCE One important issue in networking is the performance of the networkhow good is it? We discuss quality of service, an overall measurement.
Created by Susan Neal $100 Fractions Addition Fractions Subtraction Fractions Multiplication Fractions Division General $200 $300 $400 $500 $100 $200.
WEEK 1 You have 10 seconds to name…
Capacity Planning and Queuing Models. Learning Objectives n Discuss the strategic role of capacity planning. n Describe a queuing model using A/B/C notation.
Created by Terri Street; inspired by the work of Jennifer Wagner; revisions courtesy of Stephanie Novack. © 2000, 2009 Background images courtesy of abc.com.
Policy-based Congestion Management for an SMS Gateway Alberto Gonzalez (KTH) Roberto Cosenza (Infoflex) Rolf Stadler (KTH) June 8, 2004, Policy Workshop.
ATM Modernisation & Network Manager Frank Brenner, Director General EUROCONTROL Airbus ProSky Symposium April 8 th – 10 th, 2014, Abu Dhabi.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 3.1 Chapter 3.
Performance Analysis of Peer-to-Peer File Transfer Network Sayantan Mitra Vibhor Goyal 1.
$1 Million $500,000 $250,000 $125,000 $64,000 $32,000 $16,000 $8,000 $4,000 $2,000 $1,000 $500 $300 $200 $100 Welcome.
£1 Million £500,000 £250,000 £125,000 £64,000 £32,000 £16,000 £8,000 £4,000 £2,000 £1,000 £500 £300 £200 £100 Welcome.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Spring 2003CS 3321 Congestion Avoidance. Spring 2003CS 3322 Congestion Avoidance TCP congestion control strategy: –Increase load until congestion occurs,
Slide 1 A Free sample background from
VARUN GUPTA Carnegie Mellon University 1 With: Mor Harchol-Balter (CMU)
Submission doc.: IEEE 11-14/0xxx March 2014 Giwon Park, LG ElectronicsSlide 1 Discussion on power save mode for real time traffic Date: Authors:
Who Wants To Be A Millionaire? Xs Edition Question 1.
1 © 2001, 2002 Cisco Systems, Inc. All rights reserved. Confidential and Proprietary. Flow Control in Fibre Channel (BB_Credits) Lincoln Dale
1 EE384Y: Packet Switch Architectures Part II Sizing Router Buffers (Recent work by Guido Appenzeller) Nick McKeown Professor of Electrical Engineering.
Lift Design Example The following notes give an example for design of lifts.
Absolute Values Solving Absolute Value Equations.
© 2017 SlidePlayer.com Inc. All rights reserved.