Alex Shpiner, Eitan Zahavi, Ori Rottenstreich April 2014 The Buffer - Bandwidth Tradeoff in Lossless Networks.

Slides:



Advertisements
Similar presentations
Who Wants To Be A Millionaire?
Advertisements

Welcome to Who Wants to be a Millionaire
CprE 458/558: Real-Time Systems
Created by Terri Street; inspired by the work of Jennifer Wagner; revisions courtesy of Stephanie Novack. © 2000, 2009 Background images courtesy of abc.com.
Flow Control in Fibre Channel (BB_Credits)
Slide 1 Insert your own content. Slide 2 Insert your own content.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 3.1 Chapter 3.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 116.
1 Chapter 58 - Clinical Syndromes of Metabolic Alkalosis Copyright © 2013 Elsevier Inc. All rights reserved.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 40.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 28.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 14.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 38.
GH Telstra Internet 1 Capacity Measurement for IP Networks Geoff Huston Technical Manager Telstra Internet.
Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 1 Transport-layer optimization for thin-client systems Yukio OGAWA Systems Development Laboratory,
2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt Integer Addition Integer Subtraction.
1 Real-Time Queueing Theory Presented by: John Lehoczky Carnegie Mellon SAMSI Workshop Congestion Control and Heavy Traffic.
Risto Päivinen NEFIS 15 November Project Timetable.
0 - 0.
SymbolsGraphingSolvingCompoundMiscellaneou s
Addition Facts
Welcome to Who Wants to be a Millionaire
1 Data Link Protocols By Erik Reeber. 2 Goals Use SPIN to model-check successively more complex protocols Using the protocols in Tannenbaums 3 rd Edition.
Dai Davies, DANTE DRCN 2014 Ghent April
Performance Analysis of Peer-to-Peer File Transfer Network Sayantan Mitra Vibhor Goyal 1.
A Switch-Based Approach to Starvation in Data Centers Alex Shpiner and Isaac Keslassy Department of Electrical Engineering, Technion. Gabi Bracha, Eyal.
1 Maintaining Packet Order in Two-Stage Switches Isaac Keslassy, Nick McKeown Stanford University.
Objective The student will be able to:
Algebra I 1.2 Order of Operations.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Doc. No. IEEE hew-r2 Submission May 2013 Klaus Doppler, NokiaSlide 1 Dense apartment building use case for HEW Date: May 14, 2013 Authors:
PERFORMANCE One important issue in networking is the performance of the networkhow good is it? We discuss quality of service, an overall measurement.
Submission doc.: IEEE 11-14/0xxx March 2014 Giwon Park, LG ElectronicsSlide 1 Discussion on power save mode for real time traffic Date: Authors:
Pushing the limits of CAN - Scheduling frames with offsets provides a major performance boost Nicolas NAVET INRIA / RealTime-at-Work
Policy-based Congestion Management for an SMS Gateway Alberto Gonzalez (KTH) Roberto Cosenza (Infoflex) Rolf Stadler (KTH) June 8, 2004, Policy Workshop.
Adaptive Backpressure: Efficient Buffer Management for On-Chip Networks Daniel U. Becker, Nan Jiang, George Michelogiannakis, William J. Dally Stanford.
Capacity Planning and Queuing Models
Lift Design Example The following notes give an example for design of lifts.
1 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. On the Capacity of Wireless CSMA/CA Multihop Networks Rafael Laufer and Leonard Kleinrock Bell.
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
Difference, Product and Quotient Functions
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.
 Multiply Numbers Written in Scientific Notation 8 th Grade Math September 4, 2013 Ms. DeFreese.
ATM Modernisation & Network Manager Frank Brenner, Director General EUROCONTROL Airbus ProSky Symposium April 8 th – 10 th, 2014, Abu Dhabi.
Created by Susan Neal $100 Fractions Addition Fractions Subtraction Fractions Multiplication Fractions Division General $200 $300 $400 $500 $100 $200.
Solving Absolute Value Equations Solving Absolute Value Equations
Submission doc.: IEEE 11-10/0443r0 March 2014 Jarkko Kneckt, NokiaSlide 1 What Is P2P Traffic in HEW Simulation Scenarios? Date: Authors:
SM-HBA-2: Integrating FCoE T11/09-530v0 1 October 2009 NOTE: The pdf is unclear on a few slides. Please use the ppt if possible.
10/11/2014Anue Systems, Inc. 1 v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December.
Addition 1’s to 20.
Introduction to Queuing Theory
Test B, 100 Subtraction Facts
Week 1.
Network Operations & administration CS 4592 Lecture 15 Instructor: Ibrahim Tariq.
Overview of IEEE 802.1Qbv Time Aware Shaping
1 Advanced Database Systems Dr. Fatemeh Ahmadi-Abkenari February 2013.
Base Station Operation and User Association Mechanisms For Energy- Delay Tradeoffs in Green Cellular Networks by Kyuho Son, Hongseok Kim, Yung Yi, Bhaskar.
* Mellanox Technologies LTD, + Technion - EE Department
Spring 2003CS 3321 Congestion Avoidance. Spring 2003CS 3322 Congestion Avoidance TCP congestion control strategy: –Increase load until congestion occurs,
Péter Hága Eötvös Loránd University, Hungary European Conference on Complex Systems 2008 Jerusalem, Israel.
 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.
Unit-4 Lecture 9 Network Layer 1. Congestion Prevention Polices. To avoid congestion by using the appropriate polices at different levels. Layers DL Layer.
William Stallings Data and Computer Communications
AMP: A Better Multipath TCP for Data Center Networks
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Presentation transcript:

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

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2024 SlidePlayer.com Inc. All rights reserved.